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...

Full description

Saved in:
Bibliographic Details
Published in:IEEE journal on selected areas in communications 2010-02, Vol.28 (2), p.268-276
Main Authors: Hu, Yuchong, Xu, Yinlong, Wang, Xiaozhao, Zhan, Cheng, Li, Pei
Format: Article
Language:English
Subjects:
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
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary: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.
ISSN:0733-8716
1558-0008
DOI:10.1109/JSAC.2010.100216