Header menu link for other important links
X
Erasure coding for distributed storage: an overview
S.B. Balaji, , Myna Vajha, Vinayak Ramkumar, Birenjith Sasidharan, P. Kumar Vijay
Published in Science in China Press
2018
Volume: 61
   
Issue: 10
Abstract
In a distributed storage system, code symbols are dispersed across space in nodes or storage units as opposed to time. In settings such as that of a large data center, an important consideration is the efficient repair of a failed node. Efficient repair calls for erasure codes that in the face of node failure, are efficient in terms of minimizing the amount of repair data transferred over the network, the amount of data accessed at a helper node as well as the number of helper nodes contacted. Coding theory has evolved to handle these challenges by introducing two new classes of erasure codes, namely regenerating codes and locally recoverable codes as well as by coming up with novel ways to repair the ubiquitous Reed-Solomon code. This survey provides an overview of the efforts in this direction that have taken place over the past decade. © 2018, Science China Press and Springer-Verlag GmbH Germany, part of Springer Nature.
About the journal
JournalScience China Information Sciences
PublisherScience in China Press
ISSN1674733X