Interference Alignment in Regenerating Codes for Distributed Storage: Necessity and Code Constructions
arXiv:1005.1634 · doi:10.1109/TIT.2011.2178588
Abstract
Regenerating codes are a class of recently developed codes for distributed storage that, like Reed-Solomon codes, permit data recovery from any arbitrary k of n nodes. However regenerating codes possess in addition, the ability to repair a failed node by connecting to any arbitrary d nodes and downloading an amount of data that is typically far less than the size of the data file. This amount of download is termed the repair bandwidth. Minimum storage regenerating (MSR) codes are a subclass of regenerating codes that require the least amount of network storage; every such code is a maximum distance separable (MDS) code. Further, when a replacement node stores data identical to that in the failed node, the repair is termed as exact. The four principal results of the paper are (a) the explicit construction of a class of MDS codes for d = n-1 >= 2k-1 termed the MISER code, that achieves the cut-set bound on the repair bandwidth for the exact-repair of systematic nodes, (b) proof of the necessity of interference alignment in exact-repair MSR codes, (c) a proof showing the impossibility of constructing linear, exact-repair MSR codes for d < 2k-3 in the absence of symbol extension, and (d) the construction, also explicit, of MSR codes for d = k+1. Interference alignment (IA) is a theme that runs throughout the paper: the MISER code is built on the principles of IA and IA is also a crucial component to the non-existence proof for d < 2k-3. To the best of our knowledge, the constructions presented in this paper are the first, explicit constructions of regenerating codes that achieve the cut-set bound.
38 pages, 12 figures, submitted to the IEEE Transactions on Information Theory;v3 - The title has been modified to better reflect the contributions of the submission. The paper is extensively revised with several carefully constructed figures and examples
References in corpus (9)
- Optimal Exact-Regenerating Codes for Distributed Storage at the MSR and MBR Points via a Product-Matrix Construction
- Interference Alignment and the Degrees of Freedom for the K User Interference Channel
- Distributed Storage Codes with Repair-by-Transfer and Non-achievability of Interior Points on the Storage-Bandwidth Tradeoff
- Distributed Data Storage with Minimum Storage Regenerating Codes - Exact and Functional Repair are Asymptotically Equally Efficient
- A Construction of Systematic MDS Codes with Minimum Repair Bandwidth
- Enabling Node Repair in Any Erasure Code for Distributed Storage
- On the Existence of Optimal Exact-Repair MDS Codes for Distributed Storage
- Searching for Minimum Storage Regenerating Codes
- Double Circulant Minimum Storage Regenerating Codes
Cited by in corpus (64)
- Optimal Exact-Regenerating Codes for Distributed Storage at the MSR and MBR Points via a Product-Matrix Construction
- Distributed Storage Codes with Repair-by-Transfer and Non-achievability of Interior Points on the Storage-Bandwidth Tradeoff
- Optimal Locally Repairable and Secure Codes for Distributed Storage Systems
- Characterizing the Rate Region of the (4,3,3) Exact-Repair Regenerating Codes
- XORing Elephants: Novel Erasure Codes for Big Data
- Repairing Reed-Solomon Codes With Multiple Erasures
- Layered, Exact-Repair Regenerating Codes Via Embedded Error Correction and Block Designs
- An Explicit, Coupled-Layer Construction of a High-Rate MSR Code with Low Sub-Packetization Level, Small Field Size and All-Node Repair
- Distributed Storage in Mobile Wireless Networks with Device-to-Device Communication
- Codes with Local Regeneration
- A Framework of Constructions of Minimal Storage Regenerating Codes with the Optimal Access/Update Property
- MDR Codes: A New Class of RAID-6 Codes with Optimal Rebuilding and Encoding
- On Codes for Optimal Rebuilding Access
- Cascade Codes For Distributed Storage Systems
- Distributed Data Storage Systems with Opportunistic Repair
- Regenerating Codes for Errors and Erasures in Distributed Storage
- On Minimizing Data-read and Download for Storage-Node Recovery
- Explicit constructions of optimal-access MDS codes with nearly optimal sub-packetization
- Blind Interference Alignment for Private Information Retrieval
- Access vs. Bandwidth in Codes for Storage
- Multilinear Algebra for Distributed Storage
- Optimal Repair Layering for Erasure-Coded Data Centers: From Theory to Practice
- Security Concerns in Minimum Storage Cooperative Regenerating Codes
- Rate Region of the (4,3,3) Exact-Repair Regenerating Codes
- A High-Rate MSR Code With Polynomial Sub-Packetization Level
- Exact-Repair Regenerating Codes Via Layered Erasure Correction and Block Designs
- Exact Scalar Minimum Storage Coordinated Regenerating Codes
- When and By How Much Can Helper Node Selection Improve Regenerating Codes?
- Generalization of Rashmi-Shah-Kumar Minimum-Storage-Regenerating Codes
- Erasure Coding for Distributed Storage: An Overview
- Analysis and Construction of Functional Regenerating Codes with Uncoded Repair for Distributed Storage Systems
- Quasi-cyclic Flexible Regenerating Codes
- Centralized Multi-Node Repair Regenerating Codes
- Information-theoretically Secure Erasure Codes for Distributed Storage
- Secure Cooperative Regenerating Codes for Distributed Storage Systems
- Explicit MDS Codes for Optimal Repair Bandwidth
- On the Delay-Storage Trade-off in Content Download from Coded Distributed Storage Systems
- Distributed Storage Systems based on Equidistant Subspace Codes
- Storage codes -- coding rate and repair locality
- High-Rate Regenerating Codes Through Layering
- When Can Helper Node Selection Improve Regenerating Codes? Part I: Graph-Based Analysis
- The Storage-Repair-Bandwidth Trade-off of Exact Repair Linear Regenerating Codes for the Case
- CORE: Augmenting Regenerating-Coding-Based Recovery for Single and Concurrent Failures in Distributed Storage Systems
- Computation in Multicast Networks: Function Alignment and Converse Theorems
- Improved Upper Bounds on Systematic-Length for Linear Minimum Storage Regenerating Codes
- On the Achievability Region of Regenerating Codes for Multiple Erasures
- Fractional repetition codes with flexible repair from combinatorial designs
- Optimal Rebuilding of Multiple Erasures in MDS Codes
- Bandwidth Cost of Code Conversions in Distributed Storage: Fundamental Limits and Optimal Constructions
- Exact-Repair Minimum Bandwidth Regenerating Codes Based on Evaluation of Linearized Polynomials
- Update-Efficient Error-Correcting Product-Matrix Codes
- Limitations on the Achievable Repair Bandwidth of Piggybacking Codes with Low Substriping
- Cooperative Repair of Multiple Node Failures in Distributed Storage Systems
- A Novel Construction of Low-Complexity MDS Codes with Optimal Repair Capability for Distributed Storage Systems
- Erasure Codes for Distributed Storage: Tight Bounds and Matching Constructions
- Exact Regenerating Codes for Byzantine Fault Tolerance in Distributed Storage
- Beyond the MDS Bound in Distributed Cloud Storage
- Optimal Construction of Regenerating Code through Rate-matching in Hostile Networks
- Data Secrecy in Distributed Storage Systems under Exact Repair
- Novel Repair-by-Transfer Codes and Systematic Exact-MBR Codes with Lower Complexities and Smaller Field Sizes
- Access-optimal Linear MDS Convertible Codes for All Parameters
- Scalar MSCR Codes via the Product Matrix Construction
- Concurrent Regenerating Codes and Scalable Application in Network Storage
- Convertible Codes: Efficient Conversion of Coded Data in Distributed Storage