期刊文献+

云存储系统的分区编码冗余方法研究 被引量:2

A Redundancy Method of Partition Coding Applied to Cloud Storage System
下载PDF
导出
摘要 文章根据云存储的结构特点,将数据存储区域划分本地副本区、本地编码区、远端编码区。本地编码区和远端编码区采用确定型网络编码来实现数据的冗余备份。将解码过程的所有系数矩阵进行三角分解并保存为查找表,采用查表方法辅助方程组求解,减少计算量。实验结果表明,当单个存储结点的可用性在0.7至0.99之间、数据可用性目标为99.99999%时,采取数据分片数为8的方案,该方法的平均每字符运算次数低于3次,比副本冗余方法节省50%以上的存储空间.分区编码冗余方法解码速度快,能够显著提高云存储系统的可用性和存储效率. According to the structural characteristics of cloud storage, the data storage area is divided into three parts: local copy zone, local coding zone and remote coding zone, the latter two using a deterministic networkcoding to achieve the purpose of data redundancy. Coefficient matrix of the decoding process triangular decomposition and save the results as a search table that can assist equation solving, thereby reduce the amount of calculation. The experiment results show when the availability of a single storage node in the range of 0.7 to 0.99, data availability target of 99.99999%, taking the data slice number 8, the average operations per character less than 3 times, the method can save more than 50% of storage space than copy redundancy method. The partition coding redundancy method has high decoding speed, improves the availability and storage efficiency of cloud storage system significantly.
出处 《信息网络安全》 2013年第6期2-6,共5页 Netinfo Security
基金 国家自然科学基金[6097013561170282] 韶关市创新资金[2012-10] 韶关学院科研项目[2012-2]
关键词 云存储 冗余 网络编码 每字符运算次数 cloud storage redundancy network coding operations per character
  • 相关文献

参考文献12

  • 1Weatherspoon H Kubiatowicz J. Erasure coding vs. replication: A quantitative comparison[J]. Peer-to-Peer Systems, 2002, 2429: 328-337.
  • 2Bhagwan 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.
  • 3Wu 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.
  • 4Ahlswede R, Cai Ning, Li S Y, et al. Network information flow[J]. Information Theory, IEEE Transactions on, 2000, 46(4): 1204-1216.
  • 5Aceda 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.
  • 6Dimakis A.G, Godfrey P.B, Wu Y, et al. Network coding for distributed storage systems[J]. InformationTheory, IEEE Transactions on, 2010, 56(9): 4539-4551.
  • 7Martal 6 M, Picone M, Amoretti M, et al. Randomized network coding in distributed storage systems withlayered overlay[C]. 2011 Information Theory and Applications Workshop (ITA). San Diego, USA: IEEE,2011,1-7.
  • 8Butty n L, Czap L, Vajda I. Detection and Recovery from Pollution Attacks in Coding-Based Distributed Storage Schemes[J]. Dependable and Secure Computing, IEEE Transactions on, 2011, 8(6): 824-838.
  • 9马冠骏,许胤龙,林明宏,宣颖.基于网络编码的P2P内容分发性能分析[J].中国科学技术大学学报,2006,36(11):1237-1240. 被引量:14
  • 10王宁,林雪红,林家儒.网络编码的分布式存储系统理论分析[J].北京邮电大学学报,2009,32(3):82-85. 被引量:3

二级参考文献15

  • 1Ahlswede R, Cai N, Li S Y R, et al. Network information flow [J ]. IEEE Trans on Information Theory, 2000, 46(4): 1204-1216.
  • 2Dimakis A G, Prabhakaran V. Decentralized erasure codes for distributed networked storage[J]. IEEE Trans on Information Theory, 2006, 52(4) : 2809-2816.
  • 3Rhea S, Eaton P, Kubiatowicz J, et al. Pond: the OceanStore prototype [ C ] // Proceedings of the 2nd USENIX Conference on File and Storage Technologies. San Franisco: ACM Press, 2003: 1-14.
  • 4Acedanski S, Deb S, Medard M, et al. How good is random linear coding based distributed networked storage[C] //Proceedings of First Workshop on Network Coding. [S.l.]: IEEE Press, 2005: 199-125.
  • 5Luby M. LT codes[C]//The 43rd Annual IEEE Symposium on Foundations of Computer Science. Vancouver z IEEE Press, 2002.. 271-280.
  • 6Shokrollah A. Raptor codes[J]. IEEE Trans on Information Theory, 2006, 52(6) : 2551-2567.
  • 7Raab M, Steger A. Balls into Bins--a simple and tight analysis[C]//Proceedings of the 2nd Randomization and Approximation Techniques in Computer Science. London: Springer-Verlag, 1998.. 159-170.
  • 8Bollobas B. Random graphs[M]. Cambridge: Cambridge University Press, 2001: 171-179.
  • 9Cooper C.On the distribution of rank of a random matrix over a finite field[J].Random Struct.Algorithms,2000,17(3-4):197-212.
  • 10Stoica I,Morris R,Karger D,et al.Chord:a scalablepeer-to-peer lookup service for internet applications[C]//ACM SIGCOMM 2001.2001.

共引文献15

同被引文献10

引证文献2

二级引证文献4

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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