Title: TERS: a traffic efficient repair scheme for repairing multiple losses in erasure-coded distributed storage systems

Authors: LiMing Zheng; Xu'an Wang; XiaoBo Tian; XiaoDong Li

Addresses: Officers College of PAP, Department of Electric Technology, ChengDu, ShuangLiu District, Jingxiao Road 489#, China ' Engineering University of CAPF, XiAn, China; Guangxi Key Laboratory of Cryptography and Information Security, Guilin University of Electronic Technology, Guilin, China ' Officers College of PAP, Department of Electric Technology, ChengDu, ShuangLiu District, Jingxiao Road 489#, China ' Officers College of PAP, Department of Electric Technology, ChengDu, ShuangLiu District, Jingxiao Road 489#, China

Abstract: The high repair traffic and the long repair time of erasure coding have posed a new challenge: how to minimise the amount of data transferred among nodes and reduce the repair time when repairing the lost data. Existing schemes are mostly designed for single node failures, which incur high network traffic and result in low efficiency. In this paper, we propose a traffic efficient repair scheme TERS suitable for repairing data losses when multiple nodes fail. To evaluate the repair cost and the repair time, we provide an implementation of integrating TERS into HDFS-RAID. The numerical results confirm that TERS reduces the repair traffic by 44% on average compared with the traditional erasure codes and regenerating codes. Theoretical analysis shows that TERS effectively reduces the repair time.

Keywords: distributed storage; erasure coding; repair traffic; repair time; multiple losses.

DOI: 10.1504/IJCSE.2018.091776

International Journal of Computational Science and Engineering, 2018 Vol.16 No.3, pp.242 - 254

Received: 14 Dec 2015
Accepted: 09 Aug 2016
Published online: 16 May 2018 *

Full-text access for editors Full-text access for subscribers Purchase this article Comment on this article