Fast Byzantine Consensus
Authors:
- J.-P. MartinJMJ.-P. Martin
- L. AlvisiLAL. Alvisi
- 27 July 2005
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- Vol. 3 (3) , 402-411
Abstract
We present the first consensus protocol that reaches asynchronous Byzantine consensus in two communication steps in the common case. We prove that our protocol is optimal in terms of both number of communication step, and number of processes for 2-step consensus. The protocol can be used to build a replicated state machine that requires only three communication steps per request in the common case.Keywords
This publication has 13 references indexed in Scilit:
- Deconstructing paxosACM SIGACT News, 2003
- Separating agreement from execution for byzantine fault tolerant services2003
- Practical byzantine fault tolerance and proactive recoveryACM Transactions on Computer Systems, 2002
- BASE2001
- A simple and fast asynchronous consensus protocol based on a weak failure detectorDistributed Computing, 1999
- Byzantine quorum systemsDistributed Computing, 1998
- The part-time parliamentACM Transactions on Computer Systems, 1998
- Early consensus in an asynchronous system with a weak failure detectorDistributed Computing, 1997
- Implementing fault-tolerant services using the state machine approach: a tutorialACM Computing Surveys, 1990
- Time, clocks, and the ordering of events in a distributed systemCommunications of the ACM, 1978