On locality in distributed storage systems

This paper studies the design of codes for distributed storage systems (DSS) that enable local repair in the event of node failure. This paper presents locally repairable codes based on low degree multivariate polynomials. Its code construction mechanism extends work on Noisy Interpolating Set by Dvir et al. [1]. The paper presents two classes of codes that allow node repair to be performed by contacting 2 and 3 surviving nodes respectively. It further shows that both classes are good in terms of their rate and minimum distance, and allow their rate to be bartered for greater flexibility in the repair process.

[1]  Jean-Marie Goethals,et al.  On Generalized Reed-Muller Codes and Their Relatives , 1970, Inf. Control..

[2]  Minghua Chen,et al.  Pyramid Codes: Flexible Schemes to Trade Space for Access Efficiency in Reliable Data Storage Systems , 2007, Sixth IEEE International Symposium on Network Computing and Applications (NCA 2007).

[3]  Zeev Dvir,et al.  Noisy Interpolating Sets for Low Degree Polynomials , 2008, 2008 23rd Annual IEEE Conference on Computational Complexity.

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

[5]  Frédérique E. Oggier,et al.  Homomorphic Self-repairing Codes for Agile Maintenance of Distributed Storage Systems , 2011, ArXiv.

[6]  Frédérique E. Oggier,et al.  Self-Repairing Codes for distributed storage — A projective geometric construction , 2011, 2011 IEEE Information Theory Workshop.

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

[8]  Sergey Yekhanin,et al.  Locally Decodable Codes: A Brief Survey , 2011, IWCC.

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

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