DocumentCode
3549450
Title
Fast Byzantine consensus
Author
Martin, Jean-Philippe ; Alvisi, Lorenzo
Author_Institution
Dept. of Comput. Sci., Texas Univ., Austin, TX, USA
fYear
2005
fDate
28 June-1 July 2005
Firstpage
402
Lastpage
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
distributed processing; fault tolerant computing; finite state machines; protocols; system recovery; consensus protocol; fast asynchronous Byzantine consensus; fault tolerant computing; replicated state machine; system recovery; Computer crashes; Delay; Fault tolerance; Fault tolerant systems; Paper technology; Pathology; Protection; Protocols; Safety; Software performance;
fLanguage
English
Publisher
ieee
Conference_Titel
Dependable Systems and Networks, 2005. DSN 2005. Proceedings. International Conference on
Print_ISBN
0-7695-2282-3
Type
conf
DOI
10.1109/DSN.2005.48
Filename
1467815
Link To Document