Title :
A Construction of Systematic MDS Codes With Minimum Repair Bandwidth
Author_Institution :
Facebook, Inc., Palo Alto, CA, USA
fDate :
6/1/2011 12:00:00 AM
Abstract :
In a distributed storage system based on erasure coding, an important problem is the repair problem: If a node storing a coded piece fails, in order to maintain the same level of reliability, we need to create a new encoded piece and store it at a new node. This paper presents a construction of systematic (n,k)-MDS codes for 2k ≤ n that achieves the minimum repair bandwidth when repairing from k+1 nodes.
Keywords :
computer network reliability; digital storage; distributed processing; encoding; distributed storage system; erasure coding; minimum repair bandwidth; systematic MDS code; Bandwidth; Maintenance engineering; Network coding; Peer to peer computing; Polynomials; Systematics; Distributed storage; MDS code; erasure coding;
Journal_Title :
Information Theory, IEEE Transactions on
DOI :
10.1109/TIT.2011.2134170
