Cooperative local repair in distributed storage

Erasure-correcting codes, which support local repair of codeword symbols, have attracted substantial attention recently for their application in distributed storage systems. This paper investigates a generalization of the usual locally repairable codes. In particular, this paper studies a class of codes with the following property: any small set of codeword symbols can be reconstructed (repaired) from a small number of other symbols. This is referred to as cooperative local repair. The main contribution of this paper is bounds on the trade-off of the minimum distance and the dimension of such codes, as well as explicit constructions of families of codes that enable cooperative local repair. Some other results regarding cooperative local repair are also presented, including an analysis for the well-known Hadamard/Simplex codes.

[1]  Arya Mazumdar,et al.  An upper bound on the size of locally recoverable codes , 2013, 2013 International Symposium on Network Coding (NetCod).

[2]  A. Orlitsky,et al.  Stopping sets and the girth of Tanner graphs , 2002, Proceedings IEEE International Symposium on Information Theory,.

[3]  Alexandros G. Dimakis,et al.  Network Coding for Distributed Storage Systems , 2007, IEEE INFOCOM 2007 - 26th IEEE International Conference on Computer Communications.

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

[5]  F. Lazebnik,et al.  A new series of dense graphs of high girth , 1995, math/9501231.

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

[7]  Daniel A. Spielman,et al.  Expander codes , 1994, Proceedings 35th Annual Symposium on Foundations of Computer Science.

[8]  Dimitris S. Papailiopoulos,et al.  Repair Optimal Erasure Codes Through Hadamard Designs , 2011, IEEE Transactions on Information Theory.

[9]  Gregory W. Wornell,et al.  Local recovery properties of capacity achieving codes , 2013, 2013 Information Theory and Applications Workshop (ITA).

[10]  P. Vijay Kumar,et al.  Codes with local regeneration , 2012, 2013 IEEE International Symposium on Information Theory.

[11]  Kenneth W. Shum,et al.  Cooperative Regenerating Codes , 2012, IEEE Transactions on Information Theory.

[12]  Itzhak Tamo,et al.  Bounds on locally recoverable codes with multiple recovering sets , 2014, 2014 IEEE International Symposium on Information Theory.

[13]  Nihar B. Shah,et al.  Optimal Exact-Regenerating Codes for Distributed Storage at the MSR and MBR Points via a Product-Matrix Construction , 2010, IEEE Transactions on Information Theory.

[14]  Dimitris S. Papailiopoulos,et al.  Locality and Availability in Distributed Storage , 2014, IEEE Transactions on Information Theory.

[15]  Irfan Ahmad.  Proceedings of the 3rd USENIX conference on Hot topics in storage and file systems , 2011 .

[16]  P. Vijay Kumar,et al.  Codes with locality for two erasures , 2014, 2014 IEEE International Symposium on Information Theory.

[17]  P. Vijay Kumar,et al.  Codes With Local Regeneration and Erasure Correction , 2014, IEEE Transactions on Information Theory.

[18]  Anne-Marie Kermarrec,et al.  Repairing Multiple Failures with Coordinated and Adaptive Regenerating Codes , 2011, 2011 International Symposium on Networking Coding.

[19]  P. Vijay Kumar,et al.  Optimal linear codes with a local-error-correction property , 2012, 2012 IEEE International Symposium on Information Theory Proceedings.

[20]  Felix Lazebnik,et al.  Explicit Construction of Graphs with an Arbitrary Large Girth and of Large Size , 1995, Discret. Appl. Math..

[21]  Noga Alon,et al.  Explicit construction of linear sized tolerant networks , 1988, Discret. Math..

[22]  Avi Wigderson,et al.  Randomness conductors and constant-degree lossless expanders , 2002, STOC '02.

[23]  Robert Michael Tanner,et al.  A recursive approach to low complexity codes , 1981, IEEE Trans. Inf. Theory.

[24]  Frédérique Oggier,et al.  Self-repairing homomorphic codes for distributed storage systems , 2010, 2011 Proceedings IEEE INFOCOM.

[25]  Frédérique E. Oggier,et al.  Locally repairable codes with multiple repair alternatives , 2013, 2013 IEEE International Symposium on Information Theory.

[26]  Sergey Yekhanin,et al.  On the locality of codeword symbols in non-linear codes , 2013, Discret. Math..

[27]  Cheng Huang,et al.  In Search of I/O-Optimal Recovery from Disk Failures , 2011, HotStorage.

[28]  Zhifang Zhang,et al.  Repair Locality With Multiple Erasure Tolerance , 2014, IEEE Transactions on Information Theory.

[29]  Sergey Yekhanin,et al.  Locally Decodable Codes and Private Information Retrieval Schemes , 2010, Information Security and Cryptography.

[30]  Van-Anh Truong,et al.  Availability in Globally Distributed Storage Systems , 2010, OSDI.

[31]  Sriram Vishwanath,et al.  Optimal Locally Repairable and Secure Codes for Distributed Storage Systems , 2012, IEEE Transactions on Information Theory.

[32]  Dimitris S. Papailiopoulos,et al.  Locally Repairable Codes , 2012, IEEE Transactions on Information Theory.

[33]  Itzhak Tamo,et al.  A Family of Optimal Locally Recoverable Codes , 2013, IEEE Transactions on Information Theory.

[34]  Jehoshua Bruck,et al.  Zigzag Codes: MDS Array Codes With Optimal Rebuilding , 2011, IEEE Transactions on Information Theory.

[35]  Jehoshua Bruck,et al.  MDS array codes with optimal rebuilding , 2011, 2011 IEEE International Symposium on Information Theory Proceedings.