A Systematic Piggybacking Design for Minimum Storage Regenerating Codes

Piggybacking is an efficient method to decrease the repair bandwidth of maximum distance separable codes. In this paper, in order to reduce the repair bandwidth of parity nodes of the known minimum storage regenerating (MSR) codes with high rate, which is usually the whole amount of the original data, i.e., the maximal, a new systematic piggybacking design is proposed through an in-depth analysis of the design of piggybacking. As a result, new MSR codes are obtained with almost optimal repair bandwidth of parity nodes while retaining the optimal repair bandwidth of systematic nodes. Furthermore, MSR codes with balanced download during node repair process are presented based on the new piggybacking design.

[1]  W. Marsden.  I and J , 2012 .

[2]  Jie Li,et al.  A New Repair Strategy for the Hadamard Minimum Storage Regenerating Codes for Distributed Storage Systems , 2015, IEEE Transactions on Information Theory.

[3]  Haim Hanani,et al.  Balanced incomplete block designs and related designs , 1975, Discret. Math..

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

[5]  Kannan Ramchandran,et al.  A Piggybacking Design Framework for Read-and Download-Efficient Distributed Storage Codes , 2017, IEEE Transactions on Information Theory.

[6]  Jie Li,et al.  A Framework of Constructions of Minimum Storage Regenerating Codes with the Optimal Update/Access Property for Distributed Storage Systems Based on Invariant Subspace Technique , 2013, ArXiv.

[7]  Jie Li,et al.  A Framework of Constructions of Minimal Storage Regenerating Codes With the Optimal Access/Update Property , 2013, IEEE Transactions on Information Theory.

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

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

[10]  Jehoshua Bruck,et al.  Long MDS codes for optimal repair bandwidth , 2012, 2012 IEEE International Symposium on Information Theory Proceedings.

[11]  Chao Tian,et al.  Exact-repair regenerating codes via layered erasure correction and block designs , 2013, 2013 IEEE International Symposium on Information Theory.

[12]  Kannan Ramchandran,et al.  A piggybacking design framework for read-and download-efficient distributed storage codes , 2013, ISIT.

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

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

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

[16]  Ben Y. Zhao,et al.  OceanStore: an architecture for global-scale persistent storage , 2000, SIGP.

[17]  P. Vijay Kumar,et al.  High-rate regenerating codes through layering , 2013, 2013 IEEE International Symposium on Information Theory.

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

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

[20]  Jehoshua Bruck,et al.  On codes for optimal rebuilding access , 2011, 2011 49th Annual Allerton Conference on Communication, Control, and Computing (Allerton).

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