Beyond proportional fair: designing robust wireless schedulers

Authors:
Soshant Bali;Sridhar Machiraju;Hui Zang
Affiliations:
University of Kansas;Sprint ATL;Sprint ATL
Venue:
NETWORKING'07 Proceedings of the 6th international IFIP-TC6 conference on Ad Hoc and sensor networks, wireless networks, next generation internet
Year:
2007

Citing 4
Cited 0

A measurement study of scheduler-based attacks in 3G wireless networks

PAM'07 Proceedings of the 8th international conference on Passive and active network measurement
Convergence of proportional-fair sharing algorithms under general conditions

IEEE Transactions on Wireless Communications
Opportunistic beamforming using dumb antennas

IEEE Transactions on Information Theory
CDMA/HDR: a bandwidth efficient high speed wireless data service for nomadic users

IEEE Communications Magazine

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.