Survey for regenerating codes for distributed storage
分布式存储中的再生码综述

Distributed storage system introduces redundancy to increase reliability, and erasure code is used widely in distributed storage system. When a node fails in the distributed storage system, a new node is introduced to repair the failed one. When using erasure code, repairing the failed node often requires a large amount of data transfer. Regenerating Code was proposed to reduce the cost of repair bandwidth. Regenerating Code reduces the amount of data uploaded by each helping node by transferring a linear combination of the data it stores to the failed node in the repair process. In this paper we first review the basic idea of regenerating code. Then we summarize the code constructions of both the one by one and cooperative regenerating code. At last we talk about the future research direction.