Please use this identifier to cite or link to this item: https://hdl.handle.net/10356/103114
Title: Self-repairing codes : local repairability for cheap and fast maintenance of erasure coded data
Authors: Oggier, Frédérique
Datta, Anwitaman
Keywords: DRNTU::Engineering::Computer science and engineering::Data
Issue Date: 2014
Source: Oggier, F., & Datta, A. (2014). Self-repairing codes : local repairability for cheap and fast maintenance of erasure coded data. Computing.
Series/Report no.: Computing
Abstract: Networked distributed data storage systems are essential to deal with the needs of storing massive volumes of data. Dependability of such a system relies on its fault tolerance (data should be available in case of node failures) as well as its maintainability (its ability to repair lost data to ensure redundancy replenishment over time). Erasure codes provide a storage efficient alternative to replication based redundancy in storage systems, ensuring the same fault tolerance at a lower storage overhead cost. Traditional erasure codes however have the drawback of entailing high communication overhead for maintenance, when encoded fragments are lost due to storage device failures, and need to be replenished in new nodes. We propose a new family of erasure codes called self-repairing codes (SRC) taking into account the peculiarities of distributed storage systems, specifically to improve its maintainability by ‘localizing’ the repairs. SRC have the property that encoded fragments can be repaired directly from other small subsets of (typically 2 or 3) encoded fragments. These code properties allow bandwidth efficient and fast recovery even in the presence of multiple failures, in turn translating into better system robustness. A concrete family of such locally repairable codes, namely, homomorphic SRC are proposed and various aspects and properties of the same are studied in detail and compared—quantitatively or qualitatively (as may be suitable) with respect to other codes including traditional erasure codes as well as some recent representative codes designed specifically for storage applications.
URI: https://hdl.handle.net/10356/103114
http://hdl.handle.net/10220/24319
DOI: 10.1007/s00607-014-0426-5
Schools: School of Computer Engineering 
School of Physical and Mathematical Sciences 
Rights: © 2014 Springer-Verlag Wien. This is the author created version of a work that has been peer reviewed and accepted for publication by Computing, Springer-Verlag Wien. It incorporates referee’s comments but changes resulting from the publishing process, such as copyediting, structural formatting, may not be reflected in this document. The published version is available at: [Article DOI: http://dx.doi.org/10.1007/s00607-014-0426-5].
Fulltext Permission: open
Fulltext Availability: With Fulltext
Appears in Collections:SCSE Journal Articles
SPMS Journal Articles

Files in This Item:
File Description SizeFormat 
HSRC-computing-revision-CR.pdf414.77 kBAdobe PDFThumbnail
View/Open

SCOPUSTM   
Citations 50

4
Updated on Feb 27, 2024

Web of ScienceTM
Citations 50

4
Updated on Oct 24, 2023

Page view(s) 5

942
Updated on Mar 18, 2024

Download(s) 20

295
Updated on Mar 18, 2024

Google ScholarTM

Check

Altmetric


Plumx

Items in DR-NTU are protected by copyright, with all rights reserved, unless otherwise indicated.