Engineering evolutionary algorithm to solve multi-objective OSPF weight setting problem
AI'06 Proceedings of the 19th Australian joint conference on Artificial Intelligence: advances in Artificial Intelligence
Link-state routing with hop-by-hop forwarding can achieve optimal traffic engineering
IEEE/ACM Transactions on Networking (TON)
| Hi-index | 0.00 |
An important traffic engineering problem for OSPF networks is the determination of optimal link weights. Certainly, this depends on the traffic engineering objective. Regardless, often a variety of performance measures may be of interest to a network provider due to their impact on the network. In this paper, we consider different objectives and discuss how they impact the determination of the link weights and different performance measures. In particular, we propose a composite objective function; furthermore, we present a Lagrangian relaxation-based dual approach to determine the link weight system. We then consider different performance measures and discuss the effectiveness of different objectives through computational studies of a variety of network topologies. We find that our proposed composite objective function with Lagrangian relaxation-based dual approach is very effective in meeting different performance measures and is computationally very fast.