Code constructions for multi-node exact repair in distributed storage

We study the problem of centralized exact repair of multiple failures in distributed storage. We present constructions that achieve a new set of interior points under exact repair. The constructions build upon the layered code construction by Tian et al., designed for exact repair of single failure. We firstly improve upon the layered construction for general system parameters. Then, we extend the improved construction to support the repair of multiple failures, with varying number of helpers. In particular, for some parameters, we prove the optimality of one point in terms of the storage size and the repair bandwidth for multiple erasures. Finally, considering minimum bandwidth cooperative repair (MBCR) codes as centralized repair codes, we determine explicitly the best achievable region obtained by space-sharing among all known points, including the MBCR point.

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

[2]  A. Robert Calderbank,et al.  New codes and inner bounds for exact repair in distributed storage systems , 2014, 2014 IEEE International Symposium on Information Theory.

[3]  Mehran Elyasi,et al.  Determinant Coding: A Novel Framework for Exact-Repair Regenerating Codes , 2016, IEEE Transactions on Information Theory.

[4]  C. Colbourn,et al.  The CRC handbook of combinatorial designs , edited by Charles J. Colbourn and Jeffrey H. Dinitz. Pp. 784. $89.95. 1996. ISBN 0-8493-8948-8 (CRC). , 1997, The Mathematical Gazette.

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

[6]  Zhiying Wang,et al.  Centralized multi-node repair for minimum storage regenerating codes , 2017, 2017 IEEE International Symposium on Information Theory (ISIT).

[7]  Alexander Barg,et al.  Optimal MDS codes for cooperative repair , 2018, ArXiv.

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

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

[10]  Sriram Vishwanath,et al.  Centralized Repair of Multiple Node Failures With Applications to Communication Efficient Secret Sharing , 2016, IEEE Transactions on Information Theory.

[11]  Kannan Ramchandran,et al.  Asymptotic Interference Alignment for Optimal Repair of MDS Codes in Distributed Storage , 2013, IEEE Transactions on Information Theory.

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

[13]  Kannan Ramchandran,et al.  Distributed Storage Codes With Repair-by-Transfer and Nonachievability of Interior Points on the Storage-Bandwidth Tradeoff , 2010, IEEE Transactions on Information Theory.

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

[15]  Peter Keevash.  The existence of designs , 2014, 1401.3665.

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

[17]  Mehran Elyasi,et al.  A probabilistic approach towards exact-repair regeneration codes , 2015, 2015 53rd Annual Allerton Conference on Communication, Control, and Computing (Allerton).

[18]  Kannan Ramchandran,et al.  Interference Alignment in Regenerating Codes for Distributed Storage: Necessity and Code Constructions , 2010, IEEE Transactions on Information Theory.

[19]  Alexander Barg,et al.  Explicit Constructions of High-Rate MDS Array Codes With Optimal Repair Bandwidth , 2016, IEEE Transactions on Information Theory.

[20]  Zhiying Wang,et al.  Centralized Multi-Node Repair Regenerating Codes , 2017, IEEE Transactions on Information Theory.

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

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

[23]  Chao Tian,et al.  Layered Exact-Repair Regenerating Codes via Embedded Error Correction and Block Designs , 2014, IEEE Transactions on Information Theory.

[24]  Zhifang Zhang,et al.  Exact cooperative regenerating codes with minimum-repair-bandwidth for distributed storage , 2013, 2013 Proceedings IEEE INFOCOM.

[25]  Jehoshua Bruck,et al.  EVENODD: An Efficient Scheme for Tolerating Double Disk Failures in RAID Architectures , 1995, IEEE Trans. Computers.

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

[27]  Balaji Srinivasan Babu,et al.  Explicit MSR Codes with Optimal Access, Optimal Sub-Packetization and Small Field Size for $d=k+1, k+2, k+3$ , 2018, 2018 IEEE International Symposium on Information Theory (ISIT).

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

[29]  Chao Tian.  A Note on the Rate Region of Exact-Repair Regenerating Codes , 2015, ArXiv.

[30]  Sriram Vishwanath,et al.  Progress on high-rate MSR codes: Enabling arbitrary number of helper nodes , 2016, 2016 Information Theory and Applications Workshop (ITA).

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

[32]  Arman Fazeli,et al.  Minimum storage regenerating codes for all parameters , 2016, 2016 IEEE International Symposium on Information Theory (ISIT).

[33]  Baochun Li,et al.  Cooperative repair with minimum-storage regenerating codes for distributed storage , 2014, IEEE INFOCOM 2014 - IEEE Conference on Computer Communications.

[34]  Zhiying Wang,et al.  Centralized multi-node repair in distributed storage , 2016, 2016 54th Annual Allerton Conference on Communication, Control, and Computing (Allerton).

[35]  Kannan Ramchandran,et al.  Exact-Repair MDS Code Construction Using Interference Alignment , 2011, IEEE Transactions on Information Theory.

[36]  Jehoshua Bruck,et al.  Optimal Rebuilding of Multiple Erasures in MDS Codes , 2016, IEEE Transactions on Information Theory.

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

[38]  Iwan M. Duursma.  Outer bounds for exact repair codes , 2014, ArXiv.