Hierarchical Multiobjective Routing in MPLS Networks with Two Service Classes - A Meta-Heuristic Resolution Approach

The paper begins by reviewing a two-level hierarchical multicriteria routing model for MPLS networks with two service classes (QoS and Best Effort services) and alternative routing, as well as the foundations of a heuristic resolution approach, previously proposed by the authors. Afterwards a new approach, of meta-heuristic nature, based on the introduction of Simulated Annealing and Tabu Search techniques, in the structure of the dedicated heuristic, is described. The application of the developed procedures to a benchmarking case study will show that, in certain initial conditions, this approach provides improvements in the final results especially in more ‘difficult’ situations detected through sensitivityanalysis.

[1]  Jens Clausen,et al.  Hierarchical Network Design Using Simulated Annealing , 2002 .

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

[3]  Susmi Routray,et al.  Bandwidth Optimization through Dynamic Routing in ATM Networks: Genetic Algorithm and Tabu Search Approach , 2007 .

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

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

[6]  Celso C. Ribeiro,et al.  Routing and wavelength assignment by partition colouring , 2006, Eur. J. Oper. Res..

[7]  C. Reeves.  Modern heuristic techniques for combinatorial problems , 1993 .

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

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

[10]  Averill M. Law,et al.  Simulation Modeling and Analysis , 1982 .

[11]  Takumi Miyoshi,et al.  Fast topological design with simulated annealing for multicast networks , 2002, Proceedings ISCC 2002 Seventh International Symposium on Computers and Communications.

[12]  Marcus Randall,et al.  A Simulated Annealing Approach to Communication Network Design , 2002, J. Comb. Optim..

[13]  Takumi Miyoshi,et al.  Multicast Network Design by the Use of Heuristic Algorithms , 1999 .

[14]  Fred W. Glover,et al.  Tabu search for dynamic routing communications network design , 1997, Telecommun. Syst..

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

[16]  Baohua Zhang,et al.  Simulated Annealing Based Bandwidth Reservation for QoS Routing , 2006, 2006 IEEE International Conference on Communications.

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

[18]  Jian Shen,et al.  A tabu search algorithm for the routing and capacity assignment problem in computer networks , 2005, Comput. Oper. Res..

[19]  Vladimir Marianov,et al.  Design of Heterogeneous Traffic Networks Using Simulated Annealing Algorithms , 2005, ICOIN.

[20]  F. Glover,et al.  Bandwidth packing: a tabu search approach , 1993 .

[21]  José Craveirinha,et al.  Multicriteria Analysis in Telecommunication Network Planning and Design — Problems and Issues , 2005 .

[22]  Ke Xu,et al.  Multi-constrained routing based on simulated annealing , 2003, IEEE International Conference on Communications, 2003. ICC '03..

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

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

[25]  Frank Kelly,et al.  Notes on effective bandwidths , 1994 .

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

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

[28]  Rita Girão-Silva,et al.  Hierarchical multiobjective routing in Multiprotocol Label Switching networks with two service classes: a heuristic solution , 2009, Int. Trans. Oper. Res..

[29]  Andrzej P. Wierzbicki,et al.  Telecommunications, multiple criteria analysis and knowledge theory , 2005 .

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

[31]  Zhang Kun,et al.  Distributed multicast routing for delay and delay variation-bounded Steiner tree using simulated annealing , 2005 .

[32]  C. D. Gelatt,et al.  Optimization by Simulated Annealing , 1983, Science.

[33]  M. Gendreau,et al.  A tabu search heuristic for the Steiner Tree Problem , 1999, Networks.

[34]  Xin Yao,et al.  Call routing by simulated annealing , 1995, IEA/AIE '95.

[35]  Marek Makowski,et al.  Model-Based Decision Support Methodology with Environmental Applications , 2000 .