期刊文献+

一类精确修复多个节点的简单再生码

A CLASS OF SIMPLE REGENERATING CODES CAPABLE OF EXACT MULTI-NODE REPAIR
下载PDF
导出
摘要 海量数据环境下要求存储系统具有高扩展性、高可靠性和低成本等特点。大规模存储系统的节点因数目巨大而易频繁失效,为保证节点的可用性,系统会利用冗余数据对失效节点进行修复。作为一种新的容错技术,再生码可有效降低分布式存储系统中失效节点修复时需要的下载数据量。基于简单再生码,为分布式存储系统设计一种新的编码方式。它不仅可容忍多个节点同时出错并进行修复,而且编码形式简单并具有较高的码率。 Massive data environment requires the storage system with the characteristics such as high scalability,high reliability and low price,etc. However,the nodes in large-scale storage system will frequently failure due to too huge in number. In order to ensure the usability of nodes,the system will use redundancy data to repair the failure nodes. As a new fault-tolerant technology,regenerating code can effectively reduce the amount of the download data required when repairing the failure nodes in distributed storage system. In this paper,we design a new encoding mode for distributed storage system based on simple regenerating codes. This mode can not only tolerates the simultaneous errors of multiple nodes and repairs them,but also has simple encoding form and achieves higher code rate.
出处 《计算机应用与软件》 CSCD 2016年第11期11-15,共5页 Computer Applications and Software
基金 国家自然科学基金项目(61325005)
关键词 分布式存储系统 精确修复 多节点修复 简单再生码 Distributed storage system Exact repair Multi-node repair Simple regenerating codes
  • 相关文献

参考文献1

二级参考文献15

  • 1Ghemawat S,Gobioff H,Leung S T.The Google file system[C]//Proceedings of SOSP'03,October 2003.
  • 2Dimakis A,Godfrey P,Wu Y,et al.Network coding for distributed storage systems[J].IEEE Trans.Inform.Theory,2010,56:4539-4551.
  • 3Dimakis A G,Ramchandran K,Wu Y,et al.A survey on network codes for distributed storage[C]//IEEE Proceedings,2011,99:476-489.
  • 4Oggier F,Datta A.Self-repairing homomorphic codes for distributed storage systems[C]//Proc.IEEE Infocom 2011,Shanghai,China,Apr.2011.
  • 5Gopalan P,Huang C,Simitci H,et al.On the locality of codeword elements[OL].Preprint available at http://arxiv.org/abs/1106.3625.
  • 6Papailiopoulos D S,Luo Jianqiang,Dimakis Alexandros G,et al.Simple regenerating codes:network coding for cloud storage[C]//Proc.IEEE Infocom 2011,Miniconference.
  • 7Papailiopoulos D S,Dimakis Alexandros G.Locally repairable codes[C].IEEE International Symposium on Information Theory,2012.
  • 8Khan O,Burns R,Plank J,et al.In search of I/O-optimal recovery from disk failures[C]//Hot Storage 2011,3rd Workshop on Hot Topics in Storage and File Systems,Portland,OR,Jun.,2011.
  • 9Blaum M,Brady J,Bruck J,et al.EVENODD:An Efficient Scheme for Tolerating Double Disk Failures in RAID Architectures[J].IEEE Transactions on Computers,1995,44(2):192-202.
  • 10Xu L,Bruck J.X-code:MDS array codes with optimal encoding[J].IEEE Trans.Inf.Theory,1999,45(1):272-276.

共引文献4

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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