Class and channel condition based weighted proportional fair scheduler
Teletraffic Engineering in the Internet EraProceedings of the International Teletraffic Congress - ITC-I7, volume 4 of Teletraffic Science and Engineering, Elsevier, (2001)DOI: http://dx.doi.org/10.1016/S1388-3437(01)80151-7
Abstract
In this paper we outline a scheme to perform packet-level scheduling and resource allocation at the wireless node that takes into account the notions of both efficiency and fairness and presents a means to explore the trade-off between these two notions. As a part of this scheme we see the scheduling problem as deciding not just the packet transmission schedule but also the power allocation, the modulation and coding scheme allocation and the spreading code determination since the latter three directly influence the radio resources consumed. Using a utility maximization formulation based on the data-rates that the mobiles can transmit at, we decide on the weights for a weighted proportionally fair allocation based scheduling algorithm. We conclude with a simulation based performance analysis for infinitely-backlogged sources on a \UMTS\ system.