A method for obtaining digital signatures and public-key cryptosystems
Communications of the ACM
Byzantine clock synchronization
PODC '84 Proceedings of the third 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
On the possibility and impossibility of achieving clock synchronization
STOC '84 Proceedings of the sixteenth annual ACM symposium on Theory of computing
A new look at fault tolerant network routing
STOC '84 Proceedings of the sixteenth annual ACM symposium on Theory of computing
Applications of Byzantine agreement in database systems
ACM Transactions on Database Systems (TODS)
Byzantine clock synchronization
ACM SIGOPS Operating Systems Review
The distributed firing squad problem
STOC '85 Proceedings of the seventeenth annual ACM symposium on Theory of computing
Optimal precision in the presence of uncertainty
STOC '85 Proceedings of the seventeenth annual ACM symposium on Theory of computing
Journal of the ACM (JACM)
Adding time to synchronous process communications
IEEE Transactions on Computers - Special Issue on Real-Time Systems
Asynchronous approximate agreement
PODC '87 Proceedings of the sixth annual ACM Symposium on Principles of distributed computing
Non-byzantine clock synchronization—a programming experiment
ACM SIGOPS Operating Systems Review
Reliable scheduling in a TMR database system
ACM Transactions on Computer Systems (TOCS)
Fault tolerant distributed services
PODC '88 Proceedings of the seventh annual ACM Symposium on Principles of distributed computing
The Accuracy of the Clock Synchronization Achieved by TEMPO in Berkeley UNIX 4.3BSD
IEEE Transactions on Software Engineering
Fast isolation of arbitrary forwarding faults
Proceedings of the eighth annual ACM Symposium on Principles of distributed computing
Constructing replicated systems using processors with point-to-point communication links
ISCA '89 Proceedings of the 16th annual international symposium on Computer architecture
Sirpent: a high-performance internetworking approach
SIGCOMM '89 Symposium proceedings on Communications architectures & protocols
A Design Approach for Self-Diagnosis of Fault-Tolerant Clock Synchronization
IEEE Transactions on Computers
IEEE Transactions on Computers
Analysis of Self-Stabilizing Clock Synchronization by Means of Stochastic Petri Nets
IEEE Transactions on Computers
Hardware-Assisted Software Clock Synchronization for Homogeneous Distributed Systems
IEEE Transactions on Computers
Continuous clock amortization need not affect the precision of a clock synchronization algorithm
PODC '90 Proceedings of the ninth annual ACM symposium on Principles of distributed computing
Implementing fault-tolerant services using the state machine approach: a tutorial
ACM Computing Surveys (CSUR)
STOC '92 Proceedings of the twenty-fourth annual ACM symposium on Theory of computing
Principal Features of the VOLTAN Family of Reliable Node Architectures for Distributed Systems
IEEE Transactions on Computers - Special issue on fault-tolerant computing
Wait-free clock synchronization
PODC '93 Proceedings of the twelfth annual ACM symposium on Principles of distributed computing
Unifying self-stabilization and fault-tolerance
PODC '93 Proceedings of the twelfth annual ACM symposium on Principles of distributed computing
Knowledge, timed precedence and clocks (preliminary report)
PODC '94 Proceedings of the thirteenth annual ACM symposium on Principles of distributed computing
Dynamic fault-tolerant clock synchronization
Journal of the ACM (JACM)
Lower bounds for convergence function based clock synchronization
Proceedings of the fourteenth annual ACM symposium on Principles of distributed computing
Implementing Fail-Silent Nodes for Distributed Systems
IEEE Transactions on Computers
CesiumSpray: a Precise and Accurate Global Time Servicefor Large-scale Systems
Real-Time Systems - Special issue on global time in large scale distributed real-time systems, part III
Proceedings of the fourth annual ACM symposium on Principles of distributed computing
Inexact agreement: accuracy, precision, and graceful degradation
Proceedings of the fourth annual ACM symposium on Principles of distributed computing
Real-Time Systems - Special issue on global time in large scale distributed real-time systems, part I
Real-Time Systems - Special issue on global time in large scale distributed real-time systems, part II
Probabilistic Clock Synchronization in Distributed Systems
IEEE Transactions on Parallel and Distributed Systems
Fault-Tolerant Clock Synchronization in Large Multicomputer Systems
IEEE Transactions on Parallel and Distributed Systems
Reconfiguration and transient recovery in state machine architectures
FTCS '96 Proceedings of the The Twenty-Sixth Annual International Symposium on Fault-Tolerant Computing (FTCS '96)
Knowledge and common knowledge in a distributed environment
PODC '84 Proceedings of the third annual ACM symposium on Principles of distributed computing
Byzantine clock synchronization
PODC '84 Proceedings of the third 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
ACM SIGOPS Operating Systems Review
FTCS '95 Proceedings of the Twenty-Fifth International Symposium on Fault-Tolerant Computing
A Timeout-Based Message Ordering Protocol for a Lightweight Software Implementation of TMR Systems
IEEE Transactions on Parallel and Distributed Systems
A brief history of NTP time: memoirs of an Internet timekeeper
ACM SIGCOMM Computer Communication Review
Tiger shark: a scalable file system for multimedia
IBM Journal of Research and Development - Papers on mustimedia systems
Self-stabilizing clock synchronization in the presence of Byzantine faults
Journal of the ACM (JACM)
Clock synchronization and the power of broadcasting
Distributed Computing
Low-cost clock synchronization
Distributed Computing
Fault-Tolerant Cluster-Wise Clock Synchronization for Wireless Sensor Networks
IEEE Transactions on Dependable and Secure Computing
Global Clock Synchronization in Sensor Networks
IEEE Transactions on Computers
Century papers at the first quarter-century milestone
Proceedings of the twenty-fifth annual ACM symposium on Principles of distributed computing
Exploring the interdisciplinary connections of gossip-based systems
ACM SIGOPS Operating Systems Review - Gossip-based computer networking
Scalable synchronization of clocks in wireless sensor networks
Ad Hoc Networks
Secure Time Synchronization in Sensor Networks
ACM Transactions on Information and System Security (TISSEC)
A theoretical evaluation of peer-to-peer internal clock synchronization
Autonomics '08 Proceedings of the 2nd International Conference on Autonomic Computing and Communication Systems
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
Clock synchronization in the Byzantine-recovery failure model
OPODIS'07 Proceedings of the 11th international conference on Principles of distributed systems
OTM'07 Proceedings of the 2007 OTM Confederated international conference on On the move to meaningful internet systems: CoopIS, DOA, ODBASE, GADA, and IS - Volume Part I
Optimal gradient clock synchronization in dynamic networks
Proceedings of the 29th ACM SIGACT-SIGOPS symposium on Principles of distributed computing
| Hi-index | 0.02 |
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. The algorithms tolerate both link and node failures of any type. The algorithm for maintaining synchronization will work 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 [LM1,LM2,LL1]. Our algorithm for allowing new processors to join requires that more than half the processors be correct, a requirement which is provably necessary.