Asynchronous Consensus and Broadcast Protocols

Asynchronous Consensus and Broadcast Protocols (1985)

Cached

Download Links

[www.mpi-sws.mpg.de]

Other Repositories/Bibliography

DBLP

by Gabriel Bracha , Sam Toueg

Venue:	Journal of the ACM
Citations:	132 - 4 self

Versions

Version History

Metadata Version 1

Datum	Value	Source
TITLE	Asynchronous Consensus and Broadcast Protocols	INFERENCE
AUTHOR NAME	Gabriel Bracha	SVM HeaderParse 0.2
AUTHOR AFFIL	Cornell University, Ithaca, New York	SVM HeaderParse 0.2
AUTHOR NAME	Sam Toueg	SVM HeaderParse 0.2
AUTHOR AFFIL	Cornell University, Ithaca, New York	SVM HeaderParse 0.2
ABSTRACT	Abstract. A consensus protocol enables a system of n asynchronous processes, some of which are faulty, to reach agreement. There are two kinds of faulty processes: fail-stop processes that can only die and malicious processes that can also send false messages. The class of asynchronous systems with fair schedulers is defined, and consensus protocols that terminate with probability I for these systems are investigated. With fail-stop processes, it is shown that r(n + 1)/21 correct processes are necessary and sufficient to reach agreement. In the malicious case, it is shown that r(2n + 1)/31 correct processes are necessary and sufficient to reach agreement. This is contrasted with an earlier result, stating that there is no consensus protocol for the fail-stop case that always terminates within a bounded number of steps, even if only one process can fail. The possibility of reliable broadcast (Byzantine Agreement) in asynchronous systems is also investigated. Asynchronous Byzantine Agreement is defined, and it is shown that I(2n + 1)/31 correct processes are necessary and sufficient to achieve it.	SVM HeaderParse 0.2
YEAR	1985	INFERENCE
VENUE	Journal of the ACM	INFERENCE
VENUE TYPE	JOURNAL	INFERENCE
PAGES	824--840	INFERENCE
VOLUME	32	INFERENCE
CITATIONS	9 found	ParsCit 1.0