By Topic

Service curve based routing subject to deterministic QoS constraints

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
S. Recker ; IMST GmbH, Kamp-Lintfort, Germany ; W. Geisselhardt ; I. Wolff

The problem of traffic engineered routing subject to deterministic QoS constraints with a minimum cost objective is considered. A novel blend of generic service curves as abstraction of network links of the associated network calculus under min-plus algebra and of existing heuristics for the restricted shortest path problem, is presented as a generic approach applicable in arbitrary network infrastructures. In particular, we define load-dependent link cost and present in pseudo-code notation the details of the different steps of the developed algorithm, which comprises of a pre-computation and an on-demand phase. A tabu-search is deployed as a local search heuristic to exploit the neighborhood of a pre-computed minimum weight path. The presented approach provides a generic technical solution for minimum-cost routing subject to deterministic QoS constraints, which includes only a reasonably limited number of tuning knobs and thus facilitates the network operator to concentrate on the rather economical task of link cost definition.

Published in:

Telecommunications, 2003. ICT 2003. 10th International Conference on  (Volume:2 )

Date of Conference:

23 Feb.-1 March 2003