Analytical modeling of call admission control schemes for multiclass traffic mobile wireless networks

This paper studies and analyze two call admission control (CAC) schemes in multimedia cellular wireless networks. These call admission control algorithms are studied for different network configurations. These configurations include, employing the queuing techniques for voice handoff with finite lifetime, differentiating between voice and data calls in terms of the average channel holding time, data bandwidth requirements, and employing queuing techniques for voice handoff and data handoff calls with finite lifetime. The main contribution of this paper is the development of an analytical model for each of the two 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.