Journal
DISTRIBUTED COMPUTING
Volume 19, Issue 2, Pages 104-125Publisher
SPRINGER
DOI: 10.1007/s00446-006-0155-x
Keywords
consensus; fault tolerance; distributed algorithms; Paxos
Categories
Ask authors/readers for more resources
Impossibility results and best-case lower bounds are proved for the number of message delays and the number of processes required to reach agreement in an asynchronous consensus algorithm that tolerates non-Byzantine failures. General algorithms exist that achieve these lower bounds in the normal case, when the response time of non-faulty processes and the transmission delay of messages they send to one another are bounded. Our theorems allow algorithms to do better in certain exceptional cases, and such algorithms are presented. Two of these exceptional algorithms may be of practical interest.
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available