RG-BFT:基于随机分组的拜占庭容错算法  

RG-BFT:Random grouping based Byzantine fault-tolerant algorithm

作　　者：宋宇哲 郑广海[1] 张鑫 SONG Yu-zhe;ZHENG Guang-hai;ZHANG Xin(College of Software,Dalian Jiaotong University,Dalian 116028,China;Cloud Network Product Management Department,China Mobile(Suzhou)Software Technology Limited Company,Suzhou 215000,China)

机构地区：[1]大连交通大学软件学院,辽宁大连116028 [2]中移(苏州)软件技术有限公司云网产品管理部,江苏苏州215000

出　　处：《计算机工程与设计》2024年第6期1661-1667,共7页Computer Engineering and Design

基　　金：辽宁省教育厅服务地方基金项目(JDL2020004)。

摘　　要：随着网络环境的复杂性和网络用户数量的不断增长,区块链的发展逐渐受到共识算法的效率、安全性和可靠性的制约。针对此类问题,提出一种基于随机分组的拜占庭容错算法(random grouping-based Byzantine fault tolerant algorithm, RG-BFT),提高共识算法的效率和可靠性。使用随机选择算法与投票机制相配合,减少共识过程中的节点数量和消息数。此方案具有随机性和公正性,在保证系统活性的前提下,提高了达成共识的效率。实验结果表明,RG-BFT算法能实现较低的共识时延和通信开销及高交易吞吐量。With the complexity of the network environment and the growing number of network users,the development of blockchain is gradually constrained by the efficiency,security and reliability of the consensus algorithm.To address such problems,a random grouping-based Byzantine fault tolerant algorithm(RG-BFT)was proposed to improve the efficiency and reliability of the consensus algorithm.A random selection algorithm in conjunction with a voting mechanism was used to effectively reduce the number of nodes and messages in the consensus process.This scheme is random and fair,and improves the efficiency of reaching consensus while ensuring system activity.Experimental results show that the RG-BFT algorithm achieves both low consensus latency and communication overhead,as well as fairly high transaction throughput.

关 键 词：区块链 共识算法 拜占庭容错算法 投票机制 随机性 公正性 高效率 

分 类 号：TP311.5[自动化与计算机技术—计算机软件与理论]