An Overview of Coding for Distributed Storage Systems

This chapter provides a short survey of coding for distributed storage systems. It describes the code design criteria for such codes, emphasizing what makes them different from traditional codes for communication. It then focuses on two large families of codes, regenerating codes and locally repairable codes, including a discussion on how these codes are used in an adversarial setting.

[1]  Yunghsiang Sam Han,et al.  Exact regenerating codes for Byzantine fault tolerance in distributed storage , 2012, 2012 Proceedings IEEE INFOCOM.

[2]  Frédérique Oggier,et al.  Partially collaborative storage codes in the presence of an eavesdropper , 2016, Int. J. Inf. Coding Theory.

[3]  Sriram Vishwanath,et al.  Update efficient codes for distributed storage , 2011, 2011 IEEE International Symposium on Information Theory Proceedings.

[4]  Alexandros G. Dimakis,et al.  Security in distributed storage systems by communicating a logarithmic number of bits , 2010, 2010 IEEE International Symposium on Information Theory.

[5]  Soheil Mohajer,et al.  New bounds on the (n, k, d) storage systems with exact repair , 2015, 2015 IEEE International Symposium on Information Theory (ISIT).

[6]  Mario Blaum,et al.  Integrated interleaved codes as locally recoverable codes: properties and performance , 2016, Int. J. Inf. Coding Theory.

[7]  Swanand Kadhe,et al.  Codes with unequal locality , 2016, 2016 IEEE International Symposium on Information Theory (ISIT).

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

[9]  P. Vijay Kumar,et al.  Improved layered regenerating codes characterizing the exact-repair storage-repair bandwidth tradeoff for certain parameter sets , 2015, 2015 IEEE Information Theory Workshop (ITW).

[10]  Mingqiang Li,et al.  STAIR Codes: A General Family of Erasure Codes for Tolerating Device and Sector Failures , 2014, TOS.

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

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

[13]  Dimitris S. Papailiopoulos,et al.  Locality and Availability in Distributed Storage , 2016, IEEE Trans. Inf. Theory.

[14]  Sriram Vishwanath,et al.  Error-Correcting Regenerating and Locally Repairable Codes via Rank-Metric Codes , 2015, IEEE Transactions on Information Theory.

[15]  Dah Ming Chiu,et al.  Erasure code replication revisited , 2004 .

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

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

[18]  Kenneth W. Shum,et al.  Exact minimum-repair-bandwidth cooperative regenerating codes for distributed storage systems , 2011, 2011 IEEE International Symposium on Information Theory Proceedings.

[19]  Frédérique E. Oggier,et al.  A study of the performance of novel storage-centric repairable codes , 2015, Computing.

[20]  Kannan Ramchandran,et al.  Securing Dynamic Distributed Storage Systems Against Eavesdropping and Adversarial Attacks , 2010, IEEE Transactions on Information Theory.

[21]  Frédérique E. Oggier,et al.  On storage codes allowing partially collaborative repairs , 2014, 2014 IEEE International Symposium on Information Theory.

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

[23]  Diego Napp Avelli,et al.  Erasure codes with simplex locality , 2014, ArXiv.

[24]  Chao Tian.  Characterizing the Rate Region of the (4,3,3) Exact-Repair Regenerating Codes , 2014, IEEE Journal on Selected Areas in Communications.

[25]  P. Vijay Kumar,et al.  An improved outer bound on the storage-repair-bandwidth tradeoff of exact-repair regenerating codes , 2013, 2014 IEEE International Symposium on Information Theory.

[26]  A. Robert Calderbank,et al.  Cyclic LRC codes, binary LRC codes, and upper bounds on the distance of cyclic codes , 2016, Int. J. Inf. Coding Theory.

[27]  Iwan M. Duursma.  Shortened Regenerating Codes , 2019, IEEE Transactions on Information Theory.

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

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

[30]  Frédérique E. Oggier,et al.  RapidRAID: Pipelined erasure codes for fast data archival in distributed storage systems , 2013, 2013 Proceedings IEEE INFOCOM.

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

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

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

[34]  I. Reed,et al.  Polynomial Codes Over Certain Finite Fields , 1960 .

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

[36]  Eitan Yaakobi,et al.  Bounds and constructions of codes with multiple localities , 2016, 2016 IEEE International Symposium on Information Theory (ISIT).

[37]  Frédérique E. Oggier,et al.  Sparsity exploiting erasure coding for distributed storage of versioned data , 2016, Computing.

[38]  Nihar B. Shah,et al.  Information-Theoretically Secure Regenerating Codes for Distributed Storage , 2011, 2011 IEEE Global Telecommunications Conference - GLOBECOM 2011.

[39]  Frédérique E. Oggier,et al.  Byzantine fault tolerance of regenerating codes , 2011, 2011 IEEE International Conference on Peer-to-Peer Computing.

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

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

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

[43]  Frédérique E. Oggier,et al.  Coding Techniques for Repairability in Networked Distributed Storage Systems , 2013, Found. Trends Commun. Inf. Theory.

[44]  P. Vijay Kumar,et al.  Outer bounds on the storage-repair bandwidth trade-off of exact-repair regenerating codes , 2016, Int. J. Inf. Coding Theory.

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

[46]  Sriram Vishwanath,et al.  Secure Cooperative Regenerating Codes for Distributed Storage Systems , 2012, IEEE Transactions on Information Theory.

[47]  Kannan Ramchandran,et al.  Regenerating codes for errors and erasures in distributed storage , 2012, 2012 IEEE International Symposium on Information Theory Proceedings.