GVGBC:全视图情形下基于Gossip协议的拜占庭共识算法  

GVGBC: a Byzantine consensus algorithm in global view based on Gossip protocol

作　　者：李青鹏 赵相福 陈中育 郑忠龙 LI Qingpeng;ZHAO Xiangfu;CHEN Zhongyu;ZHENG Zhonglong(College of Mathematics and Computer Science,Zhejiang Normal University,Jinhua 321004,China)

机构地区：[1]浙江师范大学数学与计算机科学学院

出　　处：《浙江师范大学学报（自然科学版）》2020年第1期50-55,共6页Journal of Zhejiang Normal University:Natural Sciences

基　　金：国家自然科学基金资助项目(61972360);浙江省自然科学基金资助项目(LY16F020004)

摘　　要：共识算法是区块链技术的一个核心组成部分,但现有的共识算法还存在某些不足.针对基于Gossip协议的拜占庭共识算法(GBC算法)的局限性,提出了一种基于全视图通信情形下的GBC算法——GVGBC算法.通过改进通信方式、数据结构和内部算法,使系统快速实现分布式节点间的数据更新和共识达成.通过实例依次证明了GVGBC算法的3个优点:节点间通信的轮数降为一轮;单节点对错误信息不会多次叠加;减少了系统承担的数据量.总之,在通信可靠的情况下,GVGBC算法减少了节点数据更新所需要的通信轮数,减少了系统承担的数据量,从而提高了算法的性能.The consensus algorithm was a core component of blockchain technology,but some consensus algorithms still had some shortcomings to be improved.Aiming at removing the limitation of the Byzantine consensus algorithm based on Gossip protocol(GBC algorithm),it was proposed a GBC algorithm based on global-view communication,namely GVGBC algorithm.By improving communication methods,data structures,and internal algorithms,the system could efficiently implement data update and achieve the consensus among distributed nodes.Three advantages of the GVGBC algorithm was proved by a typical example:the number of rounds of communication between nodes was reduced to one;the single node did not superimpose the error information multiple times;and the amount of data required by the system was reduced as well.In summary,based on reliable communication,the GVGBC algorithm could reduce the number of communication rounds required for node data update,and the amount of data the system needed for consensus,thereby the performance was improved.

关 键 词：GOSSIP协议 拜占庭错误 GBC算法 GVGBC算法 

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