期刊文献+

分布式存储方案的设计与研究 被引量:19

Design and Research on Distributed Storage Scheme
下载PDF
导出
摘要 针对基于纠删码的分布式存储方法中信息分割算法IDA在运算中涉及构造拆分矩阵,计算开销大,且单纯基于纠删码的方案无法确保所存储数据的完整性、机密性等特性,只能够容忍系统中存在的良性故障,无法容忍入侵者的恶意入侵。提出了分布式系统中一种基于Tornado码的浏览器-服务器工作模式的数据存储方案。在数据写入过程中通过构造编码后数据分块的Hash值级联(即数字指纹),并与每个数据分块一起分布在存储服务器集中的不同服务器中,当需要读出时对分块及数据指纹进行验证,然后利用Tornado译码方法恢复原始文件,即可实现Byzantine环境数据的完整性保护,并提高了系统的容错能力。 In the distributed data storage scheme,in order to solve the problem of large calculating costs brought by the construction and split of matrix invovlved in the IDA algorithm,and a simple program based on erasure codes can not ensure the data integrity,eonfidentiality and other features. Presents a kind of browser- server mode of data storage scheme based on Tornado axle in the distributed system. In the process of data writing, through the construction of the Hash value elass of data piece after coding, namely the numerical fingerprint,along with each data block stored in different servers whieh can be verifieated when it is needed by the Tornado decoding method, thus the integrality of the Byzantine environment data can be fully protected and improve the system's fault tolerance.
出处 《计算机技术与发展》 2010年第4期65-68,共4页 Computer Technology and Development
关键词 存储系统 拜占庭错误 冗余 Tornado码 storage system Byzantine fault redundancy Tornado code
  • 相关文献

参考文献8

二级参考文献125

  • 1刘钢,周敬利,秦磊华,陈小平.纠错码拜占庭容错Quorum中错误检测机制[J].计算机科学,2007,34(5):75-78. 被引量:3
  • 2Kubiatowicz J, Bindel D, Chen Y, Czerwinski S, et al. OceanStore: An Architecture lor Global-scale Persistent Storage[C]. Proc. Conf. Architectural Support for Programming Languages and Operating Systems (ASPLOS-IX), ACM Press, New York, 2000:190 - 201. 被引量:1
  • 3Stoica I, Morris M, Karger D, Kaashoek M F.Chord: A Scalable Peer-to-peer Lookup Service for Intemet Applications[ C]. ACM SIGCOMM 2001,San Deigo, CA, 2001:160 - 177. 被引量:1
  • 4Druschel P, Rowstron A. PAST: A Large-scale,Persistent Peer-to-peer Storage Utility[C]. In: Proc of HotOS Ⅷ, Schloss Elmau, Germany, 2001:75 - 80. 被引量:1
  • 5Cohen E, Shenker S. Replication Strategies in Unstructured Peer-to-peer Networks[C]. In the ACM SIGCOMM'02 Conference, Pittsburgh, USA,August 2002:308 - 321. 被引量:1
  • 6Kangasharju J, Roberts J, Ross K W. Object Replication Strategies in Content DistributionNetworks[C], In Proceedings of WCW'01: Web Caching and Content Distribution Workshop, Boston, USA, June 2001:252 - 201. 被引量:1
  • 7Plaxton C G, Rajaraman R, Richa A W. Accessing Nearby Copies of Replicated Objects in a Distributed Environment[ C]. In Proc. 9th Annual ACM Symposium on Parallel Algorithms and Architectures (SPAA'97), Newport, RI, USA, 1997:311-320. 被引量:1
  • 8Luby M G, Mitzenmacher M, Shokrollahi M A, Spielman D A, Stemna V.Practical Loss-resilient Codes[C]. In Proceedings of the Twenty-ninth Annual ACM Symposium on Theory of Computing, El Paso, Texas, USA, May 1997:150- 159. 被引量:1
  • 9LEWIS C S, SAIA J. Scalable Byzantine agreement [ R ]. New Mexico: University of New Mexico, 2004. 被引量:1
  • 10LAMPORT L, SHOSTAK R, PEASE M. The Byzantine generals problem[ J]. ACM TOPLAS, 1982,4 (3) :382-401. 被引量:1

共引文献103

同被引文献130

引证文献19

二级引证文献91

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部