Flow-based path selection for Internet traffic engineering with NSGA-II
- 1 January 2010
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 621-627
Abstract
Traffic engineering has become an important issue in Internet operation due to the fast growing of the Internet traffic and the stringent requirements of quality-of-service over the limited available resources. This problem is a multicriteria optimization problem in nature and our goal in this paper is to explore the application of NSGA-II, an evolutionary algorithm for multiobjective optimization, for determining the optimal distribution of traffic demands over the network. The problem is first formulated as a multiobjective constrained optimization problem which is NP-hard. Then, a hybrid heuristic algorithm based on of linear programming and NSGA-II is developed for approximating the optimal Pareto front. We compare the performance of the proposed heuristic using a 10-node problem adopted from the literature with the exact solutions generated using a lexicographic Chebyshev method.Keywords
This publication has 10 references indexed in Scilit:
- An overview of routing optimization for internet traffic engineeringIEEE Communications Surveys & Tutorials, 2008
- Solving the minimum-cost constrained multipath routing with load balancing in MPLS networks using an evolutionary method2007
- Current and Future Research Trends in Evolutionary Multiobjective Optimization2005
- Achieving near-optimal traffic engineering solutions for current OSPF/IS-IS networksIEEE/ACM Transactions on Networking, 2005
- Multi-objective optimization scheme for multicast flows2005
- Edge-based traffic engineering for OSPF networksComputer Networks, 2004
- Load optimal MPLS routing with N + M labels2004
- Internet traffic engineering by optimizing OSPF weights2002
- A fast and elitist multiobjective genetic algorithm: NSGA-IIIEEE Transactions on Evolutionary Computation, 2002
- Notes on effective bandwidths1996