Locally minimum storage regenerating codes in distributed cloud storage systems

In distributed cloud storage systems, inevitably there exist multiple node failures at the same time. The existing methods of regenerating codes, including minimum storage regenerating (MSR) codes and minimum bandwidth regenerating (MBR) codes, are mainly to repair one single or several failed nodes, unable to meet the repair need of distributed cloud storage systems. In this paper, we present locally minimum storage regenerating (LMSR) codes to recover multiple failed nodes at the same time. Specifically, the nodes in distributed cloud storage systems are divided into multiple local groups, and in each local group (4, 2) or (5, 3) MSR codes are constructed. Moreover, the grouping method of storage nodes and the repairing process of failed nodes in local groups are studied. Theoretical analysis shows that LMSR codes can achieve the same storage overhead as MSR codes. Furthermore, we verify by means of simulation that, compared with MSR codes, LMSR codes can reduce the repair bandwidth and disk I/O overhead effectively.

[1]  Nikolaos Doukas,et al.  Effective method to restore data in distributed data storage systems , 2015, MILCOM 2015 - 2015 IEEE Military Communications Conference.

[2]  Shangguang Wang,et al.  Towards Network-Aware Service Composition in the Cloud , 2020, IEEE Transactions on Cloud Computing.

[3]  Dimitris S. Papailiopoulos,et al.  Simple regenerating codes: Network coding for cloud storage , 2011, 2012 Proceedings IEEE INFOCOM.

[4]  Shangguang Wang,et al.  Towards an accurate evaluation of quality of cloud service in service-oriented cloud computing , 2014, J. Intell. Manuf..

[5]  Kenneth W. Shum,et al.  Existence of Minimum-Repair-Bandwidth Cooperative Regenerating Codes , 2011, 2011 International Symposium on Networking Coding.

[6]  Cheng Huang,et al.  On the Locality of Codeword Symbols , 2011, IEEE Transactions on Information Theory.

[7]  Sriram Vishwanath,et al.  Optimal locally repairable codes with local minimum storage regeneration via rank-metric codes , 2013, 2013 Information Theory and Applications Workshop (ITA).

[8]  John Kubiatowicz,et al.  Erasure Coding Vs. Replication: A Quantitative Comparison , 2002, IPTPS.

[9]  Toni Ernvall,et al.  Exact-regenerating codes between MBR and MSR points , 2013, 2013 IEEE Information Theory Workshop (ITW).

[10]  Sriram Vishwanath,et al.  On locality in distributed storage systems , 2012, 2012 IEEE Information Theory Workshop.

[11]  Shahram Babaie,et al.  Fault tolerant mechanism in grid based on Backup Node , 2010, The 2nd International Conference on Information Science and Engineering.

[12]  Sriram Vishwanath,et al.  Optimal locally repairable codes via rank-metric codes , 2013, 2013 IEEE International Symposium on Information Theory.

[13]  Jing Wang,et al.  Network coding based on hyper-edge decomposition for wireless network with link failures , 2015, Int. J. Commun. Syst..

[14]  Kenneth W. Shum.  Cooperative Regenerating Codes for Distributed Storage Systems , 2011, 2011 IEEE International Conference on Communications (ICC).

[15]  Junwei Cao,et al.  NDSS: A Named Data Storage System , 2015, 2015 International Conference on Cloud and Autonomic Computing.

[16]  Dimitris S. Papailiopoulos,et al.  Locally Repairable Codes , 2014, IEEE Trans. Inf. Theory.

[17]  Yinlong Xu,et al.  A deterministic algorithm of single failed node recovery in MSR-based distributed storage systems , 2011, PERV.