摘要： 志愿云环境下的节点具有动态性高、可靠度低的特点,系统容易出现拜占庭错误。拜占庭一致性算法可使系统在出现f个恶意节点时保证一致性,但现有算法冗余度较高。针对该问题,提出一种基于Gossip协议的拜占庭容错算法,使系统冗余度降低到2f+1。该算法无需设计主节点,所有计算节点处于对等地位,可避免主从模式冗余系统发生单点故障。理论分析和实验结果表明,所提算法能达到拜占庭容错要求,有效减小系统冗余度,与BFTCloud和Zyzzyva算法相比,提升了系统吞吐量。

关键词: volunteer cloud, cloud computing, Byzantine fault, consistency, fault tolerance, Gossip protocol

Abstract: Since the nodes of the volunteer cloud have the characteristics of high dynamic and low reliability,the volunteer cloud is prone to Byzantine fault.Byzantine consensus algorithm can make the system keep consistent when f malicious nodes are present.However,the existing algorithms have high redundancy degree.Aiming at this problem,this paper proposes a Byzantine fault tolerance algorithm based on Gossip protocol,which reduces the system redundancy degree to 2f+1.It does not need to set the master node and all the computing nodes in system are set to be in peer status,so as to avoid single point failure in master-slave redundancy system.Theoretical analysis and experimental results show that the proposed algorithm can not only satisfy the Byzantine tolerance requirement,but also reduce the system redundancy degree.Compared with BFTCloud and Zyzzyva algorithm,it improves the system throughput.

Key words: volunteer cloud, cloud computing, Byzantine fault, consistency, fault tolerance, Gossip protocol

中图分类号: 

• TP302.8