Proportional Fair (PF), a frequently used scheduling algorithm in 3G wireless networks, can unnecessarily starve "well-behaved" users in practice. One of the main causes behind PF-induced starvation is its inability to distinguish between users who are backlogged and users who are not. In this paper, we describe how a simple parallel PF instance can mitigate such starvation. © IFIP International Federation for Information Processing 2007.
CITATION STYLE
Bali, S., Machiraju, S., & Zang, H. (2007). Beyond proportional fair: Designing robust wireless schedulers. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4479 LNCS, pp. 1157–1160). Springer Verlag. https://doi.org/10.1007/978-3-540-72606-7_103
Mendeley helps you to discover research relevant for your work.