信息网络安全 ›› 2022, Vol. 22 ›› Issue (4): 86-92.doi: 10.3969/j.issn.1671-1122.2022.04.010

• 理论研究 • 上一篇    下一篇

一种基于信用的拜占庭容错共识算法

黄保华1(), 屈锡1, 郑慧颖1, 熊庭刚2   

  1. 1.广西大学计算机与电子信息学院,南宁 530004
    2.中国船舶重工集团公司第七○九研究所,武汉 430205
  • 收稿日期:2022-02-22 出版日期:2022-04-10 发布日期:2022-05-12
  • 通讯作者: 黄保华 E-mail:bhhuang66@gxu.edu.cn
  • 作者简介:黄保华(1973—),男,贵州,副教授,博士,主要研究方向为信息安全|屈锡(1997—),男,湖北,硕士研究生,主要研究方向为信息安全|郑慧颖(1996—),女,广西,硕士研究生,主要研究方向为信息安全|熊庭刚(1963—),男,湖北,研究员,硕士,主要研究方向为计算机体系结构
  • 基金资助:
    国家自然科学基金(61962005);国家重点研发计划(2018YFB1404404);广西高校中青年教师科研基础能力提升项目(2021KY1934)

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

摘要:

实用性拜占庭容错共识算法(PBFT)在联盟链中应用广泛,但存在时延高、吞吐量低和可扩展性差等问题。针对这些问题,文章提出一种基于信用的拜占庭容错共识算法(CBFT)。首先,增设候补节点集合,实现共识节点的动态加入和退出;其次,引入信用评估方案,根据共识节点在共识过程中的完成情况计算其信誉值,用信誉值评估节点的信用;最后,设计节点替换方案,当某个共识节点的信誉值低于设置的阈值时,用候补节点替换此节点,减少低信誉节点的共识参与率。仿真实验结果表明,与PBFT算法相比,CBFT算法共识时延更低,吞吐量和算法效率更高。

关键词: 共识算法, 容错, 拜占庭, 信誉值

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

中图分类号: