Congested Link Inference Algorithms in Dynamic Routing IP Network

Algorithm 2

CLILRS algorithm.

() Step  1. Initial , , , ;

() Step  2. Use the present to solve equations (18), and make the optimal-value , renew ;

() Step  3. Construct a feasible solution of the initial SCP:

()  () Make ;

()  () To uncovered path (), add corresponding to ;

()  () Arrange in descending order, If is still a feasible solution of SCP, ;

()  () Renew .

() Step  4. , If  , Return to line (): Step  9;

() Step  5. Compute sub-gradient , . If , return to line (): Step  9;

() Step  6. Compute iteration step-length , the initial value ,

  If do not add in continuous 30 times of iterations, then is halved;

() Step  7. If , return to line (): Step  9;

() Step  8. Renew Lagrangian multiplier , , return to line (): Step  2;

() Step  9. Output is the optimal solution.