Locally Repairable Codes Based on Fractional Repetition Codes in Distributed Storage Systems

Wang, Jing; Wang, Tiantian; Li, Xiangyang; Zhang, Xuefei; Wang, Shuxia

doi:10.12783/dtcse/wicom2018/26306

Cited by 2 publications

(1 citation statement)

References 16 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…However, this coding relies too much on the accuracy of node prediction. Wang Zizhong et al [17] designed a hybrid code based on the characteristics of fast repair efficiency of local repair code and low storage overhead of the Hitchhiker code, which uses LRC to store hot data and the Hitchhiker code to store cold data, but its coding conversion mechanism is too ideal.…”

Section: Related Workmentioning

confidence: 99%

A New Method for Reconstructing Data Considering the Factor of Selected Provider Nodes Set in Distributed Storage System

Zhang

Wei

et al. 2022

Mathematics

View full text Add to dashboard Cite

In the distributed storage system, when data need to be recovered after node failure, the erasure code redundancy method occupies less storage space than the multi-copy method. At present, the repair mechanism using erasure code to reconstruct the failed node only considers the improvement of link bandwidth on the repair rate and does not consider the impact of the selection of data providing node-set on the repair performance. A single node fault data reconstruction method based on the Software Defined Network (SDN) using the erasure code method is designed to solve the above problems. This method collects the network link-state through SDN, establishes a multi-attribute decision-making model of the data providing node-set based on the node performance, and determines the data providing nodes participating in providing data through the ideal point method. Then, the data recovery problem of a single fault node is modeled as the optimization problem of an optimal repair tree, and a hybrid genetic algorithm is designed to solve it. The experimental results show that under the same erasure code scale, after selecting the nodes of the data providing node-set, compared with the traditional tree topology and star topology, the repair delay distribution of the designed single fault node repair method for a distributed storage system is reduced by 15% and 45% respectively, and the repair flow is close to the star topology, which is reduced by 40% compared with the traditional tree repair.

show abstract

Section: Related Workmentioning

confidence: 99%