【摘要】 针对纠删编码和门限方案在分布式存储中的应用,提出门限Byzantine quorum系统(TBQS)的概念.该系统与数据分离算法相结合,可以构造可靠性较强的存储系统,当故障服务器个数不超过服务器总数的1/4时,利用TBQS设计存储策略可以实现容错和无间断服务.讨论了TBQS的存在性,构造了两类TBQS并对其效率进行分析,在此基础上设计了基于TBQS的分布式读写协议.更多还原

【Abstract】 Distributed storage use erasure coding and threshold scheme to provide security and reliability.We present threshold Byzantine quorum system(TBQS),which can be used to design reliable storage strategy where up to one fourth of the servers might exhibit Byzantine faults.TBQS can provide fault-tolerance and serviced without interruption together with erasure coding or threshold schemes.We discussed the existence of TBQS,and proposed two types of TBQS called threshold f-masking system and grid TBQS respectively.We also yield a read-write protocol base on TBQS that is both time-efficient and reliable.更多还原