Efficiently Coding Replicas to Erasure Coded Blocks in Distributed Storage Systems

Efficiently Coding Replicas to Erasure Coded Blocks in Distributed Storage Systems

Modern distributed storage systems usually store new data in replicas, and later code these data into erasure coded blocks when they get cold. This letter studies optimal bandwidth consumption problem for this replica to erasure coded blocks (R2E) coding process, and proposes schemes of R2E_singleTr...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:IEEE communications letters 2017-09, Vol.21 (9), p.1897-1900
Hauptverfasser: Yuan, Zimu, Liu, Huiying
Format: Artikel
Sprache:eng
Schlagworte:
Bandwidth
Bipartite graph
Complexity theory
Computational efficiency
distributed coding
Distributed databases
Encoding
Erasure codes
replication
Systematics
Online-Zugang:Volltext bestellen
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:Modern distributed storage systems usually store new data in replicas, and later code these data into erasure coded blocks when they get cold. This letter studies optimal bandwidth consumption problem for this replica to erasure coded blocks (R2E) coding process, and proposes schemes of R2E_singleTree and R2E_multiTree based on problem observations. Theoretical analysis and evaluation are conducted for these two schemes.
ISSN:1089-7798
1558-2558
DOI:10.1109/LCOMM.2017.2709312