Amazing technological breakthrough possible @S-Logix

Office Address

  • #5, First Floor, 4th Street Dr. Subbarayan Nagar Kodambakkam, Chennai-600 024 Landmark : Samiyar Madam
  • +91- 81240 01111

Social List

An Optimized Byzantine Fault Tolerance Algorithm for Consortium Blockchain - 2021

An Optimized Byzantine Fault Tolerance Algorithm For Consortium Blockchain

Research Area:  Blockchain Technology


According to different application scenarios of blockchain system, it is generally divided into public chain, private chain and consortium chain. Consortium chain is a typical multi-center blockchain, because it has better landing, it is supported by more and more enterprises and governments. This paper analyzes the advantages and problems of Practical Byzantine Fault Tolerance (PBFT) algorithm for the application scenarios of the consortium chain. In order to be more suitable for consortium chains, this paper proposes a new optimized consensus algorithm based on PBFT. Aiming at the shortcomings of PBFT, such as the inability to dynamically join nodes, low multi-node consensus efficiency, and primary master node selection, our optimized algorithm has designed a hierarchical structure to increase scalability and improve consensus efficiency. The simulation results show that compared with PBFT and RAFT, our new consensus algorithm increases the data throughput while supporting more nodes, and effectively reducing the consensus delay and the number of communication times between nodes.


Author(s) Name:  Yuxi Li, Liang Qiao & Zhihan Lv

Journal name:  Peer-to-Peer Networking and Applications

Conferrence name:  

Publisher name:  Springer

DOI:  10.1007/s12083-021-01103-8

Volume Information:  volume 14, pages: 2826–2839 (2021)