Authors: Kenneth W. Shum; Junyu Chen
Addresses: Institute of Network Coding, The Chinese University of Hong Kong, Shatin, Hong Kong ' Department of Information Engineering, The Chinese University of Hong Kong, Shatin, Hong Kong
Abstract: Cooperative regenerating codes are designed for repairing multiple node failures in distributed storage systems. In contrast to the original repair model of regenerating codes, which are for the repair of single node failure, data exchange among the new nodes is enabled. It is known that further reduction in repair bandwidth is possible with cooperative repair. Currently in the literature, we have an explicit construction of exact-repair cooperative code achieving all parameters corresponding to the minimum-bandwidth point. We give a slightly generalized and more flexible version of this cooperative regenerating code in this paper. For minimum-storage regeneration with cooperation, we present an explicit code construction which can jointly repair any number of systematic storage nodes.
Keywords: distributed storage systems; network coding; regenerating codes; repair bandwidth; cooperative repair; multiple node failures; data exchange; systematic storage nodes.
International Journal of Information and Coding Theory, 2016 Vol.3 No.4, pp.299 - 323
Available online: 21 Sep 2016 *Full-text access for editors Access for subscribers Purchase this article Comment on this article