首页 | 本学科首页   官方微博 | 高级检索  
     

基于Gossip协议的拜占庭共识算法
引用本文:张仕将,柴晶,陈泽华,贺海武.基于Gossip协议的拜占庭共识算法[J].计算机科学,2018,45(2):20-24.
作者姓名:张仕将  柴晶  陈泽华  贺海武
作者单位:太原理工大学信息工程学院 太原030024,太原理工大学信息工程学院 太原030024,太原理工大学信息工程学院 太原030024,中国科学院计算机网络信息中心 北京100190
基金项目:本文受中科院计算机网络信息中心百人计划项目(1101002001),国家自然科学基金(61402319,61403273),山西省自然科学基金项目(2014021022-4)资助
摘    要:区块链是一种对等网络的分布式账本系统,具备去中心化、不可篡改、安全可信等特点,因此受到了广泛关注。在区块链系统中,典型的拜占庭错误包括操作错误、网络延迟、系统崩溃、恶意攻击等。现有共识算法不仅对区块链中拜占庭节点的容错能力低,而且对区块链系统的可扩展性差。针对这一问题,文中提出了基于Gossip协议的拜占庭共识算法,使系统可以容忍小于一半的节点为拜占庭节点,能够达到XFT共识算法的容错能力。同时,因为采用了统一的数据结构,所以系统具有更好的可扩展性,并且有利于正确节点识别区块链系统中的恶意节点。在该算法中,提案节点随着区块链长度的变化而转移,系统中所有节点都处于对等的地位,从而避免了单点故障问题,进而使得系统具有更好的动态负载均衡的性能。

关 键 词:区块链  拜占庭错误  共识算法  Gossip协议  可扩展性
收稿时间:2017/11/20 0:00:00
修稿时间:2018/1/10 0:00:00

Byzantine Consensus Algorithm Based on Gossip Protocol
ZHANG Shi-jiang,CHAI Jing,CHEN Ze-hua and HE Hai-wu.Byzantine Consensus Algorithm Based on Gossip Protocol[J].Computer Science,2018,45(2):20-24.
Authors:ZHANG Shi-jiang  CHAI Jing  CHEN Ze-hua and HE Hai-wu
Affiliation:Department of Information Engineering,Taiyuan University of Technology,Taiyuan 030024,China,Department of Information Engineering,Taiyuan University of Technology,Taiyuan 030024,China,Department of Information Engineering,Taiyuan University of Technology,Taiyuan 030024,China and Computer Network Information Center,Chinese Academy of Sciences,Beijing 100190,China
Abstract:Blockchain is a kind of distributed ledger system with peer-to-peer network,which has drawn widespread attention because of its characteristics such as decentralization,non-tempering,security and credibility.In a blockchain system,some nodes have the Byzantine errors such as operational errors,network latency,system crashes,malicious attacks,and so on.The existing consensus algorithms are less tolerant to the Byzantine nodes in the blockchain,and the scalability of the blockchain system is poor.In order to solve these problems,this paper proposed a Byzantine consensus algorithm based on Gossip protocol,which allows the system to tolerate less than half of the nodes as the Byzantine node and achieve the fault-tolerant performance of XFT consensus algorithm.This paper proved that the algorithm can reach consensus in a distributed system with Byzantine defects from the agreement,correctness and termination.At the same time,the system adopts the uniform data structure,and thus has better scalability and facilitates the right node to identify the Byzantine nodes in the blockchain system.In this algorithm,the proposed node is shifted with the change of the length of blockchain,so that all nodes in the system are in the same position,thus avoiding the single point of failure problem,and making the system have better dynamic load balancing performance.
Keywords:Blockchain  Byzantine error  Consensus algorithm  Gossip protocol  Scalability
点击此处可从《计算机科学》下载全文
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号