Please use this identifier to cite or link to this item:
Title: Redundantly grouped cross-object coding for repairable storage
Authors: Datta, Anwitaman
Oggier, Frederique
Keywords: DRNTU::Engineering::Computer science and engineering::Data::Coding and information theory
Issue Date: 2012
Source: Datta, A., & Oggier, F. (2012). Redundantly grouped cross-object coding for repairable storage. Proceedings of the Asia-Pacific Workshop on Systems - APSYS '12, 1-6.
Abstract: The problem of replenishing redundancy in erasure code based fault-tolerant storage has received a great deal of attention recently, leading to the design of several new coding techniques [3], aiming at a better repairability. In this paper, we adopt a different point of view, by proposing to code across different already encoded objects to alleviate the repair problem. We show that the addition of parity pieces - the simplest form of coding - significantly boosts repairability without sacrificing fault-tolerance for equivalent storage overhead. The simplicity of our approach as well as its reliance on time-tested techniques makes it readily deployable.
DOI: 10.1145/2349896.2349898
Rights: © 2012 ACM. This is the author created version of a work that has been peer reviewed and accepted for publication by Proceedings of the Asia-Pacific Workshop on Systems - APSYS '12, Association for Computing Machinery. 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: [DOI:].
Fulltext Permission: open
Fulltext Availability: With Fulltext
Appears in Collections:SCSE Conference Papers
SPMS Conference Papers

Files in This Item:
File Description SizeFormat 
Redundantly Grouped Cross-object Coding for Repairable Storage.pdf221.76 kBAdobe PDFThumbnail


checked on Jul 16, 2020

Page view(s) 50

checked on Oct 24, 2020

Download(s) 50

checked on Oct 24, 2020

Google ScholarTM




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