Optimistically Terminating Consensus: All Asynchronous Consensus Protocols in One Framework

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

[1]  Piotr Zieliński,et al.  Minimizing latency of agreement protocols , 2006 .

[2]  Achour Mostéfaoui,et al.  Leader-Based Consensus , 2001, Parallel Process. Lett..

[3]  Marko Vukolic,et al.  Asynchronous Byzantine Consensus: Complexity, Resilience and Authentication , 2004 .

[4]  Butler W. Lampson,et al.  The ABCD's of Paxos , 2001, PODC '01.

[5]  Maurice Herlihy,et al.  Impossibility and universality results for wait-free synchronization , 1988, PODC '88.

[6]  Miguel Oom Temudo de Castro,et al.  Practical Byzantine fault tolerance , 1999, OSDI '99.

[7]  Sam Toueg,et al.  The weakest failure detector for solving consensus , 1992, PODC '92.

[8]  André Schiper.  Early consensus in an asynchronous system with a weak failure detector , 1997, Distributed Computing.

[9]  Achour Mostéfaoui,et al.  Consensus in One Communication Step , 2001, PaCT.

[10]  Lorenzo Alvisi,et al.  Fast Byzantine Paxos , 2004 .

[11]  Leslie Lamport,et al.  Disk Paxos , 2003, Distributed Computing.

[12]  Allen Clement,et al.  The Game of Paxos , 2006 .

[13]  Achour Mostéfaoui,et al.  A versatile and modular consensus protocol , 2002, Proceedings International Conference on Dependable Systems and Networks.

[14]  Rachid Guerraoui,et al.  Deconstructing paxos , 2003, SIGA.

[15]  T. J. Watson.  Optimistic Asynchronous Byzantine Agreement , 1999 .

[16]  Miguel Castro,et al.  Practical byzantine fault tolerance and proactive recovery , 2002, TOCS.

[17]  Achour Mostéfaoui,et al.  A Versatile Family of Consensus Protocols Based on Chandra-Toueg's Unreliable Failure Detectors , 2002, IEEE Trans. Computers.

[18]  Leslie Lamport,et al.  Paxos Made Simple , 2001 .

[19]  Piotr Zieliński,et al.  Paxos at war , 2004 .

[20]  Nancy A. Lynch,et al.  Consensus in the presence of partial synchrony , 1988, JACM.

[21]  Piotr Zieliński,et al.  Optimistically Terminating Consensus , 2006 .

[22]  Rachid Guerraoui,et al.  The information structure of indulgent consensus , 2004, IEEE Transactions on Computers.

[23]  Daniel Ph. Zollinger,et al.  FORTH ― A good programming environment for laboratory automation ? II: An example from the laboratory , 1985 .

[24]  Rachid Guerraoui,et al.  Encapsulating Failure Detection: From Crash to Byzantine Failures , 2002, Ada-Europe.

[25]  Leslie Lamport.  Lower bounds for asynchronous consensus , 2003 .

[26]  Nancy A. Lynch,et al.  Impossibility of distributed consensus with one faulty process , 1985, JACM.

[27]  Sam Toueg,et al.  Unreliable failure detectors for reliable distributed systems , 1996, JACM.

[28]  Achour Mostéfaoui,et al.  Solving Consensus Using Chandra-Toueg's Unreliable Failure Detectors: A General Quorum-Based Approach , 1999, DISC.

[29]  Achour Mostéfaoui,et al.  Conditions on input vectors for consensus solvability in asynchronous distributed systems , 2003, J. ACM.

[30]  Leslie Lamport,et al.  Cheap Paxos , 2004, International Conference on Dependable Systems and Networks, 2004.

[31]  Michel Raynal,et al.  A simple and fast asynchronous consensus protocol based on a weak failure detector , 1999, Distributed Computing.