Bosco: One-Step Byzantine Asynchronous Consensus

Asynchronous Byzantine consensus algorithms are an important primitive for building Byzantine fault-tolerant systems. Algorithms for Byzantine consensus typically require at least two communication steps for decision; in many systems, this imposes a significant performance overhead. In this paper, we show that it is possible to design Byzantine fault-tolerant consensus algorithms that decide in one message latency under contention-free scenarios and still provide strong consistency guarantees when contention occurs. We define two variants of one-step asynchronous Byzantine consensus and show a lower bound on the number of processors needed for each. We present a Byzantine consensus algorithm, Bosco, for asynchronous networks that meets these bounds, even in the face of a strong network adversary.

[1]  Leslie Lamport,et al.  The Byzantine Generals Problem , 1982, TOPL.

[2]  Michael Ben-Or,et al.  Another advantage of free choice (Extended Abstract): Completely asynchronous agreement protocols , 1983, PODC '83.

[3]  Michael Ben-Or,et al.  Another advantage of free choice (Extended Abstract): Completely asynchronous agreement protocols , 1983, PODC '83.

[4]  Nancy A. Lynch,et al.  Impossibility of distributed consensus with one faulty process , 1983, PODS '83.

[5]  Michael K. Reiter,et al.  Probabilistic quorum systems , 1997, PODC '97.

[6]  Leslie Lamport,et al.  The part-time parliament , 1998, TOCS.

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

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

[9]  Idit Keidar,et al.  On the cost of fault-tolerant consensus when there are no faults: preliminary version , 2001, SIGA.

[10]  Idit Keidar,et al.  On the Cost of Fault-Tolerant Consensus When There Are No Faults - A Tutorial , 2003, LADC.

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

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

[13]  Roy Friedman,et al.  Simple and Efficient Oracle-Based Consensus Protocols for Asynchronous Byzantine Systems , 2005, IEEE Trans. Dependable Secur. Comput..

[14]  Michael K. Reiter,et al.  Fault-scalable Byzantine fault-tolerant services , 2005, SOSP '05.

[15]  Piotr Zielinski,et al.  Optimistically Terminating Consensus: All Asynchronous Consensus Protocols in One Framework , 2006, 2006 Fifth International Symposium on Parallel and Distributed Computing.

[16]  Liuba Shrira,et al.  HQ replication: a hybrid quorum protocol for byzantine fault tolerance , 2006, OSDI '06.

[17]  André Schiper,et al.  The Heard-Of Model: Unifying all Benign Failures , 2006 .

[18]  Dan Dobre,et al.  One-step Consensus with Zero-Degradation , 2006, International Conference on Dependable Systems and Networks (DSN'06).

[19]  Jean-Philippe Martin,et al.  Fast Byzantine Consensus , 2006, IEEE Transactions on Dependable and Secure Computing.

[20]  Leslie Lamport,et al.  Fast Paxos , 2006, Distributed Computing.

[21]  Michael K. Reiter,et al.  Probabilistic Opaque Quorum Systems , 2007, DISC.

[22]  André Schiper,et al.  Tolerating corrupted communication , 2007, PODC '07.

[23]  Michael K. Reiter,et al.  Low-overhead byzantine fault-tolerant storage , 2007, SOSP.

[24]  Ramakrishna Kotla,et al.  Zyzzyva: speculative byzantine fault tolerance , 2007, TOCS.