A Node Selection Scheme for Data Repair Using Erasure Code in Distributed Storage System

Abstract

The explosion of massive data poses a severe challenge to the storage cost and data storage reliability of traditional storage systems. As the number of storage nodes increases in a distributed storage system, the node failure probability increases. Erasure code technology as a redundancy strategy can greatly save the cost of storage space while providing security for data compared with multi-copy technology. In real large-scale data centers, the repair costs vary due to differences in storage node attributes and link status changes between nodes. In the repair process based on the erasure code mechanism, it is required to select a certain number of provider nodes from the surviving nodes to transmit data to the newcomer nodes, which leads to the problem of selecting nodes to participate in the repair process. In this paper, a tree-type repair scheme considering node selection (TR-NS) is designed, including an algorithm for selecting two types of nodes according to nodes performance and an algorithm for establishing the optimal repair tree to complete the reconstruction of the failure data. The experimental results show that the repair time of the TR-RS scheme proposed in this paper is significantly reduced.