Order optimal delay for opportunistic scheduling in multi-user wireless uplinks and downlinks
IEEE/ACM Transactions on Networking (TON)
Scheduling in multi-channel wireless networks: rate function optimality in the small-buffer regime
Proceedings of the eleventh international joint conference on Measurement and modeling of computer systems
Delay-optimal server allocation in multiqueue multiserver systems with time-varying connectivities
IEEE Transactions on Information Theory
Optimality of myopic sensing in multichannel opportunistic access
IEEE Transactions on Information Theory
The rate region of a cooperative scheduling system
IEEE Transactions on Wireless Communications
Optimal resource scheduling in wireless multiservice systems with random channel connectivity
GLOBECOM'09 Proceedings of the 28th IEEE conference on Global telecommunications
Optimal scheduling in high-speed downlink packet access networks
ACM Transactions on Modeling and Computer Simulation (TOMACS)
Optimal scheduling in multi-server queues with random connectivity and retransmissions
Computer Communications
Max-Weight Scheduling in Queueing Networks With Heavy-Tailed Traffic
IEEE/ACM Transactions on Networking (TON)
Hi-index | 754.96 |
We consider a slotted system with N queues, and independent and identically distributed (i.i.d.) Bernoulli arrivals at each queue during each slot. Each queue is associated with a channel that changes between "on" and "off" states according to i.i.d. Bernoulli processes. We assume that the system has K identical transmitters ("servers"). Each server, during each slot, can transmit up to C packets from each queue associated with an "on" channel. We show that a policy that assigns the servers to the longest queues whose channel is "on" minimizes the total queue size, as well as a broad class of other performance criteria. We provide several extensions, as well as some qualitative results for the limiting case where N is very large. Finally, we consider a "fluid" model under which fractional packets can be served, and subject to a constraint that at most C packets can be served in total from all of the N queues. We show that when K=N, there is an optimal policy which serves the queues so that the resulting vector of queue lengths is "Most Balanced" (MB)