A Load-Aware Multistripe Concurrent Update Scheme in Erasure-Coded Storage System

Algorithm 2

Path Selection module.

1. Inputs:

 Candidate path set path residual bandwidth set path delay set ; path hop set source node and destination node of convergence flow or divergence flow; bandwidth requirement of update flow; vector of weighted coefficients for the residual bandwidth, end-to-end delay, and network hops

 Output: the best path from update traffic source to update traffic destination

2. for path in path set do

3. if is from to and do

4.  add to path set

5. end if

6. end for

7. Build the decision matrix based on according to Equation (22)

8.Normalize to according to Equation (23)

9. Construct the weighted decision matrix based on according to Equation (25)

10. Calculate the positive and negative ideal solution of weight matrix according to (26)

11. Calculate the Euclidean distance from each candidate path to the positive and negative ideal solutions according to (27)

12. Calculate the relative closeness between each candidate path and the best candidate path according to (28)

13. Return the candidate path with the largest relative closeness as the route path