Erasure Coding for Distributed Storage: An Overview
arXiv:1806.04437
Abstract
In a distributed storage system, code symbols are dispersed across space in nodes or storage units as opposed to time. In settings such as that of a large data center, an important consideration is the efficient repair of a failed node. Efficient repair calls for erasure codes that in the face of node failure, are efficient in terms of minimizing the amount of repair data transferred over the network, the amount of data accessed at a helper node as well as the number of helper nodes contacted. Coding theory has evolved to handle these challenges by introducing two new classes of erasure codes, namely regenerating codes and locally recoverable codes as well as by coming up with novel ways to repair the ubiquitous Reed-Solomon code. This survey provides an overview of the efforts in this direction that have taken place over the past decade.
arXiv commentThis survey article will appear in Science China Information Sciences (SCIS) journal
References in corpus (34)
- A family of optimal locally recoverable codes
- Distributed Storage Codes with Repair-by-Transfer and Non-achievability of Interior Points on the Storage-Bandwidth Tradeoff
- Interference Alignment in Regenerating Codes for Distributed Storage: Necessity and Code Constructions
- Repair Locality with Multiple Erasure Tolerance
- A Solution to the Network Challenges of Data Recovery in Erasure-coded Distributed Storage Systems: A Study on the Facebook Warehouse Cluster
- Binary Cyclic Codes that are Locally Repairable
- Characterizing the Rate Region of the (4,3,3) Exact-Repair Regenerating Codes
- Repairing Multiple Failures with Coordinated and Adaptive Regenerating Codes
- 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
- Cyclic LRC Codes, binary LRC codes, and upper bounds on the distance of cyclic codes
- Optimal Locally Repairable Codes via Rank-Metric Codes
- Outer bounds for exact repair codes
- Locally Repairable Codes with Functional Repair and Multiple Erasure Tolerance
- On Codes for Optimal Rebuilding Access
- Codes with Locality for Two Erasures
- General Sub-packetized Access-Optimal Regenerating Codes
- On Minimizing Data-read and Download for Storage-Node Recovery
- Regenerating Codes for Errors and Erasures in Distributed Storage
- Optimal LRC codes for all lenghts n <= q
- Repair Duality with Locally Repairable and Locally Regenerating Codes
- Optimal Binary Locally Repairable Codes via Anticodes
- The existence of fractional repetition codes
- Security Concerns in Minimum Storage Cooperative Regenerating Codes
- Optimal binary linear locally repairable codes with disjoint repair groups
- A High-Rate MSR Code With Polynomial Sub-Packetization Level
- Optimal locally repairable codes via elliptic curves
- Weight Enumerators and Higher Support Weights of Maximally Recoverable Codes
- Codes With Hierarchical Locality
- On minimum distance of locally repairable codes
- Optimal Repair Schemes for Some Families of Full-Length Reed-Solomon Codes
- Exact Scalar Minimum Storage Coordinated Regenerating Codes
- On Optimal Ternary Locally Repairable Codes
- Capacity bounds for distributed storage