Abstract-In distributed storage systems, locally repairable codes (LRCs) are introduced to realize low disk I/O and repair cost. In order to tolerate multiple node failures, the LRCs with (r, δ)-locality are further proposed. Since hot data is not uncommon in a distributed storage system, both Zeh et al. and Kadhe et al. focus on the LRCs with multiple localities or unequal localities (ML-LRCs) recently, which said that the localities among the code symbols can be different. ML-LRCs are attractive and useful in reducing repair cost for hot data. In this paper, we generalize the ML-LRCs to the (r, δ)-locality case of multiple node failures, and define an LRC with multiple (ri, δi) i∈ [s] localities (s ≥ 2), where r1 ≤ r2 ≤ · · · ≤ rs and δ1 ≥ δ2 ≥ · · · ≥ δs ≥ 2. Such codes ensure that some hot data could be repaired more quickly and have better failure-tolerance in certain cases because of relatively smaller ri and larger δi. Then, we derive a Singleton-like upper bound on the minimum distance for the proposed LRCs by employing the regeneratingset technique. Finally, we obtain a class of explicit and structured constructions of optimal ML-LRCs, and further extend them to the cases of multiple (ri, δ) i∈ [s] localities.
The locally repairable codes with multiple (r i , δ i )-localities are presented in REF .
Locally repairable codes with multiple (ri, δi)-localities
2017 IEEE International Symposium on Information Theory (ISIT)
2017 IEEE International Symposium on Information Theory (ISIT)
Computer Science