摘要
针对区块链共识算法中的PBFT(实用拜占庭容错算法)表现出的大量消息广播造成的通信资源浪费和效率低下问题,该文提出了一种基于最短通信时间分组的GBFT共识算法,GBFT算法的实现主要分为分组和共识两个部分。根据节点间的通信时延进行最优分组。共识阶段,先进行组内共识,然后再进行全局共识,大幅度减少了网络开销。
Aiming at the waste of communication resources and inefficiency caused by PBFT(practical byzantine fault toler⁃ance algorithm)in the blockchain consensus algorithm,this paper proposes a GBFT consensus algorithm based on the shortest com⁃munication time grouping.The implementation of GBFT algorithm is mainly divided into two parts,which are grouping and consen⁃sus.Optimal grouping based on communication delays between nodes.In the consensus phase,the consensus within the group is first implemented,and then the global consensus is reached,which greatly reduces the network overhead.
作者
陈忠贤
李秦伟
罗婧雯
CHEN Zhongxian;LI Qinwei;LUO Jingwen(College of Computer Science and Technology,Guizhou University,Guiyang 550025;Guizhou Provincial Key Laboratory of Public Big Data,Guiyang 550025)
出处
《计算机与数字工程》
2021年第4期711-717,共7页
Computer & Digital Engineering
基金
国家自然科学基金重大研究计划项目(编号:61802081)
贵州省公共大数据重点实验室开放项目(编号:2017BDKFJJ003)资助。
关键词
区块链
实用拜占庭容错
GBFT
节点探测
分组分层
blockchain
practical Byzantine fault tolerance
GBFT
node detection
group layering
