mirage

Self-repairing homomorphic codes for distributed storage systems

DSpace/Manakin Repository

 

Search DR-NTU


Advanced Search Subject Search

Browse

My Account

Self-repairing homomorphic codes for distributed storage systems

Show simple item record

dc.contributor.author Oggier, Frederique
dc.contributor.author Datta, Anwitaman
dc.date.accessioned 2011-03-08T09:13:17Z
dc.date.available 2011-03-08T09:13:17Z
dc.date.copyright 2011
dc.date.issued 2011-03-08T09:13:17Z
dc.identifier.citation Oggier, F., & Datta, A. (2011). Self-repairing homomorphic codes for distributed storage systems. IEEE INFOCOM 2011 (30th:2011:Shanghai), pp.1-10.
dc.identifier.uri http://hdl.handle.net/10220/6760
dc.description.abstract Erasure codes provide a storage efficient alternative to replication based redundancy in (networked) storage systems. They however entail high communication overhead for maintenance, when some of the encoded fragments are lost and need to be replenished. Such overheads arise from the fundamental need to recreate (or keep separately) first a copy of the whole object before any individual encoded fragment can be generated and replenished. There has been recently intense interest to explore alternatives, most prominent ones being regenerating codes (RGC) and hierarchical codes (HC). We propose as an alternative a new family of codes to improve the maintenance process, which we call self-repairing codes (SRC), with the following salient features: (a) encoded fragments can be repaired directly from other subsets of encoded fragments without having to reconstruct first the original data, ensuring that (b) a fragment is repaired from a fixed number of encoded fragments, the number depending only on how many encoded blocks are missing and independent of which specific blocks are missing. These properties allow for not only low communication overhead to recreate a missing fragment, but also independent reconstruction of different missing fragments in parallel, possibly in different parts of the network. We analyze the static resilience of SRCs with respect to traditional erasure codes, and observe that SRCs incur marginally larger storage overhead in order to achieve the aforementioned properties. The salient SRC properties naturally translate to low communication overheads for reconstruction of lost fragments, and allow reconstruction with lower latency by facilitating repairs in parallel. These desirable properties make self-repairing codes a good and practical candidate for networked distributed storage systems.
dc.format.extent 11 p.
dc.language.iso en
dc.rights © 2011 IEEE. Personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution to servers or lists, or to reuse any copyrighted component of this work in other works must be obtained from the IEEE. This material is presented to ensure timely dissemination of scholarly and technical work. Copyright and all rights therein are retained by authors or by other copyright holders. All persons copying this information are expected to adhere to the terms and constraints invoked by each author's copyright. In most cases, these works may not be reposted without the explicit permission of the copyright holder. http://www.ieee.org/portal/site This material is presented to ensure timely dissemination of scholarly and technical work. Copyright and all rights therein are retained by authors or by other copyright holders. All persons copying this information are expected to adhere to the terms and constraints invoked by each author's copyright. In most cases, these works may not be reposted without the explicit permission of the copyright holder.
dc.subject DRNTU::Engineering::Computer science and engineering::Computer systems organization::Computer-communication networks
dc.title Self-repairing homomorphic codes for distributed storage systems
dc.type Conference Paper
dc.contributor.conference IEEE Conference on Computer Communications (30th : 2011 : Shanghai, China)
dc.contributor.school School of Physical and Mathematical Sciences
dc.description.version Accepted version
dc.identifier.rims 156212

Files in this item

Files Size Format View
1008.0064v1.pdf 191.6Kb PDF View/Open

This item appears in the following Collection(s)

Show simple item record

Statistics

Total views

All Items Views
Self-repairing homomorphic codes for distributed storage systems 560

Total downloads

All Bitstreams Views
1008.0064v1.pdf 275

Top country downloads

Country Code Views
United States of America 75
China 67
Singapore 42
United Kingdom 28
Russian Federation 10

Top city downloads

city Views
Mountain View 56
Beijing 50
Singapore 40
Dunfermline 26
Suwanee 3

Downloads / month

  2014-10 2014-11 2014-12 total
1008.0064v1.pdf 0 0 1 1