Explicit Construction of MBR Codes for Clustered Distributed Storage

01/08/2018

∙

by   Jy-yong Sohn, et al.

∙

0

∙

share

Capacity of the distributed storage system (DSS) is often discussed in the context of tradeoff between storage overhead and repair bandwidth. This paper considers capacity-achieving coding for the clustered form of distributed storage that reflects practical storage networks. The suggested coding scheme is shown to exactly regenerate the arbitrary failed node with minimum required bandwidth, i.e., the proposed scheme is a minimum-bandwidth-regenerating (MBR) code of clustered DSSs with general parameter setting. The proposed code is a generalization of the existing MBR code designed for nonclustered DSSs. This code can be implemented in data centers with multiple racks (clusters), depending on the desired system parameters.