Please use this identifier to cite or link to this item: https://hdl.handle.net/10356/79416
Full metadata record
DC FieldValueLanguage
dc.contributor.authorDatta, Anwitamanen
dc.contributor.authorOggier, Frédériqueen
dc.date.accessioned2015-05-08T08:47:16Zen
dc.date.accessioned2019-12-06T13:24:45Z-
dc.date.available2015-05-08T08:47:16Zen
dc.date.available2019-12-06T13:24:45Z-
dc.date.copyright2015en
dc.date.issued2015en
dc.identifier.citationOggier, F., & Datta, A. (2015). On repairing erasure coded data in an active-passive mixed storage network. International journal on information and coding theory, 3(1).en
dc.identifier.urihttps://hdl.handle.net/10356/79416-
dc.description.abstractNetworked distributed storage systems (NDSS) use erasure codes in lieu of replication for realising data redundancy. An interesting research challenge is to derive the largest advantage from the trade–offs between storage overhead and reliability that erasure codes provide, while optimising them to satisfy specific storage needs like repairability and better degraded read performance. Many coding strategies for NDSS exploit the storage nodes' computational ability to improve on repairability by applying network coding techniques. However, not every storage node in a NDSS is necessarily endowed with computing capability. This paper studies the effects of passive nodes, i.e., nodes without computational ability, on the repairability of erasure coded data, and how they may impair the promised performance of novel coding techniques. Specifically, we determine a lower bound on the minimum storage overhead in an active–passive mixed storage network, indicative of the price to pay in storage to achieve bandwidth efficient repairability.en
dc.format.extent19 p.en
dc.language.isoenen
dc.relation.ispartofseriesInternational journal on information and coding theoryen
dc.rights© 2015 Inderscience. This is the author created version of a work that has been peer reviewed and accepted for publication by International Journal on Information and Coding Theory, Inderscience. 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.1504/IJICOT.2015.068697].en
dc.subjectDRNTU::Engineering::Computer science and engineering::Data::Coding and information theoryen
dc.titleOn repairing erasure coded data in an active-passive mixed storage networken
dc.typeJournal Articleen
dc.contributor.schoolSchool of Physical and Mathematical Sciencesen
dc.identifier.doi10.1504/IJICOT.2015.068697en
dc.description.versionAccepted versionen
dc.identifier.rims182925en
item.grantfulltextopen-
item.fulltextWith Fulltext-
Appears in Collections:SPMS Journal Articles
Files in This Item:
File Description SizeFormat 
AuthorsFinalVersion.pdf288.65 kBAdobe PDFThumbnail
View/Open

Page view(s) 10

786
Updated on Jul 25, 2024

Download(s) 20

202
Updated on Jul 25, 2024

Google ScholarTM

Check

Altmetric


Plumx

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