• 中国计算机学会会刊
  • 中国科技核心期刊
  • 中文核心期刊

Computer Engineering & Science ›› 2022, Vol. 44 ›› Issue (02): 237-243.

Previous Articles     Next Articles

A practical Byzantine fault tolerant consensus algorithm based on role management

LI Teng,CHENG Zhe,JIA Dong-li,JIA Yao-qing   

  1. (School of Information & Electrical Engineering,Hebei University of Engineering,Handan 056038,China)
  • Received:2020-10-10 Revised:2020-11-24 Accepted:2022-02-25 Online:2022-02-25 Published:2022-02-17

Abstract: In view of the problem that the existing practical Byzantine Fault Tolerance (PBFT) consensus algorithm applied to the alliance chain has poor scalability, high energy consumption, low efficiency, and random selection of master nodes, a practical Byzantine Fault Tolerant (RPBFT) consensus algorithm based on role management is proposed. Firstly, the nodes in the system are divided into three types of role nodes with different responsibilities: managers, candidates and ordinary nodes. Secondly, the candidate node has the right to vote, and the corresponding candidate node is elected as the manager by voting. Ordinary nodes can be transformed into candidate nodes after meeting the conditions. Finally, the conversion between different types of role nodes is managed by the reward mechanism. Different role nodes can be dynamically adjusted when the total number of network nodes changes, so that the algorithm can adapt to the dynamic network. The experimental results show that the RPBFT algorithm has high reliability, low latency, low energy consumption and good scalability.


Key words: blockchain, Byzantine fault tolerance, role management, consensus algorithm, data block