Regenerating Codes for Errors and Erasures in Distributed Storage
arXiv:1202.1050
Abstract
Regenerating codes are a class of codes proposed for providing reliability of data and efficient repair of failed nodes in distributed storage systems. In this paper, we address the fundamental problem of handling errors and erasures during the data-reconstruction and node-repair operations. We provide explicit regenerating codes that are resilient to errors and erasures, and show that these codes are optimal with respect to storage and bandwidth requirements. As a special case, we also establish the capacity of a class of distributed storage systems in the presence of malicious adversaries. While our code constructions are based on previously constructed Product-Matrix codes, we also provide necessary and sufficient conditions for introducing resilience in any regenerating code.
ISIT 2012
Cited by in corpus (13)
- Bandwidth Adaptive & Error Resilient MBR Exact Repair Regenerating Codes
- Erasure Coding for Distributed Storage: An Overview
- Secure Cooperative Regenerating Codes for Distributed Storage Systems
- Improved Upper Bounds on Systematic-Length for Linear Minimum Storage Regenerating Codes
- Repair for Distributed Storage Systems with Erasure Channels
- When Do Redundant Requests Reduce Latency ?
- Update-Efficient Error-Correcting Product-Matrix Codes
- Update-Efficient Regenerating Codes with Minimum Per-Node Storage
- Error-Correcting Regenerating and Locally Repairable Codes via Rank-Metric Codes
- Beyond the MDS Bound in Distributed Cloud Storage
- Variable Packet-Error Coding
- Optimal Construction of Regenerating Code through Rate-matching in Hostile Networks
- Capacity of Wireless Distributed Storage Systems with Broadcast Repair