CISUC

A bicriterion approach for routing problems in multimedia networks

Authors

Abstract

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
"optimise" 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 non-dominated 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.

Keywords

Path ranking, bicriterion shortest path, multimedia network, routing problems

Journal

Networks, Vol. 41, #4, pp. 206-220, May 2003

Cited by

No citations found