2000
DOI: 10.1007/978-0-387-35353-1_14
|View full text |Cite
|
Sign up to set email alerts
|

Investigations of the performance of a measurement-based Connection Admission Control algorithm

Abstract: In this paper we present an algorithm for making connection admission decisions in ATM networks, using measurements made on existing connections and the declared parameters of the new connections. Our scheme makes use of the shape-function, a concept developed by Botvich and Duffield [BD95], which arises in the application of Large Deviation theory to queueing systems. By estimating the shape-function of the existing connections, we can make predictions about the effect on the network of accepting new connecti… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
1
0

Year Published

2000
2000
2004
2004

Publication Types

Select...
5

Relationship

0
5

Authors

Journals

citations
Cited by 6 publications
(1 citation statement)
references
References 22 publications
0
1
0
Order By: Relevance
“…RaH cz [22] studies the robustness of these admission rules. Walsh and Du$eld [23] and McGurk and Walsh [24] study an admission rule based on the shape function [25]. This approach is more #exible in that it can be employed for bu!ered as well as bu!erless multiplexers.…”
Section: Related Workmentioning
confidence: 99%
“…RaH cz [22] studies the robustness of these admission rules. Walsh and Du$eld [23] and McGurk and Walsh [24] study an admission rule based on the shape function [25]. This approach is more #exible in that it can be employed for bu!ered as well as bu!erless multiplexers.…”
Section: Related Workmentioning
confidence: 99%