Introducing delay sensitivity into the proportional fair algorithm for CDMA downlink scheduling

The paper is concerned with CDMA base stations needing forward link scheduling algorithms that not only maximize total throughput given certain constraints regarding fairness, but that also take into account the special delay requirements of real time data. We show that the proportional fair algorithm, which was originally designed to maintain fairness while still exploiting channel variations in a fading environment, can be modified in a simple manner so as to ensure the successful delivery of real time data without giving up the gains due to channel diversity.