Research Article
Congested Link Inference Algorithms in Dynamic Routing IP Network
| () Step 1. Initial the set of congested links ; initial the set of congested paths ; | | () Step 2. In the inference moment, while () | | () () Search link : To some link , when its value of is the maximum value, | | () () Add into the set ; | | () ()Renew the set of remaining congested link: Remove from the remaining congested path; | | () () Renew the set of E2E paths : Remove all paths contain the link ; | | () () Return to line (): Step 2; | | () Step 3. Result outputs: The links in the set are the inference results. |
|