Link weight optimization for routing considering link utilization in communication networks

In this paper, we study the problem that finds optimal link weights for routing in communication networks with a target utilization for each link. Since the problem is known as NP-hard, we take a heuristic approach based on the simulated annealing method. However, to make the algorithm to be more robust and converge fast, we modify the basic simulated annealing method. Numerical results show that our algorithm provides a better performance than the basic simulated annealing method.