Name
Abstract | ||
|---|---|---|
This paper introduces a general decision model, in the shape of a Markov Decision
Process, as an instrument to analytically compare the behavior of call admission control
policies. This approach allows the study of a wide class of policies, including well‐known
pure stationary as well as randomized policies, in a way that explicitly incorporates
the dependency between the hand‐off rate and the system state, assuming that the hand‐off
rate arriving to a cell is proportional to the occupancy level of the adjacent cells.
In particular, some well‐known non‐preemptive prioritization schemes are analyzed,
including the Cutoff Priority Policy (CPP), which consists of reserving a number of
channels for the high priority requests stream. Using our analytical approach, we
prove the optimality of CPP within the analyzed class. Copyright © 2001 John Wiley
& Sons, Ltd.
|
Year | DOI | Venue |
|---|---|---|
2001 | 10.1002/wcm.17 | Wireless Communications and Mobile Computing |
Keywords | Field | DocType |
call admission control policies semi-markov decision models qos optimization,decision models | Mathematical optimization,Computer science,Call Admission Control,Cutoff,Prioritization,Markov decision process,Hand-off,Communication channel,Real-time computing,Decision model,Distributed computing | Journal |
Volume | Issue | ISSN |
1 | 3 | 1530-8677 |
Citations | PageRank | References |
4 | 0.57 | 6 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Novella Bartolini | 1 | 250 | 21.87 |
| Imrich Chlamtac | 2 | 4617 | 728.71 |