Similar articles

Abstract: To ensure the reliability and availability of data, redundancy strategies are always required for distributed storage systems. Erasure coding, one of the representative redundancy strategies, has the advantage of low storage overhead which facilitates its employment in distributed storage systems. Among the various erasure coding schemes, XOR-based erasure codes are becoming popular due to their fast computing speed. When single-node failure happens in such coding schemes, a process called data recovery takes place to retrieve the failed node’s lost data from the surviving nodes. However, the data transmission during the data recovery process usually requires a considerable amount of time. Current research has mainly focused on reducing the amount of data needed for data recovery to reduce the time required for data transmission, but 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 single-node failure recovery of XOR-based erasure codes. SA-RSR utilizes 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 XOR-based erasure codes in simulations and in a real storage system, Ceph. Experiments in Ceph show that SA-RSR reduces the amount of data required for recovery by 20–30% and improves the performance of data recovery by 13–20% compared to the conventional recovery method.