Rebuilding for array codes in distributed storage systems
- 1 December 2010
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- No. 21660077,p. 1905-1909
Abstract
In distributed storage systems that use coding, the issue of minimizing the communication required to rebuild a storage node after a failure arises. We consider the problem of repairing an erased node in a distributed storage system that uses an EVENODD code. EVENODD codes are maximum distance separable (MDS) array codes that are used to protect against erasures, and only require XOR operations for encoding and decoding. We show that when there are two redundancy nodes, to rebuild one erased systematic node, only 3/4 of the information needs to be transmitted. Interestingly, in many cases, the required disk I/O is also minimized.Keywords
All Related Versions
This publication has 12 references indexed in Scilit:
- A Survey on Network Codes for Distributed StorageProceedings of the IEEE, 2011
- Rebuilding for array codes in distributed storage systems2010
- Optimal recovery of single disk failure in RDP code storage systemsACM SIGMETRICS Performance Evaluation Review, 2010
- Existence and construction of capacity-achieving network codes for distributed storage2009
- Reducing repair traffic for erasure coding-based storage via interference alignment2009
- STAR : An Efficient Coding Scheme for Correcting Triple Storage Node FailuresIEEE Transactions on Computers, 2008
- Network Coding for Distributed Storage Systems2007
- Low-density MDS codes and factors of complete graphsIEEE Transactions on Information Theory, 1999
- X-code: MDS array codes with optimal encodingIEEE Transactions on Information Theory, 1999
- MDS array codes with independent parity symbolsIEEE Transactions on Information Theory, 1996