“From Byzantine Consensus to BFT State Machine Replication: A Latency-Optimal Transformation”
From Navigators
(Difference between revisions)
(Created page with "{{Publication |type=inproceedings |document=Document for Publication-joaosousa2011.pdf |title=From Byzantine Consensus to BFT State Machine Replication: A Latency-Optimal Transfo...") |
|||
| (One intermediate revision not shown) | |||
| Line 4: | Line 4: | ||
|title=From Byzantine Consensus to BFT State Machine Replication: A Latency-Optimal Transformation | |title=From Byzantine Consensus to BFT State Machine Replication: A Latency-Optimal Transformation | ||
|author=João Sousa, Alysson Bessani | |author=João Sousa, Alysson Bessani | ||
| - | |Project=Project:TCLOUDS, | + | |Project=Project:TCLOUDS, |
|ResearchLine=Fault and Intrusion Tolerance in Open Distributed Systems (FIT) | |ResearchLine=Fault and Intrusion Tolerance in Open Distributed Systems (FIT) | ||
|month=may | |month=may | ||
| Line 10: | Line 10: | ||
|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. | |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. | ||
|address=Sibiu, Romenia | |address=Sibiu, Romenia | ||
| + | |booktitle=Ninth European Dependable Computing Conference (EDCC 2012) | ||
|pages=12 | |pages=12 | ||
}} | }} | ||
Latest revision as of 10:49, 21 January 2013
in Ninth European Dependable Computing Conference (EDCC 2012), Sibiu, Romenia, May 2012, pp. 12.
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.
Download paper
Download From Byzantine Consensus to BFT State Machine Replication: A Latency-Optimal Transformation
Export citation
Project(s): Project:TCLOUDS
Research line(s): Fault and Intrusion Tolerance in Open Distributed Systems (FIT)
