志愿云环境下的拜占庭容错研究  

Research on Byzantine Fault Tolerance Under Volunteer Cloud Environment

作　　者：雷长剑 林亚平[1] 李晋国[1] 赵江华[1] 

机构地区：[1]湖南大学信息科学与工程学院,长沙410082

出　　处：《计算机工程》2016年第5期1-7,共7页Computer Engineering

基　　金：国家自然科学基金资助项目"面向云存储的多元数据安全查询机制和算法研究"(61472125)

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

关 键 词：志愿云 云计算 拜占庭错误 一致性 容错 GOSSIP协议 

分 类 号：TP302.8[自动化与计算机技术—计算机系统结构]