“School of Computer Science”
Back to Papers HomeBack to Papers of School of Computer Science
| Paper IPM / Computer Science / 11035 |
|
||||
| Abstract: | |||||
|
In this paper, we consider the call admission problem in cellular networks that support several classes of calls. In the first part of this paper, we first introduce a multi-threshold guard channel policy and study its limiting behavior under the stationary traffic. Then we give an algorithm for finding the optimal number of guard channels that minimizes the blocking probability of calls with lowest level of QoS subject to constraints on blocking probabilities of other calls. In the second part of the paper, we give an algorithm for finding the minimum number of channels subject to constraints on blocking probabilities of calls. Finally, we propose a prioritized channel assignment algorithm for multi-cells cellular networks to minimize the blocking probability of calls with lowest level of QoS subject to constraints on the blocking probabilities of other calls.
Download TeX format |
|||||
| back to top | |||||
