A piggybacking design framework for read-and download-efficient distributed storage codes
Authors:
- 1 July 2013
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- No. 21578095,p. 331-335
Abstract
We present a new piggybacking framework for designing distributed storage codes that are efficient in the amount of data read and downloaded during node-repair. We illustrate the power of this framework by constructing explicit codes that attain the smallest amount of data to be read and downloaded for repair among all existing solutions for three important settings: (a) codes meeting the constraints of being maximum distance separable (MDS), high-rate, and having a small number of substripes, (b) binary MDS codes for all parameters where binary MDS codes exist, and (c) MDS codes with the smallest repair-locality. In addition, we show how to use this framework to enable efficient repair of parity nodes in existing codes that are constructed to address the repair of only the systematic nodes. The basic idea behind this framework is to take multiple stripes of existing codes and add carefully designed functions of the data of one stripe to other stripes. Typical savings in the amount of data read and downloaded during repair are 25% to 50% depending on the choice of the system parameters.Keywords
All Related Versions
This publication has 12 references indexed in Scilit:
- A piggybacking design framework for read-and download-efficient distributed storage codes2013
- Repair Optimal Erasure Codes Through Hadamard DesignsIEEE Transactions on Information Theory, 2013
- On the Locality of Codeword SymbolsIEEE Transactions on Information Theory, 2012
- Long MDS codes for optimal repair bandwidth2012
- Locally repairable codes2012
- Polynomial length MDS codes with optimal repair in distributed storage2011
- Optimal Exact-Regenerating Codes for Distributed Storage at the MSR and MBR Points via a Product-Matrix ConstructionIEEE Transactions on Information Theory, 2011
- Network Coding for Distributed Storage SystemsIEEE Transactions on Information Theory, 2010
- Optimal recovery of single disk failure in RDP code storage systems2010
- Explicit codes minimizing repair bandwidth for distributed storage2010