Modeling and Simulation of the Sliding Window Algorithm for Fault-Tolerant Clock Synchronization

Manfred J. PFLUEGL; Douglas M. BLOUGH

Modeling and Simulation of the Sliding Window Algorithm for Fault-Tolerant Clock Synchronization

Manfred J. PFLUEGL, Douglas M. BLOUGH

Full Text Views

0

Share
Cite this

Summary :

Synchronous clocks are an essential requirement for a variety of distributed system applications. Many of these applications are safety-critical and require fault tolerance. In this paper, a general probabilistic clock synchronization model is presented. This model is uniformly probabilistic, incorporating random message delays, random clock drifts, and random fault occurrences. The model allows faults in any system component and of any type. Also, a new Sliding Window Clock Synchronization Algorithm (SWA) providing increased fault tolerance is proposed. The probabilistic model is used for an evaluation of SWA which shows that SWA is capable of tolerating significantly more faults than other algorithms and that the synchronization tightness is as good or better than that of other algorithms.

Publication: IEICE TRANSACTIONS on Information Vol.E75-D No.6 pp.792-796

Publication Date: 1992/11/25

Publicized

Online ISSN

DOI

Type of Manuscript: Special Section PAPER (Special Issue on Pacific Rim International Symposium on Fault Tolerant Systems)

Category

Cite this

Copy

Manfred J. PFLUEGL, Douglas M. BLOUGH, "Modeling and Simulation of the Sliding Window Algorithm for Fault-Tolerant Clock Synchronization" in IEICE TRANSACTIONS on Information, vol. E75-D, no. 6, pp. 792-796, November 1992, doi: .
Abstract: Synchronous clocks are an essential requirement for a variety of distributed system applications. Many of these applications are safety-critical and require fault tolerance. In this paper, a general probabilistic clock synchronization model is presented. This model is uniformly probabilistic, incorporating random message delays, random clock drifts, and random fault occurrences. The model allows faults in any system component and of any type. Also, a new Sliding Window Clock Synchronization Algorithm (SWA) providing increased fault tolerance is proposed. The probabilistic model is used for an evaluation of SWA which shows that SWA is capable of tolerating significantly more faults than other algorithms and that the synchronization tightness is as good or better than that of other algorithms.
URL: https://globals.ieice.org/en_transactions/information/10.1587/e75-d_6_792/_p

Copy

@ARTICLE{e75-d_6_792,
author={Manfred J. PFLUEGL, Douglas M. BLOUGH, },
journal={IEICE TRANSACTIONS on Information},
title={Modeling and Simulation of the Sliding Window Algorithm for Fault-Tolerant Clock Synchronization},
year={1992},
volume={E75-D},
number={6},
pages={792-796},
abstract={Synchronous clocks are an essential requirement for a variety of distributed system applications. Many of these applications are safety-critical and require fault tolerance. In this paper, a general probabilistic clock synchronization model is presented. This model is uniformly probabilistic, incorporating random message delays, random clock drifts, and random fault occurrences. The model allows faults in any system component and of any type. Also, a new Sliding Window Clock Synchronization Algorithm (SWA) providing increased fault tolerance is proposed. The probabilistic model is used for an evaluation of SWA which shows that SWA is capable of tolerating significantly more faults than other algorithms and that the synchronization tightness is as good or better than that of other algorithms.},
keywords={},
doi={},
ISSN={},
month={November},}

Copy

TY - JOUR
TI - Modeling and Simulation of the Sliding Window Algorithm for Fault-Tolerant Clock Synchronization
T2 - IEICE TRANSACTIONS on Information
SP - 792
EP - 796
AU - Manfred J. PFLUEGL
AU - Douglas M. BLOUGH
PY - 1992
DO -
JO - IEICE TRANSACTIONS on Information
SN -
VL - E75-D
IS - 6
JA - IEICE TRANSACTIONS on Information
Y1 - November 1992
AB - Synchronous clocks are an essential requirement for a variety of distributed system applications. Many of these applications are safety-critical and require fault tolerance. In this paper, a general probabilistic clock synchronization model is presented. This model is uniformly probabilistic, incorporating random message delays, random clock drifts, and random fault occurrences. The model allows faults in any system component and of any type. Also, a new Sliding Window Clock Synchronization Algorithm (SWA) providing increased fault tolerance is proposed. The probabilistic model is used for an evaluation of SWA which shows that SWA is capable of tolerating significantly more faults than other algorithms and that the synchronization tightness is as good or better than that of other algorithms.
ER -