分布式存储中的再生码综述  

Survey for regenerating codes for distributed storage

作　　者：郝杰[1] 逯彦博[1] 刘鑫吉[1] 夏树涛[1,2] 

机构地区：[1]清华大学深圳研究生院,广东深圳518055 [2]东南大学移动通信国家重点实验室,南京210096

出　　处：《重庆邮电大学学报（自然科学版）》2013年第1期30-38,共9页Journal of Chongqing University of Posts and Telecommunications(Natural Science Edition)

基　　金：国家重点基础研究发展计划("973"计划)(2012CB315803);高校博士点基金(20100002110033);东南大学移动通信国家重点实验室开放课题(2011D11)~~

摘　　要：分布式存储系统中通过引入冗余提高系统的可靠性,纠删码作为重要的冗余策略在分布式存储中得到越来越多的重视。分布式存储系统中,当某个存储节点失效后,需要引入新的节点来修复失效节点的数据。传统纠删码冗余策略在修复失效节点时需要传输的数据量较大。近年来出现的再生码对传统纠删码进行改进以减少修复失效节点的带宽消耗。再生码引入网络编码的思想,在修复失效节点时,参与修复过程的节点首先将本节点内的数据作线性组合后再上传,最终修复带宽消耗最小。介绍了再生码的基本概念,然后介绍单节点修复再生码和合作修复再生码的编码策略,最后总结再生码的发展和研究方向。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.

关 键 词：分布式存储 网络编码 再生码 修复带宽 

分 类 号：TN911[电子电信—通信与信息系统] TP393[电子电信—信息与通信工程]