HOLPRO: a new rate scheduling algorithm for the downlink of CDMA networks

The rate scheduling problem for the downlink of CDMA networks with heterogeneous traffic inputs is considered. The users are carrying packets with different types of traffic (`voice/audio only´, or `data only´ or mixed traffic), each of which has its own distinct quality of service requirements. At each timeslot, a pseudo-probability is assigned to the head packet of each user, and then normalized by the packet length. The user with the maximum normalized pseudo-probability is served first and if there is power remaining in the system, the procedure is repeated with the next maximum normalized quantity, as long as power resources remain. The algorithm is compared to the “earliest deadline first”, the best scheduling scheme of Andrews et al. (see Bell Labs Technical Journal, 1999) for similar situations and to its modified version of PEDF of Varsou, Huang and Milaender (see Proceedings of WCNC 2000) and it is shown that it outperforms both