Explicit MBR All-Symbol Locality Codes
arXiv:1302.0744
Abstract
Node failures are inevitable in distributed storage systems (DSS). To enable efficient repair when faced with such failures, two main techniques are known: Regenerating codes, i.e., codes that minimize the total repair bandwidth; and codes with locality, which minimize the number of nodes participating in the repair process. This paper focuses on regenerating codes with locality, using pre-coding based on Gabidulin codes, and presents constructions that utilize minimum bandwidth regenerating (MBR) local codes. The constructions achieve maximum resilience (i.e., optimal minimum distance) and have maximum capacity (i.e., maximum rate). Finally, the same pre-coding mechanism can be combined with a subclass of fractional-repetition codes to enable maximum resilience and repair-by-transfer simultaneously.
References in corpus (2)
Cited by in corpus (10)
- Codes with Locality for Two Erasures
- Optimal Binary Locally Repairable Codes via Anticodes
- On Heterogeneous Regenerating Codes and Capacity of Distributed Storage Systems
- Repairable Block Failure Resilient Codes
- When Can Helper Node Selection Improve Regenerating Codes? Part I: Graph-Based Analysis
- Update-Efficiency and Local Repairability Limits for Capacity Approaching Codes
- Fractional repetition codes with flexible repair from combinatorial designs
- Locality and Availability of Array Codes Constructed from Subspaces
- Error-Correcting Regenerating and Locally Repairable Codes via Rank-Metric Codes
- Bounds on Fractional Repetition Codes using Hypergraphs