Node recovery schemes for minimizing repair time in distributed storage system with network coding

It is significant to repair (or rebuilt) the damaged storage node in the distributed storage system (DSS). Recently, the network coding technique is applied to DSS to decrease the repair bandwidth. In practice, in addition to repair bandwidth, repair time is usually one of the key concerns in the DS...

Full description

Saved in:
Bibliographic Details
Published in:IEEE Wireless Communications and Networking Conference : [proceedings] : WCNC pp. 2857 - 2861
Main Authors: Kaikai Chi, Zhijian Tian, Yi-hua Zhu
Format: Conference Proceeding
Language:English
Published: IEEE 01.04.2014
Subjects:
Bandwidth
Decision support systems
Distributed storage system
Encoding
Maintenance engineering
Network coding
Peer-to-peer computing
Redundancy
Repair bandwidth
Repair time
ISSN:1525-3511
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:It is significant to repair (or rebuilt) the damaged storage node in the distributed storage system (DSS). Recently, the network coding technique is applied to DSS to decrease the repair bandwidth. In practice, in addition to repair bandwidth, repair time is usually one of the key concerns in the DSS, which has not been investigated in the existing DSSs in which network coding is applied. In this paper, we propose the minimum-time repair (MTR) scheme, which is able to achieve the lower bound of repair time while considerably decreasing repair bandwidth. Numerical results show that MTR outperforms some available node recovery approaches in terms of repair time.
ISSN:1525-3511
DOI:10.1109/WCNC.2014.6952902