Research Article
The weighted proportional fair scheduler
@INPROCEEDINGS{10.1145/1185373.1185428, author={Kinda Khawam and Daniel Kofman and Eitan Altman}, title={The weighted proportional fair scheduler}, proceedings={3rd International ICST Conference on Quality of Service in Heterogeneous Wired/Wireless Networks}, publisher={ACM}, proceedings_a={QSHINE}, year={2006}, month={8}, keywords={}, doi={10.1145/1185373.1185428} }- Kinda Khawam
Daniel Kofman
Eitan Altman
Year: 2006
The weighted proportional fair scheduler
QSHINE
ACM
DOI: 10.1145/1185373.1185428
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.
