Scheduling and Source Control with Average Queue-Length Control in Cellular Networks

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 and delay guarantee, and EMG (elastic with minimum guarantee) users requiring minimum average throughput and delay guarantee and more throughput if possible. We first define a new utility function of average queue length. Based on the new queue utility function and the throughput utility function proposed before, we design a 2-dimensional weight function that will be used in our scheduling algorithm, and suggest a source control algorithm that can work with the scheduling algorithm. We show through simulations that the proposed algorithm guarantees the QoS (quality of service) requirements of CBR and EMG users.