Journal ArticleDOI
Probabilistic clock synchronization
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
Citations
More filters
Posted Content
Gradient Clock Synchronization using Reference Broadcasts
Fabian Kuhn,Rotem Oshman +1 more
TL;DR: In this article, reference broadcast synchronization (RBS) and other methods of estimating clock values can be incorporated in standard clock synchronization algorithms to improve synchronization quality, by means of a virtual estimate graph, overlaid on top of the real network graph, which represents the information various nodes can obtain about each other.
Book ChapterDOI
Gradient Clock Synchronization Using Reference Broadcasts
Fabian Kuhn,Rotem Oshman +1 more
TL;DR: This work suggests a method by which RBS can be incorporated in standard internal clock synchronization algorithms by separating the task of estimating the clock values of other nodes in the network from thetask of using these estimates to output a logical clock value.
Proceedings ArticleDOI
Performance evaluation of time synchronization and clock drift compensation in wireless personal area networks
TL;DR: This paper evaluates the performance of algorithms based on three different approaches; one that synchronizes the local clocks on the sensor nodes, and a second that uses a single clock on the receiving node (e.g. a mobile phone), and a third that uses broadcast messages.
Proceedings ArticleDOI
vNetTracer: Efficient and Programmable Packet Tracing in Virtualized Networks
TL;DR: In this paper, an efficient and programmable packet profiler for virtualized networks, vNetTracer, relies on the extended Berkeley Packet Filter (eBPF) to dynamically insert user-defined trace programs into a live virtualized network without any changes to the applications or restarts of the monitored network.
Proceedings ArticleDOI
A statistical clock synchronization algorithm for anisotropic networks
D. Couvet,G. Florin,S. Natkin +2 more
TL;DR: A method to estimate the value of remote clocks in distributed systems is proposed that is able to deal with isotropic and anisotropic networks and includes a way to detect performance failures on single exchanges.
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
T. K. Srikanth,Sam Toueg +1 more
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
Jennifer Lundelius,Nancy Lynch +1 more
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
Jennifer L. Welch,Nancy Lynch +1 more
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.