Abstract
This paper proposes a hybrid evolutionary algorithm for solving the constrained multipath traffic engineering problem in MPLS (Multi-Protocol Label Switching) network and its extended architecture GMPLS (Generalized MPLS). Multipath traffic engineering is gaining more importance in contemporary networks. It aims to satisfy the requirements of emerging network applications while optimizing the network performance and the utilization of the available resources within the network. A formulation of this problem as a multiobjective constrained mixed-integer program, which is known to be NP-hard, is first extended. Then, we develop a hybrid heuristic algorithm based on combining linear programming with a devised Pareto-based genetic algorithm for approximating the optimal Pareto curve. A numerical example is adopted from the literature to evaluate and compare the performance of six variations of the proposed heuristic. We study the statistical significance of the results using Kruskal-Wallis nonparametric test. We also compare the results of the heuristic approach with the lexicographic weighted Chebyshev method using a variety of performance metrics.
| Original language | English |
|---|---|
| Pages (from-to) | 1196-1207 |
| Number of pages | 12 |
| Journal | Journal of Network and Computer Applications |
| Volume | 36 |
| Issue number | 4 |
| DOIs | |
| State | Published - Jul 2013 |
Keywords
- Constrained multipath routing
- Evolutionary algorithms
- Generalized/Multi-Protocol Label Switching
- Load balancing
- Mixed-integer programming
- Multiobjective optimization
- Traffic engineering
ASJC Scopus subject areas
- Hardware and Architecture
- Computer Science Applications
- Computer Networks and Communications