Open AccessGeneralised proportional fairness scheduler for broadband orthogonal frequency‐division multiple access systems with heterogeneous traffics
Author(s) -
Kuo YawWen,
Hsueh NaiWei
Publication year - 2013
Publication title -
iet communications
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.355
H-Index - 62
eISSN - 1751-8636
pISSN - 1751-8628
DOI - 10.1049/iet-com.2012.0156
Subject(s) - computer science , idle , fairness measure , computer network , broadband , throughput , scheduling (production processes) , proportionally fair , orthogonal frequency division multiple access , channel (broadcasting) , quality of service , telecommunications , mathematical optimization , dynamic priority scheduling , wireless , orthogonal frequency division multiplexing , round robin scheduling , mathematics , operating system
The popular proportional fairness (PF) scheduler is very suitable for achieving a trade‐off between system throughput and fairness, but the authors observed two issues while applying it to broadband networks with heterogeneous traffics. As the PF scheduler only considers average throughput and channel quality, it favours users with low‐data rates. In addition, the credits of idle users accumulate because their average throughputs decrease with time during their idle periods. This study proposes a generalised PF scheduler that considers profit instead of average throughput, and it integrates a new mechanism for updating the utility functions to mitigate the issue of credit accumulation. Simulation results show that the proposed PF scheduler outperforms the traditional algorithms in terms of fairness and transient behaviour.