Ecole d'ingénieur et centre de recherche en Sciences du numérique

Hierarchical codes: how to make erasure codes attractive for peer-to-peer storage systems

Duminuco, Alessandro;Biersack, Ernst W

P2P 2008, 8th IEEE International Conference on Peer-to-Peer Computing, 8-11 September 2008, Aachen, Germany

Best paper award

Redundancy is the basic technique to provide reliability in storage systems consisting of multiple components. A redundancy scheme defines how the redundant data are produced and maintained. The simplest redundancy scheme is replication, which however suffers from storage inefficiency. Another approach is erasure coding, which provides the same level of reliability as replication using a significantly smaller amount of storage. When redundant data are lost, they need to be replaced. While replacing replicated data consists in a simple copy, it becomes a complex operation with erasure codes: new data are produced performing a coding over some other available data. The amount of data to be read and coded is d times larger than the amount of data produced. This implies that coding has a larger computational and I/O cost, which, for distributed storage systems, translates into increased network traffic. Participants of Peer-to-Peer systems have ample storage and CPU power, but their network bandwidth may be limited. For these reasons existing coding techniques are not suitable for P2P storage. This work explores the design space between replication and the existing erasure codes. We propose and evaluate a new class of erasure codes, called Hierarchical Codes, which aims at finding a flexible trade-off that allows the reduction of the network traffic due to maintenance without losing the benefits given by traditional codes.

Document Doi Bibtex

Titre:Hierarchical codes: how to make erasure codes attractive for peer-to-peer storage systems
Type:Conférence
Langue:English
Ville:Aachen
Pays:ALLEMAGNE
Date:
Département:Sécurité numérique
Eurecom ref:2502
Copyright: © 2008 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.
Bibtex: @inproceedings{EURECOM+2502, doi = {http://dx.doi.org/10.1109/P2P.2008.9 }, year = {2008}, title = {{H}ierarchical codes: how to make erasure codes attractive for peer-to-peer storage systems}, author = {{D}uminuco, {A}lessandro and {B}iersack, {E}rnst {W}}, booktitle = {{P}2{P} 2008, 8th {IEEE} {I}nternational {C}onference on {P}eer-to-{P}eer {C}omputing, 8-11 {S}eptember 2008, {A}achen, {G}ermany}, address = {{A}achen, {ALLEMAGNE}}, month = {09}, url = {http://www.eurecom.fr/publication/2502} }
Voir aussi: