Rate scheduling for the downlink of CDMA mixed traffic networks

We consider the downlink rate scheduling problem for CDMA networks with multiple users carrying packets with different types of traffic (`voice/audio only´, `data-only´ or mixed traffic), each of which has its own QoS requirements that need to be satisfied. At each timeslot we serve the user with the earliest deadline. If his head packet was fully served and there is still power left in the system, we repeat the procedure with the next earliest deadline user, as long as we have power resources. We can thus serve more than one user per timeslot, power permitting. We compare our proposed algorithm to the earliest deadline one, the best scheduling scheme presented by Andrews, Kumaran, Ramanan, Stolyar and Whiting (see Bell Labs Technical Journal, 1999) for similar situations and conclude that we outperform it