基于树形拓扑网络的实用拜占庭容错共识算法

A Practical Byzantine Fault Tolerance Consensus Algorithm Based on Tree Topological Network

实用拜占庭容错算法在节点数量较多的广域网环境下存在性能瓶颈.为提高该算法的可扩展性,基于树形拓扑网络将全网范围共识拆分为若干子网范围共识;同时引入信誉模型以降低错误节点在共识过程中的影响力,提高系统的安全性、容错性与可靠性.实验结果表明:所提算法的性能明显优于原有算法,表现出良好的可扩展性,可用于大规模许可链系统.

The practical Byzantine fault tolerance(PBFT) algorithm suffers its performance bottleneck in wide-area networks with a large number of nodes. In order to improve the scalability of the algorithm, we propose to divide the whole network consensus into several subnetwork consensus based on tree topology network. At the same time, a reputation model is introduced to reduce the influence of fault nodes in the consensus process and improve the security, fault tolerance and reliability of the system. Experimental results show that the performance of the proposed algorithm is significantly improved comparing with the original one, showing good scalability and applicability to large-scale permissioned blockchain system.