A framework for opportunistic scheduling in wireless networks
Computer Networks: The International Journal of Computer and Telecommunications Networking
SCHEDULING IN A QUEUING SYSTEM WITH ASYNCHRONOUSLY VARYING SERVICE RATES
Probability in the Engineering and Informational Sciences
Downlink scheduling for multiclass traffic in LTE
EURASIP Journal on Wireless Communications and Networking - 3GPP LTE and LTE Advanced
Instability of the proportional fair scheduling algorithm for HDR
IEEE Transactions on Wireless Communications
Opportunistic beamforming using dumb antennas
IEEE Transactions on Information Theory
Scheduling in multichannel wireless networks with flow-level dynamics
Proceedings of the ACM SIGMETRICS international conference on Measurement and modeling of computer systems
Throughput-optimal opportunistic scheduling in the presence of flow-level dynamics
IEEE/ACM Transactions on Networking (TON)
Stability with file arrivals and departures in multichannel cellular wireless networks
Queueing Systems: Theory and Applications
Inefficiency of MaxWeight scheduling in spatial wireless networks
Computer Communications
Delay-based back-pressure scheduling in multihop wireless networks
IEEE/ACM Transactions on Networking (TON)
Hi-index | 0.00 |
We consider a wireless downlink shared by a dynamic population of flows. The flows of random size (bits) arrive at the base station at random times, and leave when they have been completely transmitted. The transmission rate supported by the wireless channel of each flow while the flow awaits transmission varies randomly over time and is independent of that of the other flows. The scheduling problem in this context is to select a flow for transmission based on the current system state (e.g., backlogs, wait times, and channel states of the contending flows). It has recently been shown that for such a system, the well-known (backlog-driven) MaxWeight scheduler is not throughput optimal. That is to say, the MaxWeight scheduler will not stabilize a given system even though it is possible to construct a stabilizing scheduler using the various flow - and channel-related statistics. However, in this paper, we show that the delay-driven MaxWeight scheduler is, nevertheless, throughput optimal for such a system. The delay-driven MaxWeight, like its backlog-driven version, does not require any knowledge of the flow- or channel-related statistics.