By Topic

Asymptotic performance limits for routing and rate allocation in rate-based multi-class 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
$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

2 Author(s)
A. Diwan ; Indian Inst. of Sci., Bangalore, India ; J. Kuri

We investigate the performance of routing and rate allocation (RRA) algorithms in rate-based multi-class networks, in particular, a network of routers that support the IntServ guaranteed services. We measure the performance of an RRA algorithm in terms of its weighted carried traffic. We derive an upper bound on the weighted carried traffic of any RRA algorithm. The bound can be computed by linear programming. Moreover we show that a fixed RRA algorithm achieves the bound asymptotically. Therefore the bound can be used as an absolute benchmark for the performance of various RRA algorithms. We illustrate this by comparing the simulated performance of a simple shortest-path RRA (SP-RRA) algorithm with the bound.

Published in:

Global Telecommunications Conference, 2002. GLOBECOM '02. IEEE  (Volume:3 )

Date of Conference:

17-21 Nov. 2002