A Scalable Byzantine Fault Tolerance Algorithm Based on a Tree Topology Network

【Author】 Jiang, Wangxi; Wu, Xiaoxiong; Song, Mingyang; Qin, Jiwei; Jia, Zhenhong

【Source】IEEE ACCESS

【影响因子】3.476

【Abstract】The consortium chain is the main form of application of blockchain technology in the actual industry, and its consensus mechanism mostly adopts the practical Byzantine fault tolerance (PBFT) algorithm. The traditional PBFT algorithm is only suitable for small-scale local area networks, but in large-scale wide area network environments, its scalability bottleneck has a serious impact on the performance of the system. Therefore, in this paper, a scalable Byzantine fault tolerance algorithm based on a tree topology network is proposed (STBFT), which can take different steps to reach consensus according to the abnormal situation of the system. First, the STBFT algorithm divides the consensus nodes into different layers and groups based on the tree topology network structure, which transforms from global consensus to local consensus and drastically reduces communication consumption. Then, the division method of the group is based on a verifiable random function (VRF), with the purpose of preventing targeted attacks and colluding Byzantine nodes from affecting the normal consensus of the system. Finally, a feedback mechanism is proposed for the first time to reduce the influence of Byzantine failure on hierarchical network systems. The simulation results show that the proposed algorithm reduces the communication complexity and improves the fault tolerance of the system, and the scalability of the tree topology network structure can be better applied in large-scale scenarios such as IoT and health care.

【Keywords】Heuristic algorithms; Fault tolerant systems; Communications systems; Security; Scalability; Peer-to-peer computing; Consensus algorithm; Topology; Tree topology network; PBFT; scalability; communication complexity; high fault tolerance

【发表时间】2023

【收录时间】2023-05-13

【文献类型】理论模型

【主题类别】

区块链技术-核心技术-共识机制