Greedy search
Two stage process used:
- Initialization step
- Fully meshed network generated with zero bandwidth links.
- Generate k shortest paths for all traffic, Tij.
- Stage 1
- Route each traffic element along one of k shortest paths such that the increase in network cost due to allocating bandwidth to links is locally minimal.
- Compute loadings on links and remove zero bandwidth links.