Erasure coding for distributed storage: an overview  

作　　者：S.B.BALAJI M.Nikhil KRISHNAN Myna VAJHA Vinayak RAMKUMAR Birenjith SASIDHARAN P.Vijay KUMAR 

机构地区：[1]Department of Electrical Communication Engineering, Indian Institute of Science [2]Ming Hsieh Department of Electrical Engineering, University of Southern California

出　　处：《Science China(Information Sciences)》2018年第10期3-47,共45页中国科学（信息科学）（英文版）

基　　金：supported in part by National Science Foundation of USA (Grant No. 1421848);part by an India-Israel UGC-ISF Joint Research Program Grant

摘　　要：In a distributed storage system, code symbols are dispersed across space in nodes or storageunits as opposed to time. In settings such as that of a large data center, an important consideration isthe 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 ofdata accessed at a helper node as well as the number of helper nodes contacted. Coding theory has evolvedto handle these challenges by introducing two new classes of erasure codes, namely regenerating codes andlocally recoverable codes as well as by coming up with novel ways to repair the ubiquitous Reed-Solomoncode. This survey provides an overview of the efforts in this direction that have taken place over the pastdecade.In a distributed storage system, code symbols are dispersed across space in nodes or storageunits as opposed to time. In settings such as that of a large data center, an important consideration isthe 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 ofdata accessed at a helper node as well as the number of helper nodes contacted. Coding theory has evolvedto handle these challenges by introducing two new classes of erasure codes, namely regenerating codes andlocally recoverable codes as well as by coming up with novel ways to repair the ubiquitous Reed-Solomoncode. This survey provides an overview of the efforts in this direction that have taken place over the pastdecade.

关 键 词：distributed storage regenerating codes locally recoverable codes codes with locality erasurecodes node repair 

分 类 号：TP333[自动化与计算机技术—计算机系统结构]