DocumentCode
2297078
Title
From Byzantine Consensus to BFT State Machine Replication: A Latency-Optimal Transformation
Author
Sousa, João ; Bessani, Alysson
Author_Institution
Fac. of Sci., Univ. of Lisbon, Lisbon, Portugal
fYear
2012
fDate
8-11 May 2012
Firstpage
37
Lastpage
48
Abstract
We present a new algorithm for state machine replication that is built around a leader-driven consensus primitive. This algorithm requires only two additional communication steps between replicas and clients if the consensus leader is correct and the system is synchronous, being thus the first latency-optimal transformation from Byzantine consensus to BFT state machine replication. We also discuss how to make simple modifications to leader-driven consensus algorithms in order to make them compatible with our transformation.
Keywords
finite state machines; BFT state machine replication; Byzantine consensus; latency-optimal transformation; leader-driven consensus primitive; Computational modeling; Cryptography; Digital signatures; Lead; Protocols; Reliability; Synchronization; Byzantine fault tolerance; consensus; modularization; state machine replication;
fLanguage
English
Publisher
ieee
Conference_Titel
Dependable Computing Conference (EDCC), 2012 Ninth European
Conference_Location
Sibiu
Print_ISBN
978-1-4673-0938-7
Type
conf
DOI
10.1109/EDCC.2012.32
Filename
6214759
Link To Document