Solving the minimum-cost constrained multipath routing with load balancing in MPLS networks using an evolutionary method

This paper presents a flexible evolutionary method for minimum-cost multipath constrained routing with load balancing problem in MPLS networks. The proposed solution approach combines genetic algorithms with linear multi-commodity flow to enhance the efficiency of the solution attained. The goal is to determine the distribution of traffic demands over a given capacitated network topology to minimize the routing cost while balancing loads on various links. The constraints that should be satisfied are the maximum hop count, the total number of virtual paths and the link capacities. This problem is a highly constrained multiobjective optimization for which exact optimization methods become helpless to deal with such complexity. Using a case study from the literature, the proposed approach is evaluated and compared with the standard genetic algorithm. We also show how the proposed approach can be used to determine approximate Pareto points and compare them with the exact Pareto front.

[1]  Yanghee Choi,et al.  A constrained multipath traffic engineering scheme for MPLS networks , 2002, 2002 IEEE International Conference on Communications. Conference Proceedings. ICC 2002 (Cat. No.02CH37333).

[2]  Subhash Suri,et al.  Profile-based routing and traffic engineering , 2003, Comput. Commun..

[3]  Lionel M. Ni,et al.  Traffic engineering with MPLS in the Internet , 2000, IEEE Netw..

[4]  Angela L. Chiu,et al.  Overview and Principles of Internet Traffic Engineering , 2002, RFC.

[5]  Chun Tung Chou.  Traffic engineering for MPLS-based virtual private networks , 2004, Comput. Networks.

[6]  Daniel O. Awduche,et al.  Requirements for Traffic Engineering Over MPLS , 1999, RFC.

[7]  Rudolf Mathar,et al.  An off-line traffic engineering model for MPLS networks , 2002, 27th Annual IEEE Conference on Local Computer Networks, 2002. Proceedings. LCN 2002..

[8]  Eric C. Rosen,et al.  Multiprotocol Label Switching Architecture , 2001, RFC.

[9]  Ralph E. Steuer,et al.  An interactive weighted Tchebycheff procedure for multiple objective programming , 1983, Math. Program..