scispace - formally typeset
Journal ArticleDOI

Probabilistic clock synchronization

Flaviu Cristian
- 01 Sep 1989 - 
- Vol. 3, Iss: 3, pp 146-158
Reads0
Chats0
TLDR
A probabilistic method is proposed for reading remote clocks in distributed systems subject to unbounded random communication delays and can achieve clock synchronization precisions superior to those attainable by previously published clock synchronization algorithms.
Abstract
A probabilistic method is proposed for reading remote clocks in distributed systems subject to unbounded random communication delays. The method can achieve clock synchronization precisions superior to those attainable by previously published clock synchronization algorithms. Its use is illustrated by presenting a time service which maintains externally (and hence, internally) synchronized clocks in the presence of process, communication and clock failures.

read more

Content maybe subject to copyright    Report

Citations
More filters
Proceedings ArticleDOI

Using libPcap for monitoring distributed applications

TL;DR: An experimental distributed monitoring tool that takes advantage of network traffic capture offered by the OS, in particular, using libPcap to verify the possibility of capturing the traffic relating to a particular process and, based on this information, identify the other application processes and trigger the remote monitoring for those processes.
Proceedings ArticleDOI

Improving robustness of the synchronization quality of IEEE1588 nodes

TL;DR: This paper provides alternative instruments for the analysis and improvement of the synchronization quality of a IEEE 1588 system resorting to the Reliable & Self Aware (R&SA) clock and proposes to take advantage of the statistical data collected for improving reliability and accuracy of PTP nodes.
Journal ArticleDOI

Combination of clock-state and clock-rate correction in fault-tolerant distributed systems

TL;DR: Experimental results show that a failure in the clock rate correction will not hinder the distributed fault-tolerant clock state synchronization algorithm, since the state correction operates independently from the rate correction.
Proceedings ArticleDOI

Rejuvenation and failure detection in partitionable systems

TL;DR: A failure detection based rejuvenation service and a remote detection service that detects and fixes "soft" failures automatically, and the detection service detects (in another partition) all rejuvenations exactly once, within a bounded amount of time, even when the gateway is rejuvenated consecutively.
Proceedings ArticleDOI

Universal synchronization algorithm for wireless sensor networks—“FUSA algorithm”

TL;DR: An advanced synchronization algorithm for WSN that is versatile, scalable and easy for implementation and can be used with Hierarchical as well as decentralized network topology.
References
More filters
Journal ArticleDOI

Clock Synchronization in Distributed Real-Time Systems

TL;DR: Depending on the types and number of tolerated faults, this paper presents upper bounds on the achievable synchronization accuracy for external and internal synchronization in a distributed real-time system.
Journal ArticleDOI

Synchronizing clocks in the presence of faults

TL;DR: Three algorithms for maintaining clock synchrony in a distributed multiprocess system where each process has its own clock work in the presence of arbitrary clock or process failures, including “two-faced clocks” that present different values to different processes.
Journal ArticleDOI

Optimal clock synchronization

TL;DR: This is the first known solution that achieves optimal accuracy—the accuracy of synchronized clocks (with respect to real time) is as good as that specified for the underlying hardware clocks.
Proceedings ArticleDOI

A new fault-tolerant algorithm for clock synchronization

TL;DR: A new fault-tolerant algorithm for solving a variant of Lamport's clock synchronization problem for a system of distributed processes that communicate by sending messages, which solves the problem of maintaining closely synchronized local times, assuming that processes' local times are closely synchronized initially.
Journal ArticleDOI

A new fault-tolerant algorithm for clock synchronization

TL;DR: A new fault-tolerant algorithm for solving a variant of Lamport's clock synchronization problem for a system of distributed processes that communicate by sending messages that maintains synchronization to within a small constant, whose magnitude depends upon the rate of clock drift, the message delivery time and its uncertainty.
Related Papers (5)