A bicriterion approach for routing problems in multimedia networks

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 "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 highspeed network. The algorithmic approach is an adaptation of recent work by Ernesto Martins and his collaborators, namely, the MPS algorithm.

An automated reference point-like approach for multicriteria shortest path problems

“…Our goal will be to use a labeling algorithm to build a tree the nodes of which represent paths from s to any node, in order to compute the K best paths from s to t with respect to metric (2). If node k of the tree represents the j-th path determined by the algorithm from s to x ∈ N, then k is associated with a label containing the following information:…”

“…In Clímaco et al (2003) an algorithm was presented to compute the whole set of non-dominated feasible solutions. Later in Clímaco et al (2004) two procedures for selecting loopless paths, in an automated manner, to be used by the calls of each node to node traffic flow based on the utilisation of weights for the 2 objective functions and on the definition of preference thresholds on the solution space, were developed.…”

A meta-model for multiobjective routing in MPLS networks

“…The problem is solved using a heuristic procedure, based on the composition of shortest paths obtained when only one of the objectives is minimised. An exact algorithm to compute, in an efficient manner, the whole Pareto solution set, in this type of bi-objective routing problems, is given in Clímaco et al (2003).…”

LS(Graph): a constraint-based local search for constraint optimization on trees and paths

“…We also see many COP problems which have been studied and solved in the literature. For instance, in telecommunication networks, routing problems supporting multiple services involve the computation of paths minimizing transmission costs while satisfying bandwidth and delay constraints [15,27,30]. Similarly, the problem of establishing routes for connection requests between network nodes is one of the basic operations in communication networks and it is typically required that no two routes interfere with each other due to quality-of-service and survivability requirements.…”