Reaching Agreement in the Presence of Faults
Journal of the ACM (JACM)
The Byzantine Generals Problem
ACM Transactions on Programming Languages and Systems (TOPLAS)
Synchronizing clocks in the presence of faults
Journal of the ACM (JACM)
Byzantine clock synchronization
ACM SIGOPS Operating Systems Review
A turnable protocol for symmetric surveillance in distributed systems
SIGCOMM '86 Proceedings of the ACM SIGCOMM conference on Communications architectures & protocols
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
Non-byzantine clock synchronization—a programming experiment
ACM SIGOPS Operating Systems Review
A Design Approach for Self-Diagnosis of Fault-Tolerant Clock Synchronization
IEEE Transactions on Computers
Analysis of Self-Stabilizing Clock Synchronization by Means of Stochastic Petri Nets
IEEE Transactions on Computers
Implementing Fail-Silent Nodes for Distributed Systems
IEEE Transactions on Computers
Easy impossibility proofs for distributed consensus problems
Proceedings of the fourth annual ACM symposium on Principles of distributed computing
Proceedings of the fourth annual ACM symposium on Principles of distributed computing
A formal model of knowledge, action, and communication in distributed systems: preliminary report
Proceedings of the fourth annual ACM symposium on Principles of distributed computing
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
Fault-tolerant clock synchronization
PODC '84 Proceedings of the third annual ACM symposium on Principles of distributed computing
A Timeout-Based Message Ordering Protocol for a Lightweight Software Implementation of TMR Systems
IEEE Transactions on Parallel and Distributed Systems
Low-cost clock synchronization
Distributed Computing
Global Clock Synchronization in Sensor Networks
IEEE Transactions on Computers
Consensus in the presence of partial synchrony (Preliminary Version)
PODC '84 Proceedings of the third annual ACM symposium on Principles of distributed computing
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
Optimal gradient clock synchronization in dynamic networks
Proceedings of the 29th ACM SIGACT-SIGOPS symposium on Principles of distributed computing
Synchronization in sensor networks: an overview
MILCOM'06 Proceedings of the 2006 IEEE conference on Military communications
Clock synchronization issues in multi-cluster time-triggered networks
MMB&DFT'10 Proceedings of the 15th international GI/ITG conference on Measurement, Modelling, and Evaluation of Computing Systems and Dependability and Fault Tolerance
| Hi-index | 0.01 |
It is known that clock synchronization can be achieved in the presence of faulty clocks numbering more than one-third of the total number of participating clocks provided that some authentication technique is used. Without authentication the number of faults that can be tolerated has been an open question. Here we show that if we restrict logical clocks to running within some linear function of real time, then clock synchronization is impossible, without authentication, when one-third or more of the processors are faulty. However, if there is a bound on the rate at which a processor can generate messages, then we show that clock synchronization is achievable, without authentication, as long as the faults do not disconnect the network. Finally, we provide a lower bound on the closeness to which simultaneity can be achieved in the network as a function of the transmission and processing delay properties of the network.