Locally Repairable Convertible Codes With Optimal Access Costs

Abstract

Modern large-scale distributed storage systems use erasure codes to protect against node failures with low storage overhead. In practice, the failure rate and other factors of storage devices in the system may vary significantly over time, and leads to changes of the ideal code parameters. To maintain the storage efficiency, this requires the system to adjust parameters of the currently used codes. The changing process of code parameters on encoded data is called code conversion. As an important class of storage codes, locally repairable codes (LRCs) can repair any codeword symbol using a small number of other symbols. This feature makes LRCs highly efficient for addressing single node failures in the storage systems. In this paper, we investigate the code conversions for locally repairable codes in the merge regime. We establish a lower bound on the access cost of code conversion for general LRCs and propose a construction of LRCs that can perform code conversions with access cost matching this bound. This construction yields a family of LRCs with optimal conversion processes over a field size linear in the code length. As a special case, it provides a family of RS codes with optimal conversion processes, which could be of particular practical interest.