Start-time fair queueing: a scheduling algorithm for integrated services packet switching networks
IEEE/ACM Transactions on Networking (TON)
A unified architecture for the design and evaluation of wireless fair queueing algorithms
MobiCom '99 Proceedings of the 5th annual ACM/IEEE international conference on Mobile computing and networking
| Hi-index | 0.00 |
We present a novel approach to wireless fair scheduling in a distributed architecture. Our scheme is based on a simple extension of wireline fair scheduling by compensation for lost capacity after the losses occur. In addition, the scheduler can give limited compensation for unused capacity. This provides an incentive for users of the location-dependent wireless channel to optimize their channel usage on their own. In this way the scheduler does not need to be aware of the state of the wireless channel for each user. We present a mechanism for user behaviour and illustrate our scheme by simulation results.