Synchronizing clocks in the presence of faults
Journal of the ACM (JACM)
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
Maintaining the time in a distributed system
PODC '83 Proceedings of the second annual ACM symposium on Principles of distributed computing
A new fault-tolerant algorithm for clock synchronization
PODC '84 Proceedings of the third annual ACM symposium on Principles of distributed computing
Fault-tolerant clock synchronization
PODC '84 Proceedings of the third annual ACM symposium on Principles of distributed computing
On the possibility and impossibility of achieving clock synchronization
STOC '84 Proceedings of the sixteenth annual ACM symposium on Theory of 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
Proceedings of the twenty-third annual ACM symposium on Principles of distributed computing
Clock Synchronization with Bounded Global and Local Skew
FOCS '08 Proceedings of the 2008 49th Annual IEEE Symposium on Foundations of Computer Science
Gradient clock synchronization in dynamic networks
Proceedings of the twenty-first annual symposium on Parallelism in algorithms and architectures
Tight bounds for clock synchronization
Journal of the ACM (JACM)
Oblivious gradient clock synchronization
DISC'06 Proceedings of the 20th international conference on Distributed Computing
Dynamic networks: models and algorithms
ACM SIGACT News
Coordinated consensus in dynamic networks
Proceedings of the 30th annual ACM SIGACT-SIGOPS symposium on Principles of distributed computing
Gulliver: a test-bed for developing, demonstrating and prototyping vehicular systems
Proceedings of the 9th ACM international symposium on Mobility management and wireless access
Lower bounds on information dissemination in dynamic networks
DISC'12 Proceedings of the 26th international conference on Distributed Computing
Hi-index | 0.00 |
We study the problem of clock synchronization in highly dynamic networks, where communication links can appear or disappear at any time. The nodes in the network are equipped with hardware clocks, but the rate of the hardware clocks can vary arbitrarily within specific bounds, and the estimates that nodes can obtain about the clock values of other nodes are inherently inaccurate. Our goal in this setting is to output a logical clock at each node, such that the logical clocks of any two nodes are not too far apart, and nodes that remain close to each other in the network for a long time are better synchronized than distant nodes. This property is called gradient clock synchronization. Gradient clock synchronization has been widely studied in the static setting. We show that the bounds for the static case also apply to our highly dynamic setting: if two nodes remain at distance d from each other for sufficiently long, it is possible to synchronize their clocks to within O(d log(D/d)), where D is the diameter of the network. This is known to be optimal for static networks, and since a static network is a special case of a dynamic network, it is optimal for dynamic networks as well. Furthermore, we show that our algorithm has optimal stabilization time: when a path of length d appears between two nodes, the time required until the skew between the two nodes is reduced to O(d log(D/d)) is O(D), which we prove is optimal.