Locally repairable codes based on MSR codes in cloud storage system

被引：0
|
作者：
Wang J. [1 ]
Liang W. [2 ]
Liu X.-Y. [3 ]
Yang Y. [1 ]
机构：
[1] School of Information Engineering, Chang'an University, Xi'an
[2] School of Computer Science and Engineering, Hunan University of Science and Technology, Xiangtan, 411201, Hunan
[3] School of Information Service, Xi'an Communication College, Xi'an
来源：
Beijing Youdian Daxue Xuebao/Journal of Beijing University of Posts and Telecommunications | 2016年 / 39卷 / 04期
关键词：
Distributed cloud storage; Locally repairable codes; Minimum storage regenerating codes;
D O I：
10.13190/j.jbupt.2016.04.012
中图分类号：
学科分类号：
摘要：
In order to improve the reliability of distributed cloud storage system and the efficiency for repairing the failed nodes, a scheme of locally repairable coding based on minimum storage regenerating (MSR) codes was proposed. Specifically, the systematic MSR codes suitable for cloud storage and the locally repairable codes with MSR codes as local codes were constructed respectively to ensure the maximum distance separable (MDS) property and simple repairing characteristics. Performance analysis and simulation show that the locally repairable coding scheme can realize fast repairing of multiple failed nodes in distributed cloud storage system, and has lower repair locality. Compared with three-copy mode and simple regenerating codes, the locally repairable coding scheme has good performances in storage overhead and repair bandwidth overhead. © 2016, Editorial Department of Journal of Beijing University of Posts and Telecommunications. All right reserved.
引用
收藏
页码：60 / 66
页数：6
相关论文
共 8 条
  • [1] Acedanski S., Deb S., Medard M., Et al., How good is random linear coding based distributed networked storage?, Proc of 1stWorkshop on Network Coding, Theory and Applications(NetCod), pp. 1-4, (2005)
  • [2] Dimakis A.G., Godfrey P.B., Wainwright M.J., Et al., Network coding for distributed storage systems, 26th IEEE International Conference on Computer Communications(INFOCOM 2007), pp. 2000-2008, (2007)
  • [3] Papailiopoulos D.S., Dimakis A.G., Locally repairable codes, IEEE Transactions on Information Theory, 60, 10, pp. 5843-5855, (2014)
  • [4] Shahabinejad M., Khabbazian M., Ardakani M., An efficient binary locally repairable code for hadoop distributed file system, IEEE Communications Letters, 18, 8, pp. 1287-1290, (2014)
  • [5] Goparaju S., Calderbank R., Binary cyclic codes that are locally repairable, 2014 IEEE International Symposium on Information Theory(ISIT), pp. 676-680, (2014)
  • [6] Macwilliams F.J., Sloane N.J.A., The Theory of Error Correcting Codes, (1983)
  • [7] Changho S., Kannan R., Exact-repair MDS code construction using interference alignment, IEEE Transactions on Information Theory, 57, 3, pp. 1425-1442, (2011)
  • [8] Ernvall T., Exact-regenerating codes between MBR and MSR points, 2013 IEEE Information Theory Workshop(ITW), pp. 1-5, (2013)
1