基于信誉度的PBFT共识算法的研究  

Research on PBFT Consensus Algorithm based on Credibility

作　　者：曲继鹏 庞慧[1,2] QU Jipeng;PANG Hui(Hebei University of Architecture,Zhangjiakou,Hebei 075000;Zhangjiakou Big Data Technology Innovation Center,Zhangjiakou,Hebei 075000)

机构地区：[1]河北建筑工程学院,河北张家口075000 [2]张家口市大数据技术创新中心,河北张家口075000

出　　处：《河北建筑工程学院学报》2023年第4期224-232,共9页Journal of Hebei Institute of Architecture and Civil Engineering

基　　金：2023年度河北省高校基本科研业务费项目(XY2023022)。

摘　　要：区块链作为去中心化的分布式系统,受制于共识机制的影响,所以共识算法的研究对区块链发展起到决定性作用。针对实用拜占庭容错算法(PBFT,Practical Byzantine Fault Tolerance)中的拜占庭节点担任主节点、系统通信量大、时延较长等问题,提出基于信誉度的PBFT改进方案(CPBFT,Credit Practical Byzantine Fault Tolerance)。对节点加入信誉度属性,根据节点在共识中的表现累积节点信誉度。按照节点信誉度值的高低,将节点划分进Good、Normal、Prepare三个小组,主节点从Good组随机选取。同时,优化一致性协议。经过仿真实验,CPBFT相较于PBFT时延显著降低,相同节点数量下吞吐量增加,节点增加时吞吐量下降更缓慢。Blockchain is decentralized distributed system,which is subject to consensus mechanism,so the research of consensus algorithm plays a decisive role in blockchain development.In this paper,a credibility-based PBFT improvement scheme(CPBFT,Credit Practical Byzantine Fault Tolerance)is proposed aiming at the problems of Byzantine nodes acting as master nodes,high system communication volume and long time delay in Practical Byzantine Fault Tolerance algorithm(PBFT).The node reputation attribute is added to the node and the node reputation is accumulated according to the performance of the node in consensus.The nodes are divided into Good,Normal,and Prepare groups according to their reputation values,and the master nodes are randomly selected from the Good group.Meanwhile,the consistency protocol is optimized.After simulation experiments,CPBFT significantly reduces the latency compared to PBFT,the throughput increases with the same number of nodes,and the throughput decreases more slowly when the number of nodes increases.

关 键 词：区块链 CPBFT算法 信誉度 

分 类 号：TP311[自动化与计算机技术—计算机软件与理论]