期刊文献+

一种基于wirehair码的高可靠分布式存储方案的研究与实现 被引量:1

Research and Implementation of a Highly Reliable Distributed Storage Scheme Based on Wirehair Code
下载PDF
导出
摘要 在分布式存储中,每一个分布式存储节点的数据可用性都是极其重要的。因此,必须加入相应的冗余措施来保障数据的可用性。而传统基于复制的冗余策略会随着数据可用性的提高而极大增加冗余开销。同时,随着分布式存储节点个数的增加,部分节点遭受物理攻击、窃取的可能性也相应增大,极大增加了对于敏感数据的安全威胁。文章在对Raptor码深入研究的基础上, 提出一种基于Raptor码的分布式存储方案。且通过大量实验测试,设计并实现了一种基于wirehair码(RaptorQ的开源实现)的分布式存储系统。该系统不仅能以较小的冗余实现较高的数据可用性,且通过编码过程增加了原始数据的安全性。 In the distributed storage, the data availability of each distributed storage node is very important. Therefore, the corresponding redundance measures must be taken to ensure the data availability. However, the redundance cost of the traditional redundance strategy based on duplication will greatly increase as data availability improves. Meanwhile, with the increasing of the number of distributed storage nodes, the possibility that some nodes suffer physical attack and theft also increases, which greatly increases the security threat to sensitive data. On the basis of deep research on Raptor code, this paper presents a distributed storage scheme based on Raptor code. And through a lot of experimental tests, a distributed storage system based on wirehair code (open source implementation of RaptorQ) is designed and implemented. The system can not only achieve higher data availability with smallerredundance, but also increase the security of the original data through the coding process.
作者 邓凯 田志宏 马丹阳 DENG Kai;TIAN Zhihong;MA Danyang(Institute of Computer Applications, China Academy of Engineering Physics, Mianyang Sichuan 621900, China;Cyberspace Institute of Advanced Technology, Guangzhou University, Guangzhou Guangdong 510006, China)
出处 《信息网络安全》 CSCD 北大核心 2018年第2期20-26,共7页 Netinfo Security
基金 国家自然科学基金[61572153]
关键词 分布式存储 wirehair码 冗余 RAPTOR码 distributed storage wirehair code redundance Raptor code
  • 相关文献

参考文献5

二级参考文献42

  • 1马冠骏,许胤龙,林明宏,宣颖.基于网络编码的P2P内容分发性能分析[J].中国科学技术大学学报,2006,36(11):1237-1240. 被引量:14
  • 2F. Schmuck and R. Haskin. GPFS: A shared-disk file system for large computing clusters. In Proceeding of the 2002 Conference on File and Storage Technologies ( FAST ), pages 231-244. USENIX, Jan 2002.
  • 3S. A. Weil, S. A. Brandt, E. L. Miller, D. D. E. Long, and C. Maltzahn. Ceph: A scalable, high-perfomance distributed file system. In Proceeding of the 7th Symposium on Operating Systems Design and Implementation (OSDI), Sesttle, WA,Nov. 2006. USENIX.
  • 4Lihao Xu, Highly Available Distributed Storage Systems. Phd thesis. 1997.
  • 5Sanjay Ghemawat, Howard Gobioff, Shun-Tak Leung, The Google File System. Google corporation.
  • 6Weatherspoon H Kubiatowicz J. Erasure coding vs. replication: A quantitative comparison[J]. Peer-to-Peer Systems, 2002, 2429: 328-337.
  • 7Bhagwan R, Moore D, Savage S, et al. Replication strategies for highly available peer-to-peer storage[J]. Future directions in distributed computing: research and position papers, 2003, 2584: 153-158.
  • 8Wu Ji-Yi, Zhang Jian-Lin, Wang Tong, et al. Study on Redundant Strategies in Peer to Peer Cloud Storage Systems[J]. Applied Mathematics & Information Sciences, 2011, 5(2): 235-242.
  • 9Ahlswede R, Cai Ning, Li S Y, et al. Network information flow[J]. Information Theory, IEEE Transactions on, 2000, 46(4): 1204-1216.
  • 10Aceda fi ski S, Deb S, M dard M, et al. How good is random linear coding based distributed networked storage[EB/OL], http://www.netcod. org/papers/11AcedanskiDMK-final.pdf, [2005-03- 07] .2012-03-06.

共引文献17

同被引文献4

引证文献1

二级引证文献5

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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