Performance of PBFT Consensus under Voting by Groups
Blockchains · 2024
DOI: 10.3390/blockchains2020007 ↗Kurz gefasst
Fachartikel in der Zeitschrift Blockchains, 2024. Verfasst von Vojislav B. Mišić und 2 weiteren Autor:innen. Die Arbeit wurde bisher 1-mal zitiert (Crossref) und nennt 34 Literaturangaben. Der Volltext ist frei zugänglich (Open Access, CC BY 4.0). Gefördert von: NSERC Discovery Grants, National Natural Science Foundation of China.
Abstract (Originalsprache)
Practical Byzantine Fault Tolerance (PBFT) is the protocol of choice for many applications that require distributed consensus between a number of participant nodes. While PBFT assumes a single voting committee, many applications recognize different groups of participants that need to reach a consensus separately before accepting a proposal. To this end, we propose to count the votes by separate groups or committees of participating nodes, instead of all together as in the original PBFT. We then investigate the performance impact of this approach on the mean time to accept a data block and the number of nodes involved in making the final decision. Our results indicate that the proposed solutions impose a slight performance penalty which may be countermanded by reducing the quorum numbers needed in different subsets of the original committee.
Förderung
- NSERC Discovery Grants
- National Natural Science Foundation of China
Zitieren
APA
Mišić, V. B., Mišić, J., & Chang, X. (2024). Performance of PBFT Consensus under Voting by Groups. Blockchains. https://doi.org/10.3390/blockchains2020007
Vancouver
Mišić VB, Mišić J, Chang X. Performance of PBFT Consensus under Voting by Groups. Blockchains. 2024. doi:10.3390/blockchains2020007
BibTeX
@article{Mii2024,
author = {Mišić, Vojislav B. and Mišić, Jelena and Chang, Xiaolin},
title = {Performance of PBFT Consensus under Voting by Groups},
journal = {Blockchains},
year = {2024},
doi = {10.3390/blockchains2020007}
}
EUVIMED