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

Abel Dasylva; Rayadurgam Srikant

doi:10.1109/INFCOM.1999.751384

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

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

Abstract

We consider the problem of obtaining non-trivial lower bounds on the the lost revenue under any routing and admission control scheme in a multiclass loss network. First, we use the following simpIe 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 [16],[5], 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.

Original language	English (US)
Title of host publication	Proceedings - IEEE INFOCOM'99
Subtitle of host publication	The Conference on Computer Communications - 18th Annual Joint Conference of the IEEE Computer and Communications Societies: The Future is Now
Pages	505-512
Number of pages	8
DOIs	https://doi.org/10.1109/INFCOM.1999.751384
State	Published - 1999
Event	18th Annual Joint Conference of the IEEE Computer and Communications Societies: The Future is Now, IEEE INFOCOM'99 - New York, NY, United States Duration: Mar 21 1991 → Mar 25 1991

Publication series

Name	Proceedings - IEEE INFOCOM
Volume	2
ISSN (Print)	0743-166X

Other

Other	18th Annual Joint Conference of the IEEE Computer and Communications Societies: The Future is Now, IEEE INFOCOM'99
Country/Territory	United States
City	New York, NY
Period	3/21/91 → 3/25/91

Keywords

Admission control
Linear Programs
Routing
Virtual circuits

ASJC Scopus subject areas

Computer Science(all)
Electrical and Electronic Engineering

Online availability

10.1109/INFCOM.1999.751384

Library availability

Discover UIUC Full Text

Cite this

Dasylva, A., & Srikant, R. (1999). Bounds on the performance of admission control and routing policies for general topology networks with multiple call classes. In Proceedings - IEEE INFOCOM'99: The Conference on Computer Communications - 18th Annual Joint Conference of the IEEE Computer and Communications Societies: The Future is Now (pp. 505-512). Article 751384 (Proceedings - IEEE INFOCOM; Vol. 2). https://doi.org/10.1109/INFCOM.1999.751384

Bounds on the performance of admission control and routing policies for general topology networks with multiple call classes. / Dasylva, Abel; Srikant, Rayadurgam.
Proceedings - IEEE INFOCOM'99: The Conference on Computer Communications - 18th Annual Joint Conference of the IEEE Computer and Communications Societies: The Future is Now. 1999. p. 505-512 751384 (Proceedings - IEEE INFOCOM; Vol. 2).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

Dasylva, A & Srikant, R 1999, Bounds on the performance of admission control and routing policies for general topology networks with multiple call classes. in Proceedings - IEEE INFOCOM'99: The Conference on Computer Communications - 18th Annual Joint Conference of the IEEE Computer and Communications Societies: The Future is Now., 751384, Proceedings - IEEE INFOCOM, vol. 2, pp. 505-512, 18th Annual Joint Conference of the IEEE Computer and Communications Societies: The Future is Now, IEEE INFOCOM'99, New York, NY, United States, 3/21/91. https://doi.org/10.1109/INFCOM.1999.751384

Dasylva A, Srikant R. Bounds on the performance of admission control and routing policies for general topology networks with multiple call classes. In Proceedings - IEEE INFOCOM'99: The Conference on Computer Communications - 18th Annual Joint Conference of the IEEE Computer and Communications Societies: The Future is Now. 1999. p. 505-512. 751384. (Proceedings - IEEE INFOCOM). doi: 10.1109/INFCOM.1999.751384

Dasylva, Abel ; Srikant, Rayadurgam. / Bounds on the performance of admission control and routing policies for general topology networks with multiple call classes. Proceedings - IEEE INFOCOM'99: The Conference on Computer Communications - 18th Annual Joint Conference of the IEEE Computer and Communications Societies: The Future is Now. 1999. pp. 505-512 (Proceedings - IEEE INFOCOM).

@inproceedings{7dc35d06776345499d41c175b6b724ba,

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

abstract = "We consider the problem of obtaining non-trivial lower bounds on the the lost revenue under any routing and admission control scheme in a multiclass loss network. First, we use the following simpIe 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 [16],[5], 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.",

keywords = "Admission control, Linear Programs, Routing, Virtual circuits",

author = "Abel Dasylva and Rayadurgam Srikant",

year = "1999",

doi = "10.1109/INFCOM.1999.751384",

language = "English (US)",

isbn = "0780354176",

series = "Proceedings - IEEE INFOCOM",

pages = "505--512",

booktitle = "Proceedings - IEEE INFOCOM'99",

note = "18th Annual Joint Conference of the IEEE Computer and Communications Societies: The Future is Now, IEEE INFOCOM'99 ; Conference date: 21-03-1991 Through 25-03-1991",

}

TY - GEN

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

AU - Dasylva, Abel

AU - Srikant, Rayadurgam

PY - 1999

Y1 - 1999

N2 - We consider the problem of obtaining non-trivial lower bounds on the the lost revenue under any routing and admission control scheme in a multiclass loss network. First, we use the following simpIe 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 [16],[5], 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.

AB - We consider the problem of obtaining non-trivial lower bounds on the the lost revenue under any routing and admission control scheme in a multiclass loss network. First, we use the following simpIe 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 [16],[5], 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.

KW - Admission control

KW - Linear Programs

KW - Routing

KW - Virtual circuits

UR - http://www.scopus.com/inward/record.url?scp=0032650792&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0032650792&partnerID=8YFLogxK

U2 - 10.1109/INFCOM.1999.751384

DO - 10.1109/INFCOM.1999.751384

M3 - Conference contribution

AN - SCOPUS:0032650792

SN - 0780354176

SN - 9780780354173

T3 - Proceedings - IEEE INFOCOM

SP - 505

EP - 512

BT - Proceedings - IEEE INFOCOM'99

T2 - 18th Annual Joint Conference of the IEEE Computer and Communications Societies: The Future is Now, IEEE INFOCOM'99

Y2 - 21 March 1991 through 25 March 1991

ER -

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

Abstract

Publication series

Other

Keywords

ASJC Scopus subject areas

Online availability

Library availability

Related links

Fingerprint

Cite this