Self-repairing codes : local repairability for cheap and fast maintenance of erasure coded data

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 ensu...

Full description

Saved in:
Bibliographic Details
Main Authors: Oggier, Frédérique, Datta, Anwitaman
Other Authors: School of Computer Engineering
Format: Article
Language:English
Published: 2014
Subjects:
Online Access:https://hdl.handle.net/10356/103114
http://hdl.handle.net/10220/24319
Tags: Add Tag
No Tags, Be the first to tag this record!
Institution: Nanyang Technological University
Language: English
id sg-ntu-dr.10356-103114
record_format dspace
spelling sg-ntu-dr.10356-1031142023-02-28T19:42:41Z Self-repairing codes : local repairability for cheap and fast maintenance of erasure coded data Oggier, Frédérique Datta, Anwitaman School of Computer Engineering School of Physical and Mathematical Sciences DRNTU::Engineering::Computer science and engineering::Data 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. Accepted version 2014-12-08T04:24:38Z 2019-12-06T21:05:55Z 2014-12-08T04:24:38Z 2019-12-06T21:05:55Z 2014 2014 Journal Article Oggier, F., & Datta, A. (2014). Self-repairing codes : local repairability for cheap and fast maintenance of erasure coded data. Computing. https://hdl.handle.net/10356/103114 http://hdl.handle.net/10220/24319 10.1007/s00607-014-0426-5 181612 en Computing © 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]. 32 p. application/pdf
institution Nanyang Technological University
building NTU Library
continent Asia
country Singapore
Singapore
content_provider NTU Library
collection DR-NTU
language English
topic DRNTU::Engineering::Computer science and engineering::Data
spellingShingle DRNTU::Engineering::Computer science and engineering::Data
Oggier, Frédérique
Datta, Anwitaman
Self-repairing codes : local repairability for cheap and fast maintenance of erasure coded data
description 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.
author2 School of Computer Engineering
author_facet School of Computer Engineering
Oggier, Frédérique
Datta, Anwitaman
format Article
author Oggier, Frédérique
Datta, Anwitaman
author_sort Oggier, Frédérique
title Self-repairing codes : local repairability for cheap and fast maintenance of erasure coded data
title_short Self-repairing codes : local repairability for cheap and fast maintenance of erasure coded data
title_full Self-repairing codes : local repairability for cheap and fast maintenance of erasure coded data
title_fullStr Self-repairing codes : local repairability for cheap and fast maintenance of erasure coded data
title_full_unstemmed Self-repairing codes : local repairability for cheap and fast maintenance of erasure coded data
title_sort self-repairing codes : local repairability for cheap and fast maintenance of erasure coded data
publishDate 2014
url https://hdl.handle.net/10356/103114
http://hdl.handle.net/10220/24319
_version_ 1759853570299002880