A Framework of Constructions of Minimal Storage Regenerating Codes With the Optimal Access/Update Property

In this paper, we present a generic framework for constructing systematic minimum storage regenerating codes with two parity nodes based on the invariant subspace technique. Codes constructed in our framework not only contain some best known codes as special cases, but also include some new codes with key properties, such as the optimal access property and the optimal update property. In particular, for a given storage capacity of an individual node, one of the new codes has the largest number of systematic nodes and two of the new codes have the largest number of systematic nodes with the optimal update property.

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

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

[3]  Kannan Ramchandran,et al.  Explicit codes minimizing repair bandwidth for distributed storage , 2009, 2010 IEEE Information Theory Workshop on Information Theory (ITW 2010, Cairo).

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

[5]  Alexandros G. Dimakis,et al.  Searching for Minimum Storage Regenerating Codes , 2009, ArXiv.

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

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

[8]  Cheng Huang,et al.  Polynomial length MDS codes with optimal repair in distributed storage , 2011, 2011 Conference Record of the Forty Fifth Asilomar Conference on Signals, Systems and Computers (ASILOMAR).

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

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

[11]  Yunnan Wu,et al.  Reducing repair traffic for erasure coding-based storage via interference alignment , 2009, 2009 IEEE International Symposium on Information Theory.

[12]  Yunnan Wu,et al.  A Survey on Network Codes for Distributed Storage , 2010, Proceedings of the IEEE.

[13]  Ben Y. Zhao,et al.  Maintenance-Free Global Data Storage , 2001, IEEE Internet Comput..

[14]  Stefan Savage,et al.  Total Recall: System Support for Automated Availability Management , 2004, NSDI.

[15]  Syed A. Jafar,et al.  Interference Alignment and the Degrees of Freedom for the 3 User Interference Channel , 2007 .

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

[17]  Robert Tappan Morris,et al.  Designing a DHT for Low Latency and High Throughput , 2004, NSDI.

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

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

[20]  Jehoshua Bruck,et al.  Access Versus Bandwidth in Codes for Storage , 2014, IEEE Transactions on Information Theory.

[21]  Amir K. Khandani,et al.  Communication Over MIMO X Channels: Interference Alignment, Decomposition, and Performance Analysis , 2008, IEEE Transactions on Information Theory.

[22]  Syed Ali Jafar,et al.  Interference Alignment and Degrees of Freedom of the $K$-User Interference Channel , 2008, IEEE Transactions on Information Theory.