A connection between locally repairable codes and exact regenerating codes

Ernvall, Toni; Westerbäck, Thomas; Freij-Hollanti, Ragnar; Hollanti, Camilla

doi:10.1109/isit.2016.7541379

Cited by 4 publications

(2 citation statements)

References 36 publications

(59 reference statements)

Supporting

Mentioning

Contrasting

Order By: Relevance

“…In [11], Kamath et al gave an existential proof without presenting an explicit construction. Another direction of combining RCs and LRCs is to use repair locality for selecting the accessed nodes in a RC [29], while an interpretation of LRCs as exact RCs was presented in [30]. Two different erasure codes, product and LRC codes, are used to dynamically adapt to the workload changes in Hadoop Adaptively-Coded Distributed File System (HACFS) [31].…”

Section: Related Workmentioning

confidence: 99%

Network traffic driven storage repair

Gligoroski

Kralevska

Jensen

et al. 2019

IJBDI

View full text Add to dashboard Cite

Recently we constructed an explicit family of locally repairable and locally regenerating codes. Their existence was proven by Kamath et al. but no explicit construction was given. Our design is based on HashTag codes that can have different sub-packetization levels. In this work we emphasize the importance of having two ways to repair a node: repair only with local parity nodes or repair with both local and global parity nodes. We say that the repair strategy is network traffic driven since it is in connection with the concrete system and code parameters: the repair bandwidth of the code, the number of I/O operations, the access time for the contacted parts and the size of the stored file. We show the benefits of having repair duality in one practical example implemented in Hadoop. We also give algorithms for efficient repair of the global parity nodes.

show abstract

Section: Related Workmentioning

confidence: 99%

Network traffic driven storage repair

Gligoroski

Kralevska

Jensen

et al. 2019

IJBDI

View full text Add to dashboard Cite

show abstract

“…In [12], Kamath et al gave an existential proof without presenting an explicit construction. Another direction of combining RCs and LRCs is to use repair locality for selecting the accessed nodes in a RC [13], while an interpretation of LRCs as exact RCs was presented in [14]. Two different erasure codes, product and LRC codes, are used to optimize for recovery performance and reduce the storage overhead in [15].…”

Section: Introductionmentioning

confidence: 99%

Repair Duality with Locally Repairable and Locally Regenerating Codes

Gligoroski¹,

Kralevska²,

Jensen³

et al. 2017

2017 IEEE 15th Intl Conf on Dependable, Autonomic and Secure Computing, 15th Intl Conf on Pervasive Intelligence and Computing,

View full text Add to dashboard Cite

We construct an explicit family of locally repairable and locally regenerating codes whose existence was proven in a recent work by Kamath et al. about codes with local regeneration but no explicit construction was given. This explicit family of codes is based on HashTag codes. HashTag codes are recently defined vector codes with different vector length α (also called a sub-packetization level) that achieve the optimal repair bandwidth of MSR codes or near-optimal repair bandwidth depending on the sub-packetization level. We applied the technique of paritysplitting code construction. We show that the lower bound on the size of the finite field for the presented explicit code constructions can be lower than the one given in the work of Kamath et al. Finally, we discuss the importance of having two ways for node repair with locally regenerating HashTag codes: repair only with local parity nodes or repair with both local and global parity nodes. To the best of the authors' knowledge, this is the first work where this duality in repair process is discussed. We give a practical example and experimental results in Hadoop where we show the benefits of having this repair duality.

show abstract