By Topic

QoS-aware routing schemes based on hierarchical load-balancing for integrated services packet networks

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
$31 $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)
Casetti, C. ; Dipt. di Elettronica, Politecnico di Torino, Italy ; Lo Cigno, R. ; Mellia, M.

This paper presents a load-balancing method to improve network utilization when static routing algorithms are employed. Static routing algorithms can generally be reduced to a path assignment problem with the aim of minimizing a cost function: i.e., maximizing network revenues. Unfortunately the problem, when multiple constraints such as different QoS traffic classes are present, is computationally intractable. Load-balancing methods are heuristics that allow the identification of local minima of the cost function that hopefully are close to the real optimum. The load-balancing method we propose is based only on static information about the average traffic load of each traffic relation: a piece of information which can easily be attained in telecommunication networks. The path-selection strategy is defined in terms of set theory and its performance is evaluated via simulation by comparison against standard minimum-hop path selections. Simulation results show that low priority traffic benefits significantly from the more balanced load obtained with our solution

Published in:

Communications, 1999. ICC '99. 1999 IEEE International Conference on  (Volume:1 )

Date of Conference: