Proceedings ArticleDOI
Byzantine clock synchronization
Leslie Lamport,P. M. Melliar-Smith +1 more
- pp 68-74
TLDR
An informal description is given of three fault-tolerant clock-synchronization algorithms that work in the presence of arbitrary kinds of failure, including “two-faced” clocks.Abstract:
An informal description is given of three fault-tolerant clock-synchronization algorithms. These algorithms work in the presence of arbitrary kinds of failure, including “two-faced” clocks. Two of the algorithms are derived from Byzantine Generals solutions.read more
Citations
More filters
Journal ArticleDOI
Implementing fault-tolerant services using the state machine approach: a tutorial
TL;DR: The state machine approach is a general method for implementing fault-tolerant services in distributed systems and protocols for two different failure models—Byzantine and fail stop are described.
Journal ArticleDOI
The consensus problem in fault-tolerant computing
TL;DR: Research on the consensus problem is surveyed, approaches are compared, applications are outlined, and directions for future work are suggested.
Journal ArticleDOI
An upper and lower bound for clock synchronization
Jennifer Lundelius,Nancy Lynch +1 more
TL;DR: It is proved that, even if the clocks all run at the same rate as real time and there are no failures, an uncertainty of e in the message delivery time makes it impossible to synchronize the clocks of n processes any more closely than e(1−1/ n ).
Book
Replication management using the state-machine approach
TL;DR: This chapter discusses protocols for replication management, which can be divided into two general classes: "the state machine approach" or "active replication", and the "primary-backup approach", which has no centralized control.
Proceedings ArticleDOI
Fault-tolerant clock synchronization
TL;DR: Two simple efficient distributed algorithms are given: one for keeping clocks in a network synchronized and one for allowing new processors to join the network with their clocks synchronized.
References
More filters
Journal ArticleDOI
The Byzantine Generals Problem
TL;DR: The Albanian Generals Problem as mentioned in this paper is a generalization of Dijkstra's dining philosophers problem, where two generals have to come to a common agreement on whether to attack or retreat, but can communicate only by sending messengers who might never arrive.
Book ChapterDOI
The Byzantine generals problem
TL;DR: In this article, a group of generals of the Byzantine army camped with their troops around an enemy city are shown to agree upon a common battle plan using only oral messages, if and only if more than two-thirds of the generals are loyal; so a single traitor can confound two loyal generals.
Journal ArticleDOI
Reaching Agreement in the Presence of Faults
TL;DR: It is shown that the problem is solvable for, and only for, n ≥ 3m + 1, where m is the number of faulty processors and n is the total number and this weaker assumption can be approximated in practice using cryptographic methods.
Journal ArticleDOI
The Byzantine Generals strike again
TL;DR: The results obtained in the present paper prove that unanimity is achievable in any distributed system if and only if the number of faulty processors in the system is less than one third of the total number of processors and less than half of the connectivity of the system''s network.
Journal ArticleDOI
Synchronizing clocks in the presence of faults
TL;DR: Three algorithms for maintaining clock synchrony in a distributed multiprocess system where each process has its own clock work in the presence of arbitrary clock or process failures, including “two-faced clocks” that present different values to different processes.