The weighted proportional fair scheduler

Kinda Khawam, Daniel Kofman, Eitan Altman

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

Abstract

To this day, traffic in cellular networks is still mainly real-time. However, with the deployment of new technologies, such as HDR (High Date Rate) and HSDPA (High Speed Downlink Packet Access), this situation is bound to evolve rapidly and elastic traffic will significantly increase. These novel technologies implement opportunistic scheduling, taking advantage of the delay-tolerance of elastic traffic, to augment the global capacity of the system. Previous work has shown that "Proportional Fair" (PF) is an opportunistic scheduler that provides a good compromise between fairness and efficiency. Nevertheless, the hypotheses according to which these results are obtained are not always valid in real environments. In this paper, we propose a modified version of PF that not only introduces flexibility in sharing resources between active users but also allows for a fair allocation of resources in realistic environments.

Original languageEnglish
Title of host publicationACM International Conference Proceeding Series - Proceedings of the 3rd International Conference on Quality of Service in Heterogeneous Wired/Wireless Networks
DOIs
Publication statusPublished - 1 Dec 2006
Event3rd International Conference on Quality of Service in Heterogeneous Wired/Wireless Networks - Waterloo, ON, Canada
Duration: 7 Aug 20068 Sept 2006

Publication series

NameACM International Conference Proceeding Series
Volume191

Conference

Conference3rd International Conference on Quality of Service in Heterogeneous Wired/Wireless Networks
Country/TerritoryCanada
CityWaterloo, ON
Period7/08/068/09/06

Fingerprint

Dive into the research topics of 'The weighted proportional fair scheduler'. Together they form a unique fingerprint.

Cite this