Optimistically Terminating Consensus: All Asynchronous Consensus Protocols in One Framework

Authors:
Piotr Zielinski
Affiliations:
University of Cambridge, UK
Venue:
ISPDC '06 Proceedings of the Proceedings of The Fifth International Symposium on Parallel and Distributed Computing
Year:
2006

Citing 0
Cited 3

Bosco: One-Step Byzantine Asynchronous Consensus

DISC '08 Proceedings of the 22nd international symposium on Distributed Computing
A general characterization of indulgence

ACM Transactions on Autonomous and Adaptive Systems (TAAS)
A general characterization of indulgence

SSS'06 Proceedings of the 8th international conference on Stabilization, safety, and security of distributed systems

Quantified Score

Hi-index	0.00

Visualization

Abstract

Optimistically Terminating Consensus (OTC) is a variant of Consensus that decides if all correct processes propose the same value. It is surprisingly easy to implement: processes broadcast their proposals and decide if sufficiently many processes report the same proposal. This paper shows an OTC-based framework which can reconstruct all major asynchronous Consensus algorithms, even in Byzantine settings, with no overhead in latency or the required number of processes. This result does not only deepen our understanding of Consensus, but also reduces the problem of designing new, modular distributed agreement protocols to choosing the parameters of OTC.