Existence of Minimum-Repair-Bandwidth Cooperative Regenerating Codes
In distributed storage systems, a new class of faulttolerant codes, called regenerating codes, was introduced in order to minimize the traffic required in repairing a failed storage node. Studies of regenerating codes in the literature mainly focus on repairing a single-node failure. Nevertheless, multiple-node failure is common in real systems. In this paper, we consider the problem of regenerating multiple failed nodes simultaneously and cooperatively. We give a lower bound of the repair-bandwidth under cooperative repair. The tightness of this lower bound is proved by constructing a flow in the information flow graph which matches this lower bound. Based on the construction of flow, we prove the existence of linear regenerating codes with repair-bandwidth equal to the lower bound, with an explicit bound on the required finite field size.
Kenneth W.Shum Yuchong Hu
Institute of Network Coding, The Chinese University of Hong Kong
国际会议
2011 International Symposium on Network Coding(2011网络编码国际会议 NETCOD 2011)
北京
英文
1-6
2011-07-25（万方平台首次上网日期，不代表论文的发表时间）