Reaching Consensus in the Byzantine Empire: A Comprehensive Review of BFT Consensus Algorithms
ACM Computing Surveys · 31.05.2024 · 56 (5) · 1-41
DOI: 10.1145/3636553 ↗Kurz gefasst
Fachartikel in der Zeitschrift ACM Computing Surveys, online erschienen am 12.01.2024. Verfasst von Gengrui Zhang und 7 weiteren Autor:innen. Die Arbeit wurde bisher 114-mal zitiert (Crossref) und nennt 102 Literaturangaben.
Abstract (Originalsprache)
Byzantine fault-tolerant (BFT) consensus algorithms are at the core of providing safety and liveness guarantees for distributed systems that must operate in the presence of arbitrary failures. Recently, numerous new BFT algorithms have been proposed, not least due to the traction blockchain technologies have garnered in the search for consensus solutions that offer high throughput, low latency, and robust system designs. In this article, we conduct a systematic survey of selected and distinguished BFT algorithms that have received extensive attention in academia and industry alike. We perform a qualitative comparison among all algorithms we review considering message and time complexities. Furthermore, we provide a comprehensive, step-by-step description of each surveyed algorithm by decomposing them into constituent subprotocols with intuitive figures to illustrate the message-passing pattern. We also elaborate on the strengths and weaknesses of each algorithm compared to the other state-of-the-art approaches.
Zitieren
APA
Zhang, G., Pan, F., Mao, Y., Tijanic, S., Dang’ana, M., Motepalli, S., Zhang, S., & Jacobsen, H. (2024). Reaching Consensus in the Byzantine Empire: A Comprehensive Review of BFT Consensus Algorithms. ACM Computing Surveys, 56(5), 1-41. https://doi.org/10.1145/3636553
Vancouver
Zhang G, Pan F, Mao Y, Tijanic S, Dang’ana M, Motepalli S, et al. Reaching Consensus in the Byzantine Empire: A Comprehensive Review of BFT Consensus Algorithms. ACM Computing Surveys. 2024;56(5):1-41. doi:10.1145/3636553
BibTeX
@article{Zhang2024,
author = {Zhang, Gengrui and Pan, Fei and Mao, Yunhao and Tijanic, Sofia and Dang’ana, Michael and Motepalli, Shashank and Zhang, Shiquan and Jacobsen, Hans-Arno},
title = {Reaching Consensus in the Byzantine Empire: A Comprehensive Review of BFT Consensus Algorithms},
journal = {ACM Computing Surveys},
year = {2024},
volume = {56},
number = {5},
pages = {1--41},
doi = {10.1145/3636553}
}
EUVIMED