Concurrent Regeneration Code with Local Reconstruction in Distributed Storage Systems

Reed-Solomon (RS) codes are a standard erasure code choice and their repair cost is so high that it is a penalty for storage efficiency and high reliability. In this paper, we propose a novel class of Concurrent Regeneration codes with Local reconstruction (CRL), that enjoy three advantages: (1) to minimize the network bandwidth for node repair, (2) to minimize the number of accessed nodes, and (3) faster reconstruction in distributed storage systems. We show how they overcome the limitation of RS codes, and we demonstrate that they are optimal on a trade-off between minimum distance and locality. By conducting performance evaluation in both memory and JBOD environments, experimental results demonstrate the performance of the CRL codes.