DMCA
Fair Scheduling in Wireless Packet Networks (1997)
Cached
Download Links
- [timely.crhc.uiuc.edu]
- [tesla.csl.uiuc.edu]
- DBLP
Other Repositories/Bibliography
| Venue: | IEEE/ACM Transactions on Networking |
| Citations: | 338 - 21 self |
BibTeX
@ARTICLE{Lu97fairscheduling,
author = {Songwu Lu and Vaduvur Bharghavan and Rayadurgam Srikant},
title = {Fair Scheduling in Wireless Packet Networks},
journal = {IEEE/ACM Transactions on Networking},
year = {1997},
volume = {7},
pages = {473--489}
}
Share
 |
 |
 |
 |
||
OpenURL
Abstract
Fair scheduling of delay and rate-sensitive packet flows over a wireless channel is not addressed effectively by most contemporary wireline fair scheduling algorithms because of two unique characteristics of wireless media: (a) bursty channel errors, and (b) location-dependent channel capacity and errors. Besides, in packet cellular networks, the base station typically performs the task of packet scheduling for both downlink and uplink flows in a cell; however a base station has only a limited knowledge of the arrival processes of uplink flows. In this paper, we propose a new model for wireless fair scheduling based on an adaptation of fluid fair queueing to handle location-dependent error bursts. We describe an ideal wireless fair scheduling algorithm which provides a packetized implementation of the fluid model while assuming full knowledge of the current channel conditions. For this algorithm, we derive the worst-case throughput and delay bounds. Finally, we describe a practical wir...
Keyphrases
fair scheduling wireless packet network base station uplink flow unique characteristic packet cellular network packet scheduling fluid model rate-sensitive packet full knowledge ideal wireless current channel condition wireless medium delay bound worst-case throughput practical wir location-dependent channel capacity limited knowledge bursty channel error arrival process new model packetized implementation wireless channel contemporary wireline fair location-dependent error burst
