2002
DOI: 10.1007/3-540-36228-2_83
|View full text |Cite
|
Sign up to set email alerts
|

A Call Admission Control Algorithm Based on Stochastic Performance Bound for Wireless Networks

Abstract: In this paper, we derive stochastic performance bounds under the assumption of exponentially bounded burstiness (EBB) traffic model and exponentially bounded fluctuation (EBF) channel model. Then we propose a measurement-based call admission algorithm providing statistical service level agreement (SLA) guarantee for accepted flows based on the QoS prediction equations for both single and multiple priority services. Our call admission control algorithm is characterized by tunable tradeoff between channel utiliz… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
1
0

Publication Types

Select...
1

Relationship

0
1

Authors

Journals

citations
Cited by 1 publication
(1 citation statement)
references
References 4 publications
0
1
0
Order By: Relevance
“…The most common CAC algorithm design approaches used for streaming media servers have included utilization-based [1], measurement-based [2], and delay bound-based [3]. Nonetheless, many CAC algorithms adopted in Internet are hybrid [4]. Besides, almost all existing CAC algorithms regard each stream as long-lived; that is, the lifetime of a stream is not considered.…”
Section: Introductionmentioning
confidence: 99%
“…The most common CAC algorithm design approaches used for streaming media servers have included utilization-based [1], measurement-based [2], and delay bound-based [3]. Nonetheless, many CAC algorithms adopted in Internet are hybrid [4]. Besides, almost all existing CAC algorithms regard each stream as long-lived; that is, the lifetime of a stream is not considered.…”
Section: Introductionmentioning
confidence: 99%