TE Routing Algorithm to Minimize Maximum Link Utilization
Guangxing Wang · Mini-micro Systems · 2005
With the rapid growth of the traffic in the network, traffic engineering is playing a more and more important role in reducing congestion, improving resource utilization and satisfying the quality of service. In this paper, a TE algorithm is proposed to minimize maximum link utilization based on modification of Dijkstra algorithm. It replaces finding the least cost path with finding the path with minimal bandwidth utilization. The simulation shows that the algorithm balances the load distribution to some extent.