Optimal Locally Repairable Codes and Connections to Matroid Theory

Petabyte-scale distributed storage systems are currently transitioning to erasure codes to achieve higher storage efficiency. Classical codes, such as Reed–Solomon (RS), are highly sub-optimal for distributed environments due to their high overhead during single-failure events. Locally repairable codes (LRCs) form a new family of codes that are repair efficient. In particular, LRCs minimize the number of nodes participating in single node repairs. Fundamental bounds and methods for explicitly constructing LRCs suitable for deployment in distributed storage clusters are not fully understood and currently form an active area of research. In this paper, we present an explicit LRC that is simple to construct and is optimal for a specific set of coding parameters. Our construction is based on grouping RS symbols and then adding extra simple parities that allow for small repair locality. For the analysis of the optimality of the code, we derive a new result on the matroid represented by the code’s generator matrix.

[1]  Thomas Britz,et al.  Extensions of the Critical Theorem , 2005, Discret. Math..

[2]  Camilla Hollanti,et al.  On the Combinatorics of Locally Repairable Codes via Matroid Theory , 2014, IEEE Transactions on Information Theory.

[3]  Gregory W. Wornell,et al.  Update-Efficiency and Local Repairability Limits for Capacity Approaching Codes , 2013, IEEE Journal on Selected Areas in Communications.

[4]  B. Sundar Rajan,et al.  A Matroidal Framework for Network-Error Correcting Codes , 2015, IEEE Transactions on Information Theory.

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

[6]  Navin Kashyap.  Matroid Pathwidth and Code Trellis Complexity , 2008, SIAM J. Discret. Math..

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

[8]  Cheng Huang,et al.  Explicit Maximally Recoverable Codes With Locality , 2013, IEEE Transactions on Information Theory.

[9]  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.

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

[11]  Cheng Huang,et al.  Optimal Repair of MDS Codes in Distributed Storage via Subspace Interference Alignment , 2011, ArXiv.

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

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

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

[15]  Dimitris S. Papailiopoulos,et al.  XORing Elephants: Novel Erasure Codes for Big Data , 2013, Proc. VLDB Endow..

[16]  Richard M. Wilson,et al.  A course in combinatorics , 1992 .

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

[18]  Luis Alfonso Lastras-Montaño,et al.  Reliable Memories with Subline Accesses , 2007, 2007 IEEE International Symposium on Information Theory.

[19]  An Braeken,et al.  Error-Set Codes and Related Objects , 2005, COCOON.

[20]  Satoru Fujishige,et al.  Polymatroidal Dependence Structure of a Set of Random Variables , 1978, Inf. Control..

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

[22]  G. R. Pellikaan,et al.  Codes, arrangements and matroids , 2013 .

[23]  Navin Kashyap,et al.  A Decomposition Theory for Binary Linear Codes , 2006, IEEE Transactions on Information Theory.

[24]  Randall Dougherty,et al.  Networks, Matroids, and Non-Shannon Information Inequalities , 2007, IEEE Transactions on Information Theory.

[25]  C. Greene.  Weight Enumeration and the Geometry of Linear Codes , 1976 .

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

[27]  Thomas Britz,et al.  Higher support matroids , 2007, Discret. Math..

[28]  Sriram Vishwanath,et al.  Error resilience in distributed storage via rank-metric codes , 2012, 2012 50th Annual Allerton Conference on Communication, Control, and Computing (Allerton).

[29]  Cheng Huang,et al.  Erasure Coding in Windows Azure Storage , 2012, USENIX Annual Technical Conference.

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

[31]  Yunnan Wu,et al.  Network coding for distributed storage systems , 2010, IEEE Trans. Inf. Theory.

[32]  Alexander Barg,et al.  The Matroid of Supports of A Linear Code , 1997, Applicable Algebra in Engineering, Communication and Computing.

[33]  Keisuke Shiromoto,et al.  A MacWilliams type identity for matroids , 2008, Discret. Math..

[34]  Kannan Ramchandran,et al.  Exact-Repair MDS Code Construction Using Interference Alignment , 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.

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

[37]  Camilla Hollanti,et al.  Almost affine locally repairable codes and matroid theory , 2014, 2014 IEEE Information Theory Workshop (ITW 2014).

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

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

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