By Topic

Bounds on the performance of admission control and routing policies for general topology networks with multiple call classes

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

2 Author(s)
Dasylva, A. ; Nokia Res. Center, Burlington, MA, USA ; Srikant, R.

We consider the problem of obtaining non-trivial lower bounds on the the lost revenue under any routing and admission control scheme in a multi-class loss network. First, we use the following simple idea to bound the performance of any coordinate-convex admission policy on a single link: the blocking probability of any call class is lower bounded by considering just this class in isolation and replacing the available bandwidth (a random quantity) by its mean. Then, following the methods of Kelly (1994) and Gibbens and Kelly (see IEEE Journal on Selected Areas in Communications, p.100-10, 1995), we use this single link bound to obtain linear programs which give bounds in the case of sparsely-connected networks with multiple bandwidth classes and alternate routing

Published in:

INFOCOM '99. Eighteenth Annual Joint Conference of the IEEE Computer and Communications Societies. Proceedings. IEEE  (Volume:2 )

Date of Conference:

21-25 Mar 1999