Channel-aware scheduling strategies, such as the Proportional Fair algorithm for the CDMA 1xEV-DO system, provide an effective mechanism for improving throughput performance in wireless data networks by exploiting channel fluctuations. The performance of channel-aware scheduling algorithms has mostly been explored at the packet level for a static user population, often assuming infinite backlogs. In the present paper, we focus on the performance at the flow level in a dynamic setting with random finite-size service demands. We show that in certain cases the user-level performance may be evaluated by means of a multi-class Processor-Sharing model where the total service rate varies with the total number of users. The latter model provides explicit formulas for the distribution of the number of active users of the various classes, the mean response times, the blocking probabilities, and the mean throughput. In addition we show that, in the presence of channel variations, greedy, myopic strategies which maximize throughput in a static scenario, may result in sub-optimal throughput performance for a dynamic user configuration and cause potential instability effects.

Queueing theory (msc 60K25), Performance evaluation; queueing; scheduling (msc 68M20)
Logistics (theme 3), Energy (theme 4)
CWI
CWI. Probability, Networks and Algorithms [PNA]
Stochastics

Borst, S.C. (2002). User-level performance of channel-aware scheduling algorithms in wireless data networks. CWI. Probability, Networks and Algorithms [PNA]. CWI.