A New Method for Reconstructing Data on a Single Failure Node in the Distributed Storage System Based on the MSR Code
Algorithm 4
Local search operator
1: Function (bandwidth local search)
2: An intermediate node and its subtree are randomly selected from the parental topology to find the leaf node connected by the link with the least available bandwidth.
3: if there is more available bandwidth between the node and the other intermediate nodes then the node is connected to that intermediate node.
4: end if
5: EndFunction
6: Function (traffic local search).
7: if the parental repair topology meets the then randomly select a node from the leaf node directly connected to the root node and connect it to a random intermediate node ;
8: EndFunction
9: Function (local search of node processing capacity)
10: A node with stronger processing capacity is randomly selected from the leaf node of the subtree to replace the worst processing capacity intermediate node, the positions of these two nodes in the topology are exchanged.
