User-level performance of channel-aware scheduling algorithms in wireless data networks

Research output: Chapter in Book/Report/Conference proceedingConference contributionAcademicpeer-review

262 Citations (Scopus)
1 Downloads (Pure)


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 multiclass 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.
Original languageEnglish
Title of host publicationProceedings of the twenty-second annual joint conference of the IEEE computer and communications IEEE societies (INFOCOM 2003), 30 March - 3 April 2003 San Francisco CA, USA
Place of PublicationPiscataway NJ
PublisherIEEE Computer Society
Publication statusPublished - 2003


Dive into the research topics of 'User-level performance of channel-aware scheduling algorithms in wireless data networks'. Together they form a unique fingerprint.

Cite this