Fast and simple distributed consensus

Authors:
James E. Burns;Gil Neiger
Affiliations:
Bellcore, NVC 3X-114, 331 Newman Springs Road, Post Office Box 7040, Red Bank, New Jersey and College of Computing, Georgia Institute of Technology, Atlanta, GA;College of Computing, Georgia Institute of Technology, Atlanta, GA
Venue:
Distributed Computing
Year:
1994

Citing 5
Cited 0

Early stopping in Byzantine agreement

Journal of the ACM (JACM)
Bounds on information exchange for Byzantine agreement

Journal of the ACM (JACM)
The Byzantine Generals Problem

ACM Transactions on Programming Languages and Systems (TOPLAS)
Early Stopping Protocols for Fault-Tolerant Distributed Agreement

Early Stopping Protocols for Fault-Tolerant Distributed Agreement
Efficient agreement using fault diagnosis

Distributed Computing

Quantified Score

Hi-index	0.00

Visualization

Abstract

The problem of fault-tolerant agreement is fundamental to distributed computing. When agreement is to be reached in spite of arbitrary behavior by faulty processors, this problem is called Distributed Consensus. By requiring that the number of faulty processors be O(√n), where n is the number of processors in the system, we are able to derive two new protocols for Distributed Consensus. Both are simple and use messages that are only one bit in length, and both provide for early stopping: the fewer failures there are, the fewer rounds of communication are required. One protocol is optimal with respect to the number of rounds of communication required, and the other is asymptotically optimal with respect to the total number of message bits exchanged.