Cooperative Recovery of Distributed Storage Systems from Multiple Losses with Network Coding

This paper studies the recovery from multiple node failures in distributed storage systems. We design a mutually cooperative recovery (MCR) mechanism for multiple node failures. Via a cut-based analysis of the information flow graph, we obtain a lower bound of maintenance bandwidth based on MCR. For...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:IEEE journal on selected areas in communications Jg. 28; H. 2; S. 268 - 276
Hauptverfasser: Hu, Yuchong, Xu, Yinlong, Wang, Xiaozhao, Zhan, Cheng, Li, Pei
Format: Journal Article
Sprache:Englisch
Veröffentlicht: New York IEEE 01.02.2010
The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Schlagworte:
Availability
Bandwidth
Coding
Computer science
Costs
Design engineering
Distributed computing
Distributed storage system
Erasure coding
Flow graphs
High performance computing
Information analysis
Lower bounds
Maintenance
Multiple loss recovery
Network coding
Networks
Recovery
Storage systems
Telecommunication traffic
ISSN:0733-8716, 1558-0008
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:This paper studies the recovery from multiple node failures in distributed storage systems. We design a mutually cooperative recovery (MCR) mechanism for multiple node failures. Via a cut-based analysis of the information flow graph, we obtain a lower bound of maintenance bandwidth based on MCR. For MCR, we also propose a transmission scheme and design a linear network coding scheme based on (¿, ¿) strong-MDS code, which is a generalization of (¿, ¿) MDS code. We prove that the maintenance bandwidth based on our transmission and coding schemes matches the lower bound, so the lower bound is tight and the transmission scheme and coding scheme for MCR are optimal. We also give numerical comparisons of MCR with other redundancy recovery mechanisms in storage cost and maintenance bandwidth to show the advantage of MCR.
Bibliographie:ObjectType-Article-2
SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 14
content type line 23
ISSN:0733-8716
1558-0008
DOI:10.1109/JSAC.2010.100216