Netinfo Security ›› 2022, Vol. 22 ›› Issue (4): 86-92.doi: 10.3969/j.issn.1671-1122.2022.04.010

Previous Articles     Next Articles

A Credit-Based Byzantine Fault Tolerance Consensus Algorithm

HUANG Baohua1(), QU Xi1, ZHENG Huiying1, XIONG Tinggang2   

  1. 1. School of Computer and Electronic Information, Guangxi University, Nanning 530004, China
    2. The 709th Research Institute of China Shipbuilding Industry Corporation, Wuhan 430205, China
  • Received:2022-02-22 Online:2022-04-10 Published:2022-05-12
  • Contact: HUANG Baohua E-mail:bhhuang66@gxu.edu.cn

Abstract:

Consensus algorithm PBFT is widely used in alliance chains, but it has problems such as high latency, low throughput, and poor scalability. In response to these problems, this paper proposes a credit-based Byzantine fault tolerant consensus algorithm(CBFT). First, a set of candidate nodes is added to ensure that consensus nodes can dynamically join and exit. Second, a credit evaluation scheme is introduced. The credit values are calculated based on the completion of the consensus process of the consensus node, and are used to evaluate the credit of the node. Finally, a node replacement scheme is designed. When the credit value of a consensus node is lower than the threshold, this node will be replaced with a candidate node to reduce the participation rate of low credit values in the consensus process. As shown in the simulation experiment, the CBFT algorithm has lower consensus time delay and higher throughput and algorithm efficiency than the PBFT algorithm.

Key words: consensus algorithm, fault tolerance, Byzantine, credit values

CLC Number: