志愿云环境下的拜占庭容错研究
发布时间：2019-03-05 07:48
【摘要】：志愿云环境下的节点具有动态性高、可靠度低的特点,系统容易出现拜占庭错误。拜占庭一致性算法可使系统在出现f个恶意节点时保证一致性,但现有算法冗余度较高。针对该问题,提出一种基于Gossip协议的拜占庭容错算法,使系统冗余度降低到2f+1。该算法无需设计主节点,所有计算节点处于对等地位,可避免主从模式冗余系统发生单点故障。理论分析和实验结果表明,所提算法能达到拜占庭容错要求,有效减小系统冗余度,与BFTCloud和Zyzzyva算法相比,提升了系统吞吐量。
[Abstract]:The nodes in volunteer cloud environment have the characteristics of high dynamic and low reliability, and the system is prone to Byzantine errors. Byzantine consistency algorithm can ensure consistency in the presence of f malicious nodes, but the existing algorithms are highly redundant. In order to solve this problem, a Byzantine fault tolerant algorithm based on Gossip protocol is proposed to reduce the redundancy of the system to 2F1. The algorithm does not need to design master nodes and all computing nodes are in a peer-to-peer position to avoid a single point of failure in redundant systems in master-slave mode. The theoretical analysis and experimental results show that the proposed algorithm can meet the requirements of Byzantine fault tolerance and effectively reduce the redundancy of the system. Compared with the BFTCloud and Zyzzyva algorithms, the proposed algorithm improves the throughput of the system.
【作者单位】： 湖南大学信息科学与工程学院;
【基金】：国家自然科学基金资助项目“面向云存储的多元数据安全查询机制和算法研究”(61472125)
【分类号】：TP393.09
本文编号：2434682
[Abstract]:The nodes in volunteer cloud environment have the characteristics of high dynamic and low reliability, and the system is prone to Byzantine errors. Byzantine consistency algorithm can ensure consistency in the presence of f malicious nodes, but the existing algorithms are highly redundant. In order to solve this problem, a Byzantine fault tolerant algorithm based on Gossip protocol is proposed to reduce the redundancy of the system to 2F1. The algorithm does not need to design master nodes and all computing nodes are in a peer-to-peer position to avoid a single point of failure in redundant systems in master-slave mode. The theoretical analysis and experimental results show that the proposed algorithm can meet the requirements of Byzantine fault tolerance and effectively reduce the redundancy of the system. Compared with the BFTCloud and Zyzzyva algorithms, the proposed algorithm improves the throughput of the system.
【作者单位】： 湖南大学信息科学与工程学院;
【基金】：国家自然科学基金资助项目“面向云存储的多元数据安全查询机制和算法研究”(61472125)
【分类号】：TP393.09
【相似文献】
相关期刊论文 前3条
1 余丽静;;网络异常情况下的拜占庭容错算法研究[J];计算机光盘软件与应用;2013年15期
2 王静宇;王秀苹;张晓琳;;云计算下基于拜占庭算法的容忍入侵技术研究[J];内蒙古科技大学学报;2012年04期
3 ;[J];;年期
相关博士学位论文 前1条
1 王秀群;可实用的拜占庭容错系统理论研究[D];浙江大学;2007年
相关硕士学位论文 前3条
1 俞启梁;基于节点行为分析的安全分布式目标定位方法[D];浙江大学;2016年
2 孙冠男;基于本体的拜占庭攻击建模及检测的研究[D];兰州理工大学;2011年
3 张冰涛;基于CBC的抗拜占庭攻击安全网络编码模型研究与设计[D];兰州理工大学;2011年
，本文编号：2434682
本文链接：https://www.wllwen.com/guanlilunwen/ydhl/2434682.html
