A New Construction Method of Regeneration Tree for Single Node Fault Repair Mechanism in Distributed Storage System
Wei Guo, Yong Wang, Miao Ye · 2019
Comparing with the classic redundancy policy of multi-replica technology, Erasure code is preferred due to its higher utilization rate of storage space in distributed storage system. As one kind of the important Erasure code, the traditional regeneration code with star recovery topology cost more time and more network bandwidth in the data recovery process. An efficient approach to reduce the delay time and network consumption is to construct an optimal recovery tree with the best possible bottleneck bandwidth, which is proved to be a Non-deterministic Polynomial problem. To solve this problem, this paper proposed a hybrid genetic algorithm which utilizes the designed crossover operation and mutation operation according to the problem property. A series of experiments have been conducted and the results show that our proposed method has good convergent ability and reduce the regeneration time.