Abstract
This paper presents a general framework for a wide range of call admission control (CAC) algorithms. For several CAC schemes, which are a subset of this general framework, an analytical performance evaluation is presented for a multi-traffic mobile wireless network. These CAC algorithms consider a variety of mechanisms to prioritize traffic in an attempt to support different levels of quality of service (QoS) for different types of calls. These mechanisms include dividing the handoff traffic into more than one class and using guard channels or allowing channel splitting to admit more handoff calls. Other mechanisms aimed at adding priority for handoff calls consider employing queuing of handoff calls or dynamically reducing the number of lower priority calls. Furthermore, our analysis relaxes the typically used assumptions of equal channel holding time and equal resource usage for voice and data calls. The main contribution of this paper is the. development of an analytical model for each of the three CAC algorithms specified in this study. In addition to the call blocking and termination probabilities which are usually cited as the performance metrics, in this work we derive and evaluate other metrics that have not be considered by previous work such as the average queue length, the average queue residency, and the time-out probability for handoff calls. We also develop a simulation tool to test and verify our results. Finally, we present numerical examples to demonstrate the performance of the proposed CAC algorithms and we show that analytical and simulation results are in total agreement.