Synchronizing clocks in the presence of faults
Journal of the ACM (JACM)
Reaching approximate agreement in the presence of faults
Journal of the ACM (JACM)
On the possibility and impossibility of achieving clock synchronization
Journal of Computer and System Sciences
Journal of the ACM (JACM)
A new fault-tolerant algorithm for clock synchronization
Information and Computation
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
The art of computer programming, volume 2 (3rd ed.): seminumerical algorithms
The art of computer programming, volume 2 (3rd ed.): seminumerical algorithms
Inexact agreement: accuracy, precision, and graceful degradation
Proceedings of the fourth annual ACM symposium on Principles of distributed computing
The Byzantine Generals Problem
ACM Transactions on Programming Languages and Systems (TOPLAS)
Self-stabilizing systems in spite of distributed control
Communications of the ACM
Analyzing Expected Time by Scheduler-Luck Games
IEEE Transactions on Software Engineering
Uniform Dynamic Self-Stabilizing Leader Election (Extended Absrtact)
WDAG '91 Proceedings of the 5th International Workshop on Distributed Algorithms
Fault-tolerant clock synchronization
PODC '84 Proceedings of the third annual ACM symposium on Principles of distributed computing
Self-stabilizing pulse synchronization inspired by biological pacemaker networks
SSS'03 Proceedings of the 6th international conference on Self-stabilizing systems
Self-stabilizing byzantine agreement
Proceedings of the twenty-fifth annual ACM symposium on Principles of distributed computing
Game authority for robust andscalable distributed selfish-computer systems
Proceedings of the twenty-sixth annual ACM symposium on Principles of distributed computing
A Time-Optimal Self-Stabilizing Synchronizer Using A Phase Clock
IEEE Transactions on Dependable and Secure Computing
Fast self-stabilizing byzantine tolerant digital clock synchronization
Proceedings of the twenty-seventh ACM symposium on Principles of distributed computing
Self-stabilization preserving compiler
ACM Transactions on Programming Languages and Systems (TOPLAS)
Transformations for write-all-with-collision model
Computer Communications
Consensus When All Processes May Be Byzantine for Some Time
SSS '09 Proceedings of the 11th International Symposium on Stabilization, Safety, and Security of Distributed Systems
An Optimal Self-stabilizing Firing Squad
SSS '09 Proceedings of the 11th International Symposium on Stabilization, Safety, and Security of Distributed Systems
SSS'06 Proceedings of the 8th international conference on Stabilization, safety, and security of distributed systems
Self-stabilizing Byzantine digital clock synchronization
SSS'06 Proceedings of the 8th international conference on Stabilization, safety, and security of distributed systems
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
Secret swarm unit: reactive k-secret sharing
INDOCRYPT'07 Proceedings of the cryptology 8th international conference on Progress in cryptology
Clock synchronization in the Byzantine-recovery failure model
OPODIS'07 Proceedings of the 11th international conference on Principles of distributed systems
Byzantine self-stabilizing pulse in a bounded-delay model
SSS'07 Proceedings of the 9h international conference on Stabilization, safety, and security of distributed systems
Stabilizing trust and reputation for self-stabilizing efficient hosts in spite of Byzantine guests
SSS'07 Proceedings of the 9h international conference on Stabilization, safety, and security of distributed systems
Game authority for robust and scalable distributed selfish-computer systems
Theoretical Computer Science
A new self-stabilizing minimum spanning tree construction with loop-free property
DISC'09 Proceedings of the 23rd international conference on Distributed computing
Stabilizing trust and reputation for self-stabilizing efficient hosts in spite of byzantine guests
ACM SIGOPS Operating Systems Review
Algorithms and theory of computation handbook
The impact of topology on Byzantine containment in stabilization
DISC'10 Proceedings of the 24th international conference on Distributed computing
A fault-resistant asynchronous clock function
SSS'10 Proceedings of the 12th international conference on Stabilization, safety, and security of distributed systems
Loop-free super-stabilizing spanning tree construction
SSS'10 Proceedings of the 12th international conference on Stabilization, safety, and security of distributed systems
On byzantine containment properties of the min + 1 protocol
SSS'10 Proceedings of the 12th international conference on Stabilization, safety, and security of distributed systems
Self-stabilizing Byzantine asynchronous unison
OPODIS'10 Proceedings of the 14th international conference on Principles of distributed systems
Dynamic FTSS in asynchronous systems: The case of unison
Theoretical Computer Science
Fault-tolerant algorithms for tick-generation in asynchronous logic: robust pulse generation
SSS'11 Proceedings of the 13th international conference on Stabilization, safety, and security of distributed systems
Maximum metric spanning tree made Byzantine tolerant
DISC'11 Proceedings of the 25th international conference on Distributed computing
Self-stabilization of byzantine protocols
SSS'05 Proceedings of the 7th international conference on Self-Stabilizing Systems
Self-stabilization preserving compiler
SSS'05 Proceedings of the 7th international conference on Self-Stabilizing Systems
Fast computation by population protocols with a leader
DISC'06 Proceedings of the 20th international conference on Distributed Computing
Research note: Self-stabilizing byzantine asynchronous unison
Journal of Parallel and Distributed Computing
Survey: Robust and scalable middleware for selfish-computer systems
Computer Science Review
An Optimal Self-Stabilizing Firing Squad
SIAM Journal on Computing
FUN'12 Proceedings of the 6th international conference on Fun with Algorithms
A Lightweight Method for Automated Design of Convergence in Network Protocols
ACM Transactions on Autonomous and Adaptive Systems (TAAS) - Special Section: Extended Version of SASO 2011 Best Paper
On self-stabilizing synchronous actions despite byzantine attacks
DISC'07 Proceedings of the 21st international conference on Distributed Computing
Brief announcement: self-stabilizing synchronization of arbitrary digraphs in presence of faults
SSS'12 Proceedings of the 14th international conference on Stabilization, Safety, and Security of Distributed Systems
Journal of Computer and System Sciences
| Hi-index | 0.01 |
We initiate a study of bounded clock synchronization under a more severe fault model than that proposed by Lamport and Melliar-Smith [1985]. Realistic aspects of the problem of synchronizing clocks in the presence of faults are considered. One aspect is that clock synchronization is an on-going task, thus the assumption that some of the processors never fail is too optimistic. To cope with this reality, we suggest self-stabilizing protocols that stabilize in any (long enough) period in which less than a third of the processors are faulty. Another aspect is that the clock value of each processor is bounded. A single transient fault may cause the clock to reach the upper bound. Therefore, we suggest a bounded clock that wraps around when appropriate.We present two randomized self-stabilizing protocols for synchronizing bounded clocks in the presence of Byzantine processor failures. The first protocol assumes that processors have a common pulse, while the second protocol does not. A new type of distributed counter based on the Chinese remainder theorem is used as part of the first protocol.