A multiobjective off-line routing model for MPLS networks

This study focuses on the multiobjectivity in the off-line routing of QoS traffic in MultiProtocol Label Switching (MPLS) Networks. The routing problem is formulated as a multiobjective mixed-integer programming. It aims at exploring the trade-offs between three objectives, namely minimal routing delay, optimal load-balance in the network, and minimal splitting of traffic trunks. For the multiobjectivity analysis, we first decompose the model into sub-problems. We then apply the lexicographic weighted Chebyshev metric method to these sub-problems to find the Pareto optimal solutions and visualize the tradeoff between the objective functions. The study is finalized with a case study to analyse the basic properties of the model.