Synchronizing clocks in the presence of faults
Journal of the ACM (JACM)
Using Time Instead of Timeout for Fault-Tolerant Distributed Systems.
ACM Transactions on Programming Languages and Systems (TOPLAS)
Ensuring Fault Tolerance of Phase-Locked Clocks
IEEE Transactions on Computers
On the possibility and impossibility of achieving clock synchronization
Journal of Computer and System Sciences
A new look at fault-tolerant network routing
Information and Computation
Journal of the ACM (JACM)
A new fault-tolerant algorithm for clock synchronization
Information and Computation
Fault tolerant distributed services
PODC '88 Proceedings of the seventh annual ACM Symposium on Principles of distributed computing
Reaching Agreement in the Presence of Faults
Journal of the ACM (JACM)
A method for obtaining digital signatures and public-key cryptosystems
Communications of the ACM
Time, clocks, and the ordering of events in a distributed system
Communications of the ACM
Fault-tolerant clock synchronization
PODC '84 Proceedings of the third annual ACM symposium on Principles of distributed computing
Understanding Protocols for Byzantine Clock Synchronization
Understanding Protocols for Byzantine Clock Synchronization
Observable clock synchronization extended abstract
PODC '94 Proceedings of the thirteenth annual ACM symposium on Principles of distributed computing
IEEE Transactions on Parallel and Distributed Systems
Experience with an adaptive globally-synchronizing clock algorithm
Proceedings of the eleventh annual ACM symposium on Parallel algorithms and architectures
Clock synchronization with faults and recoveries (extended abstract)
Proceedings of the nineteenth annual ACM symposium on Principles of distributed computing
A Hybrid Time Synchronization Implemented Through Special Ring Array for Mesh or Torus
IPPS '97 Proceedings of the 11th International Symposium on Parallel Processing
Fault-Tolerant Cluster-Wise Clock Synchronization for Wireless Sensor Networks
IEEE Transactions on Dependable and Secure Computing
TinySeRSync: secure and resilient time synchronization in wireless sensor networks
Proceedings of the 13th ACM conference on Computer and communications security
Fault Tolerant Secure Routing in Cluster Based Mobile Sensor Networks
ISA '09 Proceedings of the 3rd International Conference and Workshops on Advances in Information Security and Assurance
Gradient clock synchronization in dynamic networks
Proceedings of the twenty-first annual symposium on Parallelism in algorithms and architectures
A Byzantine-fault tolerant self-stabilizing protocol for distributed clock synchronization systems
SSS'06 Proceedings of the 8th international conference on Stabilization, safety, and security of distributed systems
Self-stabilizing pulse synchronization inspired by biological pacemaker networks
SSS'03 Proceedings of the 6th international conference on Self-stabilizing systems
Optimal gradient clock synchronization in dynamic networks
Proceedings of the 29th ACM SIGACT-SIGOPS symposium on Principles of distributed computing
Self-stabilization of byzantine protocols
SSS'05 Proceedings of the 7th international conference on Self-Stabilizing Systems
On self-stabilizing synchronous actions despite byzantine attacks
DISC'07 Proceedings of the 21st international conference on Distributed Computing
| Hi-index | 0.00 |
This paper gives two simple efficient distributed algorithms: one for keeping clocks in a network synchronized and one for allowing new processors to join the network with their clocks synchronized. Assuming a fault-tolerant authentication protocol, the algorithms tolerate both link and processor failures of any type. The algorithm for maintaining synchronization works for arbitrary networks (rather than just completely connected networks) and tolerates any number of processor or communication link faults as long as the correct processors remain connected by fault-free paths. It thus represents an improvement over other clock synchronization algorithms such as those of Lamport and Melliar Smith and Welch and Lynch, although, unlike them, it does require an authentication protocol to handle Byzantine faults. Our algorithm for allowing new processors to join requires that more than half the processors be correct, a requirement that is provably necessary.