Replication based storage systems with local repair
Authors:
- 1 June 2013
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- No. 23749660,p. 1-6
Abstract
We consider the design of regenerating codes for distributed storage systems that enjoy the property of local, exact and uncoded repair, i.e., (a) upon failure, a node can be regenerated by simply downloading packets from the surviving nodes and (b) the number of surviving nodes contacted is strictly smaller than the number of nodes that need to be contacted for reconstructing the stored file. Our codes consist of an outer MDS code and an inner fractional repetition code that specifies the placement of the encoded symbols on the storage nodes. For our class of codes, we identify the tradeoff between the local repair property and the minimum distance. We present codes based on graphs of high girth, affine resolvable designs and projective planes that meet the minimum distance bound for specific choices of file sizes.Keywords
All Related Versions
This publication has 14 references indexed in Scilit:
- Repairable replication-based storage systems using resolvable designs2012
- Locally repairable codes2012
- Scalable constructions of fractional repetition codes in distributed storage systems2011
- Self-repairing homomorphic codes for distributed storage systems2011
- A Survey on Network Codes for Distributed StorageProceedings of the IEEE, 2011
- Extremal Combinatorics2011
- Network Coding for Distributed Storage SystemsIEEE Transactions on Information Theory, 2010
- Explicit construction of optimal exact regenerating codes for distributed storage2009
- Explicit construction of graphs with an arbitrary large girth and of large sizeDiscrete Applied Mathematics, 1995
- Regular Graphs with Given Girth and Restricted CircuitsJournal of the London Mathematical Society, 1963