Codes with local regeneration
Authors:
- 1 February 2013
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 1-5
Abstract
Regenerating codes and codes with locality are schemes recently proposed for a distributed storage network. While regenerating codes minimize the data downloaded for node repair, codes with locality minimize the number of nodes accessed during repair. In this paper, we provide some constructions of codes with locality, in which the local codes are regenerating codes, thereby combining the advantages of both classes of codes. The proposed constructions achieve an upper bound on minimum distance and are hence optimal. The constructions include both the cases when the local regenerating codes correspond to the MSR point as well as the MBR point on the storage repair-bandwidth tradeoff curve.Keywords
All Related Versions
This publication has 17 references indexed in Scilit:
- Pyramid CodesACM Transactions on Storage, 2013
- Error resilience in distributed storage via rank-metric codes2012
- Locally repairable codes2012
- Optimal linear codes with a local-error-correction property2012
- Repair optimal erasure codes through hadamard designs2011
- NCFS: On the Practicality and Extensibility of a Network-Coding-Based Distributed File System2011
- Self-repairing homomorphic codes for distributed storage systems2011
- A Practical Study of Regenerating Codes for Peer-to-Peer Backup Systems2009
- Reliable Memories with Subline Accesses2007
- EVENODD: an efficient scheme for tolerating double disk failures in RAID architecturesIEEE Transactions on Computers, 1995