结合动态信用机制的PBFT算法优化方案

实用拜占庭容错（PBFT）共识算法被广泛应用于金融机构、电子货币行业、农产品溯源等领域,但存在灵活性较差、拜占庭节点处理方式不足、通信开销和网络时延较大等问题。提出基于动态机制与信用积分机制的实用拜占庭容错共识算法DT-PBFT。引入动态加入或退出机制,使集群内的节点可以按需自由加入或退出,增加信用积分机制,通过分层机制将节点按可信任程度分为备用主节点层、中间层、警告层和清理层,采用惩罚机制降低节点连续作恶的可能性,以保证从备用主节点层中优先选择最优的主节点,大幅提高共识效率。同时,通过剔除网络清理层中的拜占庭节点,提高算法的运行效率。在此基础上,通过优化一致性协议对共识流程进行改进,减少一轮全网节点信息交互确认流程,从而降低通信开销。实验结果表明,当节点数为22时,相比DGPBFT、DDBFT和PBFT算法,DT-PBFT算法具有较优的灵活性,吞吐量和交易请求有效完成率分别为292 transaction/s和83.4%,CPU利用率为50%,相比PBFT算法,延迟降低了350 ms。

Optimization Scheme of PBFT Algorithm Combining Dynamic Credit Mechanism

Practical Byzantine Fault Tolerance (PBFT) consensus algorithm is widely used in financial institutions, electronic currency industry, agricultural product traceability, and other fields, but there are problems such as poor flexibility, insufficient Byzantine node processing methods, large communication overhead, and network delay.This paper proposes a PBFT consensus algorithm DT-PBFT based on a dynamic mechanism and credit scoring mechanism.The dynamic joining or exit mechanism is introduced to enable nodes in the cluster to joining or exit freely as needed, and the credit scoring mechanism is added.Nodes are divided into standby primary node layer, intermediate layer, warning layer, and cleaning layer according to the degree of trust through the layered mechanism.The penalty mechanism is used to reduce the possibility of the continuous evil of nodes, so as to ensure that the optimal primary node is selected preferentially from the standby primary node layer, and to greatly improve the efficiency of consensus.At the same time, by eliminating Byzantine nodes in the network cleaning layer, the operation efficiency of the algorithm is improved.Based on this, the consensus process is improved through the optimized consistency protocol to reduce a round of network wide node information interaction confirmation process, thereby reducing communication overhead.The experimental results show that when the number of nodes is 22, compared with the DGPBFT, DDBFT and PBFT algorithms, the DT-PBFT algorithm has a better flexibility.The throughput and effective completion rate of transaction requests are 292 transaction/s and 83.4%, respectively, and the CPU utilization is 50%.Compared with the PBFT algorithm, the delay is reduced by 350 ms.