Premium
Hierarchical multiobjective routing in Multiprotocol Label Switching networks with two service classes: a heuristic solution
Author(s) -
GirãoSilva Rita,
Craveirinha José,
Clímaco João
Publication year - 2009
Publication title -
international transactions in operational research
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 1.032
H-Index - 52
eISSN - 1475-3995
pISSN - 0969-6016
DOI - 10.1111/j.1475-3995.2009.00669.x
Subject(s) - computer science , heuristic , multiprotocol label switching , routing (electronic design automation) , quality of service , mathematical optimization , hierarchical routing , shortest path problem , multipath routing , distributed computing , static routing , computer network , routing protocol , mathematics , theoretical computer science , artificial intelligence , graph
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.