期刊文献+

基于网络编码的多媒体云存储系统单节点修复算法

Research on single node repair algorithm for multimedia cloud storage system based on network coding
下载PDF
导出
摘要 针对现有多媒体云存储系统单节点修复算法中,有限域大,编解码复杂度高,磁盘I/O开销大,存储开销与修复带宽开销不均衡等问题,基于网络编码提出一种多媒体云存储系统单节点修复算法.该算法将系统中节点已分组的多媒体文件数据进行分组存储,并将组内数据在GF(2)有限域上进行异或编码,当部分节点失效时,新生节点只要连接同组中2~3个未失效节点即可精确修复失效节点中的数据.理论分析与仿真实验结果表明:该算法可减小编解码与修复的复杂度,降低磁盘I/O开销;在相同条件下,该算法存储开销与基于最小存储再生码(minimum storage regeneration codes,MSR)算法的存储开销一致,而修复带宽开销与最小带宽再生码(minimum bandwidth regeneration codes,MBR)算法接近. Concerning that the existing single node repair algorithm for multimedia cloud storage system has problems such as big finite field,high coding and decoding complexity,high cost of disk I/O,unbalance of storage cost and repair bandwidth cost,this paper proposes a single node repair algorithm for multimedia cloud storage system based on network coding.The algorithm groups the nodes in the system,and the multimedia file data are stored in packet storage.The data in groups are coded in GF(2)finite field with XOR.Therefore,when a node fails,connect only 2 or 3 nodes in the same group,the data in failure node can be precisely repaired.Theoretical analysis and simulation results show that the algorithm in this paper can reduce coding and decoding complexity and repair complexity as well as the cost of disk I/O.Under the same conditions,this algorithm has the same storage cost with the algorithm based on MSR,and has a lower repair bandwidth cost,which is close to the repair bandwidth of the algorithm based on MBR.
作者 夏兰 肖嵩 庄园 XIA Lan;XIAO Song;ZHUANG Yuan(State Key Laboratory of Integrated Services Networks,Xidian University,Xi'an 710071,China)
出处 《扬州大学学报(自然科学版)》 CAS 北大核心 2018年第3期15-19,共5页 Journal of Yangzhou University:Natural Science Edition
基金 国家自然科学基金资助项目(61372069) 高等学校学科创新引智计划(111计划)资助项目(B08038)
关键词 网络编码 再生码 异或编码 多媒体 云存储 节点修复 network coding regeneration code XOR coding multimedia cloud storage node repair
  • 相关文献

参考文献2

二级参考文献26

  • 1Dimakis A G, Godfrey P G, Wu Y, et al. Network coding for distributed storage systems[J]. IEEE Trans on Information Theory, 2010, 56(9): 4539-4551.
  • 2Rashmi K, Shah N B, Kumar P V. Optimal exact regenerating codes for distributed storage at the MSR and MBR points via a product-matrix construction [J]. IEEE Trans on Information Theory, 2011, 57(8): 5227-5239.
  • 3Ahlswede R, Cai N, Li S Y R, et al. Network information flow [J]. IEEE Trans on Information Theory, 2000, 46(4) : 1204-1216.
  • 4Dimakis A G, Ramchandran K, Wu Y, e.t al. A survey on network codes for distributed: storage [J]. Proceeding of the IEEE, 2011, 99(3): 476-489.
  • 5Duminuco A, Biersack E. A practical study of regenerating codes for peer-to-peer backup systems [C] //Proc of IEEE ICDCS'09. Piscataway, NJ: IEEE, 2009:376-384.
  • 6Ho T, Koetter R, Medard M, et al. The benefits of coding over routing in a randomized setting [C] //Proc of IEEE ISIT'03. Piscataway, NJ: IEEE, 2003:442.
  • 7Hu Y, Yu C M, Li Y K, et al. Nefs: On the practicality and extensibility of a network-coding based distributed file system [C]//Proc of IEEE NetCod'11. Piscataway, NJ: IEEE, 2011, 1-6.
  • 8Hu Y, Chen C H, Lee P C, et al. Nccloud:Applying network coding for the storage repair in a cloud of-clouds [C] //Proc of the 10th USENIX Conf on File and Storage Technologies. Berkeley, CA: USENIX Association, 2012: 21-28.
  • 9Arnoult E. Study of the feasibility of a distributed storage system based on a minimum bandwidth exact regenerating code [EB/OL]. London:Imperial college London, 2011. [2011-09-01]. http://csi, use. edu/-dimakis/StorageWiki/ lib/exe/fetch. php? media = wiki: papers: study _ of_ the _ feasibility_of_a_distributed_storage_system_based_on_a_minimum_bandwidth_exact_regenerating_code. pdf.
  • 10Angelo M. Cpu usage limiter for linux [EB/OL]. (2006 08- 09)[2012 05-23]. http://cpulimit. sourceforge. net/.

共引文献2

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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