Synchronizing clocks in the presence of faults
Journal of the ACM (JACM)
On the possibility and impossibility of achieving clock synchronization
Journal of Computer and System Sciences
Journal of the ACM (JACM)
A theory of clock synchronization (extended abstract)
STOC '94 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing
Dynamic fault-tolerant clock synchronization
Journal of the ACM (JACM)
Optimal and efficient clock synchronization under drifting clocks
Proceedings of the eighteenth annual ACM symposium on Principles of distributed computing
Closed form bounds for clock synchronization under simple uncertainty assumptions
Information Processing Letters
Distributed Algorithms
Optimal Clock Synchronization Under Different Delay Assumptions
SIAM Journal on Computing
Maintaining the time in a distributed system
PODC '83 Proceedings of the second annual ACM symposium on Principles of distributed computing
Fine-grained network time synchronization using reference broadcasts
ACM SIGOPS Operating Systems Review - OSDI '02: Proceedings of the 5th symposium on Operating systems design and implementation
Gradient clock synchronization
Distributed Computing - Special issue: PODC 04
The Theory of Timed I/O Automata (Synthesis Lectures in Computer Science)
The Theory of Timed I/O Automata (Synthesis Lectures in Computer Science)
Clock Synchronization with Bounded Global and Local Skew
FOCS '08 Proceedings of the 2008 49th Annual IEEE Symposium on Foundations of Computer Science
Tight bounds for clock synchronization
Proceedings of the 28th ACM symposium on Principles of distributed computing
Oblivious gradient clock synchronization
DISC'06 Proceedings of the 20th international conference on Distributed Computing
Clock synchronization for wireless networks
OPODIS'04 Proceedings of the 8th international conference on Principles of Distributed Systems
Optimal clock synchronization under energy constraints in wireless ad-hoc networks
OPODIS'05 Proceedings of the 9th international conference on Principles of Distributed Systems
Tight bounds for clock synchronization
Proceedings of the 28th ACM symposium on Principles of distributed computing
Tight bounds for clock synchronization
Journal of the ACM (JACM)
Clock Synchronization: Open Problems in Theory and Practice
SOFSEM '10 Proceedings of the 36th Conference on Current Trends in Theory and Practice of Computer Science
Distributed computation in dynamic networks
Proceedings of the forty-second ACM symposium on Theory of computing
Optimal gradient clock synchronization in dynamic networks
Proceedings of the 29th ACM SIGACT-SIGOPS symposium on Principles of distributed computing
Coordinated consensus in dynamic networks
Proceedings of the 30th annual ACM SIGACT-SIGOPS symposium on Principles of distributed computing
LATIN'12 Proceedings of the 10th Latin American international conference on Theoretical Informatics
Distributed computing in fault-prone dynamic networks
Proceedings of the 4th International Workshop on Theoretical Aspects of Dynamic Distributed Systems
Hi-index | 0.00 |
Over the last years, large-scale decentralized computer networks such as peer-to-peer and mobile ad hoc networks have become increasingly prevalent. The topologies of many of these networks are often highly dynamic. This is especially true for ad hoc networks formed by mobile wireless devices. In this paper, we study the fundamental problem of clock synchronization in dynamic networks. We show that there is an inherent trade-off between the skew S guaranteed along sufficiently old links and the time needed to guarantee a small skew along new links. For any sufficiently large initial skew on a new link, there are executions in which the time required to reduce the skew on the link to O(S) is at least Ω(n/S). We show that this bound is tight for moderately small values of S. Assuming a fixed set of $n$ nodes and an arbitrary pattern of edge insertions and removals, a weak dynamic connectivity requirement suffices to prove the following results. We present an algorithm that always maintains a skew of O(n) between any two nodes in the network. For a parameter S=Ω(√Án), where Á is the maximum hardware clock drift, it is further guaranteed that if a communication link between two nodes u, v persists in the network for Θ(n/S) time, the clock skew between u and v is reduced to no more than O(S).