Research Article
Modeling and Algorithm for Multiple Spanning Tree Provisioning in Resilient and Load Balanced Ethernet Networks
Algorithm 1
The proposed heuristic algorithm.
| / Phase I / | | (1) Use algorithm [20] to determine load balanced routing for working traffic; | | (2) The output of Step 1 is used to derive , and that become given constant values for Phase II; | | / Phase II / | | (3) ; / initializing the load on the most congested link / | | (4) for | | (5) solve Sub-problem to obtain u | | (6) if then ; | | (7) end for | | (8) output routing for VLAN provisioning and the load on the most congested link |
|