Article

Bosco: One-Step Byzantine Asynchronous Consensus

Authors:

Robbert RenesseAuthors Info & Claims

DISC '08: Proceedings of the 22nd international symposium on Distributed Computing

Pages 438 - 450

https://doi.org/10.1007/978-3-540-87779-0_30

Published: 22 September 2008 Publication History

Abstract

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.

References

[1]

Keidar, I., Rajsbaum, S.: On the cost of fault-tolerant consensus when there are no faults. SIGACT News 32(2), 45-63 (2001).

Digital Library

[2]

Brasileiro, F.V., Greve, F., Mostéfaoui, A., Raynal, M.: Consensus in one communication step. In: Proc. of the 6th International Conference on Parallel Computing Technologies, pp. 42-50. Springer, London (2001).

[3]

Boichat, R., Dutta, P., Frolund, S., Guerraoui, R.: Reconstructing Paxos. ACM SIGACT News 34 (2003).

[4]

Charron-Bost, B., Schiper, A.: The Heard-Of model: Unifying all benign failures. Technical Report LSR-REPORT-2006-004, EPFL (2006).

[5]

Lamport, L.: Lower bounds for asynchronous consensus. Technical Report MSR-TR-2004-72, Microsoft Research (2004).

[6]

Lamport, L.: Fast Paxos. Distributed Computing 19(2), 79-103 (2006).

Digital Library

[7]

Dobre, D., Suri, N.: One-step consensus with zero-degradation. In: DSN 2006: Proceedings of the International Conference on Dependable Systems and Networks, pp. 137-146. IEEE Computer Society, Washington (2006).

Digital Library

[8]

Friedman, R., Mostefaoui, A., Raynal, M.: Simple and efficient oracle-based consensus protocols for asynchronous Byzantine systems. IEEE Transactions on Dependable and Secure Computing 2(1), 46-56 (2005).

Digital Library

[9]

Lamport, L., Shostak, R., Pease, M.: The Byzantine generals problem. ACM Transactions on Programming Languages and Systems 4(3), 382-401 (1982).

Digital Library

[10]

Fischer, M., Lynch, N., Patterson, M.: Impossibility of distributed consensus with one faulty process. J. ACM 32(2), 374-382 (1985).

Digital Library

[11]

Martin, J.P., Alvisi, L.: Fast Byzantine consensus. In: Proceedings of the International Conference on Dependable Systems and Networks, pp. 402-411 (June 2005).

Digital Library

[12]

Ben-Or, M.: Another advantage of free choice: Completely asynchronous agreement protocols. In: Proc. of the 2nd ACMSymp. on Principles of Distributed Computing, Montreal, Quebec, ACM SIGOPS-SIGACT, pp. 27-30 (August 1983).

[13]

Castro, M., Liskov, B.: Practical Byzantine fault tolerance. In: Proc. of the 3rd Symposium on Operating Systems Design and Implementation (OSDI), New Orleans, LA (February 1999).

[14]

Biely, M., Widder, J., Charron-Bost, B., Gaillard, A., Hutle, M., Schiper, A.: Tolerating corrupted communication. In: PODC 2007: Proceedings of the twenty-sixth annual ACM symposium on Principles of Distributed Computing, pp. 244-253. ACM, New York (2007).

Digital Library

[15]

Zielinski, P.: Optimistically terminating consensus: All asynchronous consensus protocols in one framework. In: ISPDC '06: Proceedings of the Proceedings of The Fifth International Symposium on Parallel and Distributed Computing, Washington, DC, pp. 24-33. IEEE Computer Society Press, Los Alamitos (2006).

[16]

Abd-El-Malek, M., Ganger, G.R., Goodson, G.R., Reiter, M.K., Wylie, J.J.: Fault-scalable Byzantine fault-tolerant services. SIGOPS Operating Systems Review 39(5), 59-74 (2005).

Digital Library

[17]

Cowling, J., Myers, D., Liskov, B., Rodrigues, R., Shrira, L.: HQ replication: a hybrid quorum protocol for Byzantine fault tolerance. In: OSDI 2006: Proceedings of the 7th symposium on Operating Systems Design and Implementation, pp. 177- 190. USENIX Association, Berkeley (2006).

Digital Library

[18]

Merideth, M.G., Reiter, M.K.: Probabilistic opaque quorum systems. In: Pelc, A. (ed.) DISC 2007. LNCS, vol. 4731, pp. 403-419. Springer, Heidelberg (2007).

Digital Library

[19]

Malkhi, D., Reiter, M.K., Wool, A., Wright, R.N.: Probabilistic quorum systems. Information and Computation 170(2), 184-206 (2001).

Digital Library

[20]

Hendricks, J., Ganger, G.R., Reiter, M.K.: Low-overhead Byzantine fault-tolerant storage. In: Proc. of twenty-first ACM SIGOPS Symposium on Operating Systems Principles, pp. 73-86. ACM, New York (2007).

Digital Library

[21]

Kotla, R., Alvisi, L., Dahlin, M., Clement, A., Wong, E.: Zyzzyva: speculative Byzantine fault tolerance. In: Proc. of twenty-first ACM SIGOPS symposium on Operating Systems Principles, pp. 45-58. ACM, New York (2007).

Digital Library

[22]

Lamport, L.: The part-time parliament. Trans. on Computer Systems 16(2), 133- 169 (1998).

Digital Library

Cited By

Amiri MAgrawal DEl Abbadi ALoo BBarcelo PSanchez-Pi NMeliou ASudarshan S(2024)Distributed Transaction Processing in Untrusted EnvironmentsCompanion of the 2024 International Conference on Management of Data10.1145/3626246.3654684(570-579)Online publication date: 9-Jun-2024
https://dl.acm.org/doi/10.1145/3626246.3654684
Baumeister TEichler PJacobs SSakr MVölp M(2024)Parameterized Verification of Round-Based Distributed Algorithms via Extended Threshold AutomataFormal Methods10.1007/978-3-031-71162-6_33(638-657)Online publication date: 9-Sep-2024
https://dl.acm.org/doi/10.1007/978-3-031-71162-6_33
Zhai SLi XGe NGrundy J(2023)HOME: Heard-of Based Formal Modeling and Verification Environment for Consensus ProtocolsProceedings of the 45th International Conference on Software Engineering: Companion Proceedings10.1109/ICSE-Companion58688.2023.00016(16-20)Online publication date: 14-May-2023
https://dl.acm.org/doi/10.1109/ICSE-Companion58688.2023.00016
Show More Cited By

Bosco: One-Step Byzantine Asynchronous Consensus

Recommendations

Is bosco's rule universal?
MCU'04: Proceedings of the 4th international conference on Machines, Computations, and Universality

The Game of Life (Life) is a two-state, two-dimensional, nearest neighbor cellular automaton (CA), which John Horton Conway proved is universal. The Larger than Life (LtL) family of CAs generalizes Life to large neighborhoods and general birth and ...
Sampling + DMR: practical and low-overhead permanent fault detection
ISCA '11

With technology scaling, manufacture-time and in-field permanent faults are becoming a fundamental problem. Multi-core architectures with spares can tolerate them by detecting and isolating faulty cores, but the required fault detection coverage becomes ...
Revisiting fault diagnosis agreement in a new territory

In convention, to consensus has been discussed variously. The way of fault masking is commonly used to reach consensus. However, reaching consensus is not enough in a high reliability application. Therefore, in this study, the fault diagnosis agreement ...

Comments

Information & Contributors

Information

Published In

cover image Guide Proceedings

DISC '08: Proceedings of the 22nd international symposium on Distributed Computing

September 2008

519 pages

ISBN:9783540877783

Editor:
Gadi Taubenfeld

Publisher

Springer-Verlag

Berlin, Heidelberg

Publication History

Published: 22 September 2008

Qualifiers

Article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

21
Total Citations
View Citations
0
Total Downloads

Downloads (Last 12 months)0
Downloads (Last 6 weeks)0

Reflects downloads up to 06 Feb 2025

Other Metrics

View Author Metrics

Citations

Cited By

Amiri MAgrawal DEl Abbadi ALoo BBarcelo PSanchez-Pi NMeliou ASudarshan S(2024)Distributed Transaction Processing in Untrusted EnvironmentsCompanion of the 2024 International Conference on Management of Data10.1145/3626246.3654684(570-579)Online publication date: 9-Jun-2024
https://dl.acm.org/doi/10.1145/3626246.3654684
Baumeister TEichler PJacobs SSakr MVölp M(2024)Parameterized Verification of Round-Based Distributed Algorithms via Extended Threshold AutomataFormal Methods10.1007/978-3-031-71162-6_33(638-657)Online publication date: 9-Sep-2024
https://dl.acm.org/doi/10.1007/978-3-031-71162-6_33
Zhai SLi XGe NGrundy J(2023)HOME: Heard-of Based Formal Modeling and Verification Environment for Consensus ProtocolsProceedings of the 45th International Conference on Software Engineering: Companion Proceedings10.1109/ICSE-Companion58688.2023.00016(16-20)Online publication date: 14-May-2023
https://dl.acm.org/doi/10.1109/ICSE-Companion58688.2023.00016
Sliwinski JVonlanthen YWattenhofer R(2022)Consensus on DemandStabilization, Safety, and Security of Distributed Systems10.1007/978-3-031-21017-4_20(299-313)Online publication date: 15-Nov-2022
https://dl.acm.org/doi/10.1007/978-3-031-21017-4_20
Canakci BVan Renesse R(2021)Scaling Membership of Byzantine ConsensusACM Transactions on Computer Systems10.1145/347313838:3-4(1-31)Online publication date: 15-Oct-2021
https://dl.acm.org/doi/10.1145/3473138
Kuznetsov PTonkikh AZhang YMiller ACensor-Hillel K(2021)Revisiting Optimal Resilience of Fast Byzantine ConsensusProceedings of the 2021 ACM Symposium on Principles of Distributed Computing10.1145/3465084.3467924(343-353)Online publication date: 21-Jul-2021
https://dl.acm.org/doi/10.1145/3465084.3467924
Abraham INayak KRen LXiang ZMiller ACensor-Hillel K(2021)Good-case Latency of Byzantine BroadcastProceedings of the 2021 ACM Symposium on Principles of Distributed Computing10.1145/3465084.3467899(331-341)Online publication date: 21-Jul-2021
https://dl.acm.org/doi/10.1145/3465084.3467899
Wang FJi YLiu MLi YLi XZhang XShi XGai KRaymond Choo K(2021)An Optimization Strategy for PBFT Consensus Mechanism Based On Consortium BlockchainProceedings of the 3rd ACM International Symposium on Blockchain and Secure Critical Infrastructure10.1145/3457337.3457843(71-76)Online publication date: 24-May-2021
https://dl.acm.org/doi/10.1145/3457337.3457843
Bertrand NLazić MWidder J(2021)A Reduction Theorem for Randomized Distributed Algorithms Under Weak AdversariesVerification, Model Checking, and Abstract Interpretation10.1007/978-3-030-67067-2_11(219-239)Online publication date: 17-Jan-2021
https://dl.acm.org/doi/10.1007/978-3-030-67067-2_11
Balasubramanian AEsparza JLazić M(2020)Complexity of Verification and Synthesis of Threshold AutomataAutomated Technology for Verification and Analysis10.1007/978-3-030-59152-6_8(144-160)Online publication date: 19-Oct-2020
https://dl.acm.org/doi/10.1007/978-3-030-59152-6_8
Show More Cited By

View Options

View options

Figures

Tables

Media

View Table of Conten