Journal of Beijing University of Posts and Telecommunications

  • EI核心期刊

JOURNAL OF BEIJING UNIVERSITY OF POSTS AND TELECOM ›› 2013, Vol. 36 ›› Issue (3): 25-29.doi: 10.13190/jbupt.201303.26.chikk

• Papers • Previous Articles     Next Articles

Bandwidth Minimized Data Recovery Approach under Repair Time Constraint for Distributed Storage System

ZHU Yi-hua1, TIAN Zhi-jian1, CHI Kai-kai1,2   

  1. 1. School of Computer Science and Technology, Zhejiang University of Technology, Hangzhou 310023, China;
    2. The State Key Laboratory of Integrated Services Networks, Xidian University, Xi’an 710071, China
  • Received:2012-09-26 Online:2013-06-30 Published:2013-06-30

Abstract:

In the distributed storage system, the storage node needs to be repaired when its data is damaged. So far, the network coding has been applied in the distributed storage system for greatly reducing the total amount of data transmitted from the undamaged storage nodes called repair bandwidth to repair the data. For network-coding-based distributed storage system, the data repair problem is studied that minimizes the repair bandwidth under the constraint of given rebuilding time. The optimization problem addressing the data repair problem is formulated, and its optimal solution together with the optimal data recovery approach is presented. Simulations show that the proposed approach minimizes repair bandwidth within the given rebuilding time threshold and the repair bandwidth quickly decreases with the increase in the rebuilding time threshold.

Key words: network coding, distributed storage system, repair time, repair bandwidth

CLC Number: