Login
Worst-case, information and all-blocks locality in distributed storage systems: An explicit comparison
Résumé Distributed storage systems often use erasure coding techniques to provide reliability while decreasing the storage overhead required by replication. Due to the drawbacks of standard MDS erasure-correcting codes, numerous coding schemes recently proposed for distributed storage systems target other metrics such as repair locality and repair bandwidth. Unfortunately, these schemes are not always practical, and for most of them locality covers information data only. In this article, we compare three explicit linear codes for three types of locality: a Reed-Solomon code for worst-case locality, a recently proposed pyramid code for information locality and the Hamming code HAM, an optimal locally repairable code directly built from its generator matrix for all-blocks locality. We also provide an efficient way for repairing HAM and show that for the same level of storage overhead HAM provides faster encoding, faster repair and lower repair bandwidth than the other two solutions while requiring less than fifty lines of code.
   
Mots-clés
   
Citation R. Barbi, et al., "Worst-case, information and all-blocks locality in distributed storage systems: An explicit comparison," in 15th Canadian Workshop on Information Theory (CWIT 2017), Quebec City, Canada, 2017.
   
Type Actes de congrès (Anglais)
Nom de la conférence 15th Canadian Workshop on Information Theory (CWIT 2017) (Quebec City, Canada)
Date de la conférence 11-6-2017
Editeur commercial IEEE
URL https://ieeexplore.ieee.org/document/7994821
Liée au projet SafeCloud: Secure and Resilient Cloud Architecture