A bicriterion approach for routing problems in multimedia networks

Routing problems in communication networks supporting multiple services, namely, multimedia applications, involve the selection of paths satisfying multiple constraints (of a technical nature) and seeking simultaneously to “optimize” the associated metrics. Although traditional models in this area are single-objective, in many situations, it is important to consider different, eventually conflicting, objectives. In this paper, we consider a bicriterion model dedicated to calculating nondominated paths for specific traffic flows (associated with video services) in multiservice high-speed networks. The mathematical formulation of the problem and the bicriterion algorithmic approach developed for its resolution are presented together with computational tests regarding an application to video-traffic routing in a high-speed network. The algorithmic approach is an adaptation of recent work by Ernesto Martins and his collaborators, namely, the MPS algorithm. © 2003 Wiley Periodicals, Inc.

[1]  E. Martins,et al.  A computational improvement for a shortest paths ranking algorithm , 1994 .

[2]  Pierre Hansen,et al.  Bicriterion Path Problems , 1980 .

[3]  Karsten Weihe,et al.  Pareto Shortest Paths is Often Feasible in Practice , 2001, WAE.

[4]  E. Martins.  An algorithm for ranking paths that may contain cycles , 1984 .

[5]  Santosfeqvm,et al.  A NEW ALGORITHM FOR RANKING LOOPLESS PATHS , 1997 .

[6]  Ernesto de Queirós Vieira Martins,et al.  A Shortest Paths Ranking Algorithm , 1990 .

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

[8]  George C. Polyzos,et al.  Multicast routing for multimedia communication , 1993, TNET.

[9]  E. Martins,et al.  An algorithm for the ranking of shortest paths , 1993 .

[10]  Ernesto de Queirós Vieira Martins,et al.  A new improvement for a K shortest paths algorithm , 2001 .

[11]  E. Martins.  On a multicriteria shortest path problem , 1984 .

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

[13]  Pierre A. Humblet,et al.  Routing subject to quality of service constraints in integrated communication networks , 1995, IEEE Netw..

[14]  J. Y. Yen.  Finding the K Shortest Loopless Paths in a Network , 1971 .

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

[16]  Jose Luis Esteves dos Santos,et al.  A New Shortest Paths Ranking Algorithm , 1999 .