Combined packet scheduling and call admission control with minimum throughput guarantee in wireless networks

Abstract

In this paper, a scheduling problem is considered in the cellular network where there exist CBR (constant bit rate) users requiring exact minimum average throughput guarantee, and EMG (elastic with minimum guarantee) users requiring minimum average throughput guarantee and more if possible. We propose a combined scheduling and call admission control algorithm that exactly guarantees the minimum requirements of CBR and EMG users, and then allocates the leftover capacity to, EMG users. The proposed algorithm is developed using utility maximization problem without minimum throughput constraints and newly defined utility functions. In the algorithm, it is easy to give priority to particular users so that their requirements are guaranteed prior to any other user. Moreover, the priority structure enables the proposed measurement-based call admission control algorithm to perform admission trial without affecting the minimum required throughput of ongoing users. We verify the performance of our algorithm through mathematical analysis and simulations.