摘要
针对纠删编码和门限方案在分布式存储中的应用,提出门限Byzantine quorum系统(TBQS)的概念.该系统与数据分离算法相结合,可以构造可靠性较强的存储系统,当故障服务器个数不超过服务器总数的1/4时,利用TBQS设计存储策略可以实现容错和无间断服务.讨论了TBQS的存在性,构造了两类TBQS并对其效率进行分析,在此基础上设计了基于TBQS的分布式读写协议.
Distributed storage use erasure coding and threshold scheme to provide security and reliability. We present thresh- old 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.
出处
《电子学报》
EI
CAS
CSCD
北大核心
2008年第2期314-319,共6页
Acta Electronica Sinica
基金
国家863高技术研究发展计划基金(No.2007AA01Z429,2007AA01Z405)
国家自然基金重点项目(No.60633020)
国家自然科学基金(No.60573036,60503012)