Complexity of network synchronization
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
Knowledge, timed precedence and clocks (preliminary report)
PODC '94 Proceedings of the thirteenth annual ACM symposium on Principles of distributed computing
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
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
Timing-sync protocol for sensor networks
Proceedings of the 1st international conference on Embedded networked sensor systems
Adaptive clock synchronization in sensor networks
Proceedings of the 3rd international symposium on Information processing in sensor networks
Gradient clock synchronization
Proceedings of the twenty-third annual ACM symposium on Principles of distributed computing
The flooding time synchronization protocol
SenSys '04 Proceedings of the 2nd international conference on Embedded networked sensor systems
Brief announcement: gradient clock synchronization in sensor networks
Proceedings of the twenty-fourth annual ACM symposium on Principles of distributed computing
Fault-Tolerant Distributed Clock Generation in VLSI Systems-on-Chip
EDCC '06 Proceedings of the Sixth European Dependable Computing Conference
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
Gradient clock synchronization in dynamic networks
Proceedings of the twenty-first annual symposium on Parallelism in algorithms and architectures
Gradient clock synchronization in wireless sensor networks
IPSN '09 Proceedings of the 2009 International Conference on Information Processing in Sensor Networks
Optimal clock synchronization in networks
Proceedings of the 7th ACM Conference on Embedded Networked Sensor Systems
Oblivious gradient clock synchronization
DISC'06 Proceedings of the 20th international conference on Distributed Computing
Optimal gradient clock synchronization in dynamic networks
Proceedings of the 29th ACM SIGACT-SIGOPS symposium on Principles of distributed computing
ICALP'10 Proceedings of the 37th international colloquium conference on Automata, languages and programming: Part II
WASA'11 Proceedings of the 6th international conference on Wireless algorithms, systems, and applications
Adaptive and dynamic funnel replication in clouds
ACM SIGOPS Operating Systems Review
Hi-index | 0.00 |
We present a novel clock synchronization algorithm and prove tight upper and lower bounds on the worst-case clock skew that may occur between any two participants in any given distributed system. More importantly, the worst-case clock skew between neighboring nodes is (asymptotically) at most a factor of two larger than the best possible bound. While previous results solely focused on the dependency of the skew bounds on the network diameter, we prove that our techniques are optimal also with respect to the maximum clock drift, the uncertainty in message delays, and the imposed bounds on the clock rates. The presented results all hold in a general model where both the clock drifts and the message delays may vary arbitrarily within pre-specified bounds. Furthermore, our algorithm exhibits a number of other highly desirable properties. First, the algorithm ensures that the clock values remain in an affine linear envelope of real time. A better worst-case bound on the accuracy with respect to real time cannot be achieved in the absence of an external timer. Second, the algorithm minimizes the number and size of messages that need to be exchanged in a given time period. Moreover, only a small number of bits must be stored locally for each neighbor. Finally, our algorithm can easily be adapted for a variety of other prominent synchronization models.