Journal of Applied Sciences ›› 2020, Vol. 38 ›› Issue (1): 34-50.doi: 10.3969/j.issn.0255-8297.2020.01.003

• Blockchain • Previous Articles     Next Articles

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

BAO Zhenshan1, WANG Kaixuan1, ZHANG Wenbo1,2   

  1. 1. Faculty of Information Technology, Beijing University of Technology, Beijing 100124, China;
    2. Beijing Key Laboratory of Trusted Computing, Beijing 100124, China
  • Received:2019-10-31 Online:2020-01-31 Published:2020-01-19

Abstract: 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.

Key words: permissioned blockchain, consensus algorithm, practical Byzantine fault tolerance (PBFT), tree topological network, reputation model

CLC Number: