An Improved Practical Byzantine Fault-Tolerant Algorithm Based on XGBoost Grouping for Consortium Chains

作     者：Xiaowei Wang Haiyang Zhang Jiasheng Zhang Yingkai Ge Kexin Cui Zifu Peng Zhengyi Li Lihua Wang 

作者机构：College of Electronic and Information EngineeringShandong University of Science and TechnologyQingdao266590China 

出 版 物：《Computers, Materials & Continua》 (计算机、材料和连续体（英文）)

年 卷 期：2025年第82卷第1期

页      面：1295-1311页

核心收录：

学科分类：12[管理学] 1201[管理学-管理科学与工程(可授管理学、工学学位)] 081104[工学-模式识别与智能系统] 08[工学] 0835[工学-软件工程] 0811[工学-控制科学与工程] 0812[工学-计算机科学与技术（可授工学、理学学位）] 

基　　金：We express our gratitude to the participants who generously dedicated their time and effort to contribute to our study. We would like to acknowledge the editor and the anonymous reviewers whose insightful comments and suggestions significantly enhanced the quality of this manuscript 

主　　题：Consortium chain PBFT grouping reputation XGBoost 

摘      要：In response to the challenges presented by the unreliable identity of the master node,high communication overhead,and limited network support size within the Practical Byzantine Fault-Tolerant(PBFT)algorithm for consortium chains,we propose an improved PBFT algorithm based on XGBoost grouping called XG-PBFT in this ***-PBFT constructs a dataset by training important parameters that affect node performance,which are used as classification indexes for *** XGBoost algorithm then is employed to train the dataset,and nodes joining the system will be grouped according to the trained grouping *** them,the nodes with higher parameter indexes will be assigned to the consensus group to participate in the consensus,and the rest of the nodes will be assigned to the general group to receive the consensus *** order to reduce the resource waste of the system,XG-PBFT optimizes the consensus protocol for the problem of high complexity of PBFT ***,we evaluate the performance of *** experimental results show that XG-PBFT can significantly improve the performance of throughput,consensus delay and communication complexity compared to the original PBFT algorithm,and the performance enhancement is significant compared to other algorithms in the case of a larger number of *** results demonstrate that the XG-PBFT algorithm is more suitable for large-scale consortium chains.