TY - JOUR
T1 - HML-BFT
T2 - Hybrid multi-layer BFT consensus with reputation model for large-scale blockchain
AU - Chen, Wei
AU - Li, Xiangyang
AU - Wang, Gaoli
AU - Li, Leibo
AU - Shen, Jiachen
AU - Li, Entang
N1 - Publisher Copyright:
© The Author(s), under exclusive licence to Springer Science+Business Media, LLC, part of Springer Nature 2024.
PY - 2025/2
Y1 - 2025/2
N2 - Practical Byzantine Fault Tolerance (PBFT) is the most widely used consensus mechanism in current consortiums and private blockchains. Nevertheless, the poor node scalability of PBFT seriously affects the performance of blockchain. To address this problem, we propose a reputation-based hybrid multi-layer consensus protocol (HML-BFT) by combining two strategies: committee election and hierarchical consensus. In the strategy of committee election, we only make a subset of nodes participate in the consensus, while non-committee members observe the results of the consensus. Besides, we select the consensus committee based on the reputation value of nodes, which can reduce the number of nodes to participate in the consensus, thereby reducing communication complexity. In the strategy of hierarchical consensus, we organize the nodes into different layers, and nodes in different layers perform different consensus processes, thereby improving consensus efficiency. Experimental results show that our protocol greatly reduces the communication complexity of PBFT and enhances its scalability. Through the comparative analysis of experimental data, we find HML-BFT outperforms many algorithms proposed to improve the scalability of PBFT in recent years.
AB - Practical Byzantine Fault Tolerance (PBFT) is the most widely used consensus mechanism in current consortiums and private blockchains. Nevertheless, the poor node scalability of PBFT seriously affects the performance of blockchain. To address this problem, we propose a reputation-based hybrid multi-layer consensus protocol (HML-BFT) by combining two strategies: committee election and hierarchical consensus. In the strategy of committee election, we only make a subset of nodes participate in the consensus, while non-committee members observe the results of the consensus. Besides, we select the consensus committee based on the reputation value of nodes, which can reduce the number of nodes to participate in the consensus, thereby reducing communication complexity. In the strategy of hierarchical consensus, we organize the nodes into different layers, and nodes in different layers perform different consensus processes, thereby improving consensus efficiency. Experimental results show that our protocol greatly reduces the communication complexity of PBFT and enhances its scalability. Through the comparative analysis of experimental data, we find HML-BFT outperforms many algorithms proposed to improve the scalability of PBFT in recent years.
KW - Blockchain
KW - Byzantine Fault Tolerance (BFT)
KW - Consensus committee
KW - Hierarchical consensus
KW - Scalability
UR - https://www.scopus.com/pages/publications/85212946283
U2 - 10.1007/s12083-024-01888-4
DO - 10.1007/s12083-024-01888-4
M3 - 文章
AN - SCOPUS:85212946283
SN - 1936-6442
VL - 18
SP - 1
EP - 14
JO - Peer-to-Peer Networking and Applications
JF - Peer-to-Peer Networking and Applications
IS - 1
ER -