Lagrangean heuristic for primary routes assignment in survivable connection-oriented networks
Computational Optimization and Applications
| Hi-index | 0.00 |
This paper demonstrates the effectiveness of applyingoptimization techniques to solve traffic engineering (TE)problems in IP networks over Multiprotocol Label Switching(MPLS). Our approach models TE tasks as mathematicalprogramming problems and proposes heuristic algorithms.Another contribution of this work is the combinationof Lagrangean relaxation with heuristics to computenear-optimal solutions quickly. Numerical experimentscontrast the solutions produced by our algorithm with optimalones, which were obtained with a top-notch optimizationsoftware package. All in all, the results indicate thatthe Lagrangean-based routing method outperforms standardalgorithms with respect to a number of performancecriteria, including throughput and packet-loss rate.