Liu Shannan, Zhang Ronghua, Liu Changzheng, Xu Chenxi, Wang Jiaojiao
College of Information Science and Technology, Shihezi University, Shihezi, 832000, Xinjiang, China.
School of Economics and Management, Qilu Normal University, Jinan, 250200, Shandong, China.
Sci Rep. 2023 Aug 10;13(1):13030. doi: 10.1038/s41598-023-28856-x.
To improve the blockchain consensus algorithm practical Byzantine fault tolerance (PBFT) with random master node selection, which has high communication overhead and a small supported network size, this paper proposes a Byzantine fault tolerant consensus algorithm based on credit (CBFT) enhanced with a grouping and credit model. The CBFT algorithm divides the network nodes according to the speed of their response to the management nodes, resulting in different consensus sets, and achieves consensus within and outside the group separately to reduce communication overhead and increase system security. Second, the nodes are divided into different types according to the credit model, each with different responsibilities to reduce the probability that the master node is a malicious node. Experimental results show that the throughput of the CBFT algorithm is 3.1 times that of PBFT and 1.5 times that of GPBFT when the number of nodes is 52. Our scheme has latency that is 7.4% that of PBFT and 38.8% that of GPBFT; CBFT has communication overhead that is 6.4% that of PBFT and 87.3% that of GPBFT. The number of nodes is 300, and the Byzantine fault tolerance is improved by 59.3%. These improvements are clearer with the increase in the number of nodes.
为了改进具有高通信开销和小支持网络规模的、采用随机主节点选择的区块链共识算法实用拜占庭容错（PBFT），本文提出了一种基于信用的拜占庭容错共识算法（CBFT），并通过分组和信用模型对其进行增强。CBFT算法根据网络节点对管理节点响应的速度对节点进行划分，从而产生不同的共识集，并分别在组内和组外达成共识，以减少通信开销并提高系统安全性。其次，根据信用模型将节点分为不同类型，每个类型具有不同职责，以降低主节点是恶意节点的概率。实验结果表明，当节点数量为52时，CBFT算法的吞吐量是PBFT的3.1倍，是GPBFT的1.5倍。我们的方案的延迟是PBFT的7.4%，是GPBFT的38.8%；CBFT的通信开销是PBFT的6.4%，是GPBFT的87.3%。节点数量为300时，拜占庭容错能力提高了59.3%。随着节点数量的增加，这些改进更加明显。
