Hierarchical multiobjective routing in Multiprotocol Label Switching networks with two service classes: a heuristic solution

Modern multiservice network routing functionalities have to deal with multiple, heterogeneous and multifaceted Quality of Service (QoS) requirements. A heuristic approach devised to find “good” solutions to a hierarchical multiobjective alternative routing optimization problem in Multiprotocol Label Switching networks with two service classes (and different types of traffic flows in each class), namely QoS and Best Effort services, formulated within a hierarchical network-wide optimization framework, is presented. This heuristic solution is based on a bi-objective constrained shortest path model and is applied to a test network used in a benchmarking case study. An experimental study based on analytic and discrete event simulation results is presented, allowing for an assessment of the quality of results obtained with this new heuristic solution for various traffic matrices. A dynamic version of the routing method is formulated and its performance with the same case study network is analysed.

[1]  José Craveirinha,et al.  Implementation and performance of a new multiple objective dynamic routing method for multiexchange networks , 2003 .

[2]  F. Kelly.  Routing in circuit-switched networks: optimization, shadow prices and decentralization , 1988, Advances in Applied Probability.

[3]  J. Kaufman,et al.  Blocking in a Shared Resource Environment , 1981, IEEE Trans. Commun..

[4]  Carlos Henggeler Antunes,et al.  A new multiple objective dynamic routing method using implied costs , 2003 .

[5]  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..

[6]  S. Schnitter,et al.  Optimized Traffic Load Distribution in MPLS Networks , 2003 .

[7]  K. G. Ramakrishnan,et al.  Optimization and Design of Network Routing Using Refined Asymptotic Approximations , 1999, Perform. Evaluation.

[8]  J. Bernussou,et al.  Adaptive alternate-routine in telephone networks: optimal and equilibrium solutions , 1988 .

[9]  João C. N. Clímaco,et al.  On a bi-dimensional dynamic alternative routing method , 2005, Eur. J. Oper. Res..

[10]  F. P. Kelly,et al.  Routing and Capacity Allocation in Networks with Trunk Reservation , 1990, Math. Oper. Res..

[11]  Debasis Mitra,et al.  Erlang capacity and uniform approximations for shared unbuffered resources , 1994, TNET.

[12]  Rita Girão-Silva,et al.  A meta-model for multiobjective routing in MPLS networks , 2008, Central Eur. J. Oper. Res..

[13]  Tamás Henk,et al.  A New Degree of Freedom in ATM Network Dimensioning: Optimizing the Logical Configuration , 1995, IEEE J. Sel. Areas Commun..

[14]  Martin J. Oates,et al.  Advanced Multi-Objective Evolutionary Algorithms Applied to Two Problems in Telecommunications , 2000 .

[15]  Marta M. B. Pascoal,et al.  Deviation Algorithms for Ranking Shortest Paths , 1999, Int. J. Found. Comput. Sci..

[16]  João C. N. Clímaco,et al.  A New Multiobjective Dynamic Routing Method for Multiservice Networks: Modelling and Performance , 2006, Comput. Manag. Sci..

[17]  Norio Shiratori,et al.  Routing with multiple QoS requirements for supporting multimedia applications , 1998, Telecommun. Syst..

[18]  João C. N. Clímaco,et al.  An interactive bi-objective shortest path approach: searching for unsupported nondominated solutions , 1999, Comput. Oper. Res..

[19]  Teresa Gomes,et al.  Network performance of multi-service circuit switched networks: simulational comparison of variants of DAR and RTNR , 2004, The IEEE Computer Society's 12th Annual International Symposium on Modeling, Analysis, and Simulation of Computer and Telecommunications Systems, 2004. (MASCOTS 2004). Proceedings..

[20]  João C. N. Clímaco,et al.  A bicriterion approach for routing problems in multimedia networks , 2003, Networks.

[21]  K. G. Ramakrishnan,et al.  Techniques for traffic engineering of multiservice, multipriority networks , 2001, Bell Labs Technical Journal.

[22]  E. Martins,et al.  A bicriterion shortest path algorithm , 1982 .