Journal Home Online First Current Issue Archive For Authors Journal Information 中文版

Frontiers of Information Technology & Electronic Engineering >> 2022, Volume 23, Issue 6 doi: 10.1631/FITEE.2100242

SA-RSR: a read-optimal data recovery strategy for XOR-coded distributed storage systems

Affiliation(s): School of Computer Science and Technology, Xi’an Jiaotong University, Xi’an 710049, China; Beijing Electronic Engineering General Research Institute, Beijing 100854, China; less

Received: 2021-05-16 Accepted: 2022-06-17 Available online: 2022-06-17

Next Previous

Abstract

To ensure the reliability and availability of data, redundancy strategies are always required for s. Erasure coding, one of the representative redundancy strategies, has the advantage of low storage overhead, which facilitates its employment in s. Among the various erasure coding schemes, are becoming popular due to their high computing speed. When a occurs in such coding schemes, a process called takes place to retrieve the failed node's lost data from surviving nodes. However, data transmission during the process usually requires a considerable amount of time. Current research has focused mainly on reducing the amount of data needed for to reduce the time required for data transmission, but it has encountered problems such as significant complexity and local optima. In this paper, we propose a random search recovery algorithm, named SA-RSR, to speed up recovery of . SA-RSR uses a simulated annealing technique to search for an optimal recovery solution that reads and transmits a minimum amount of data. In addition, this search process can be done in polynomial time. We evaluate SA-RSR with a variety of in simulations and in a real storage system, Ceph. Experimental results in Ceph show that SA-RSR reduces the amount of data required for recovery by up to 30.0% and improves the performance of by up to 20.36% compared to the conventional recovery method.

Related Research