An Overview of Codes Tailor-made for Better Repairability in Networked Distributed Storage Systems
arXiv:1109.2317
Abstract
The continuously increasing amount of digital data generated by today's society asks for better storage solutions. This survey looks at a new generation of coding techniques designed specifically for the needs of distributed networked storage systems, trying to reach the best compromise among storage space efficiency, fault tolerance, and maintenance overheads. Four families of codes tailor-made for distributed settings, namely - pyramid, hierarchical, regenerating and self-repairing codes - are presented at a high level, emphasizing the main ideas behind each of these codes, and discussing their pros and cons, before concluding with a quantitative comparison among them. This survey deliberately excluded technical details for the codes, nor does it provide an exhaustive summary of the numerous works. Instead, it provides an overview of the major code families in a manner easily accessible to a broad audience, by presenting the big picture of advances in coding techniques for distributed storage solutions.
References in corpus (8)
- Cooperative Regenerating Codes for Distributed Storage Systems
- Repairing Multiple Failures with Coordinated and Adaptive Regenerating Codes
- MDS Array Codes with Optimal Rebuilding
- Homomorphic Self-repairing Codes for Agile Maintenance of Distributed Storage Systems
- Cost Analysis of Redundancy Schemes for Distributed Storage Systems
- Self-Repairing Codes for Distributed Storage - A Projective Geometric Construction
- Cooperative Regenerating Codes
- An Empirical Study of the Repair Performance of Novel Coding Schemes for Networked Distributed Storage Systems