Effective bandwidths at multi-class queues
Queueing Systems: Theory and Applications
IEEE/ACM Transactions on Networking (TON)
Effective bandwidths for multiclass Markov fluids and other ATM sources
IEEE/ACM Transactions on Networking (TON)
Dynamic power allocation and routing for satellite and wireless networks with time varying channels
Dynamic power allocation and routing for satellite and wireless networks with time varying channels
Stable scheduling policies for fading wireless channels
IEEE/ACM Transactions on Networking (TON)
Large Deviations of Queues Sharing a Randomly Time-Varying Server
Queueing Systems: Theory and Applications
Order optimal delay for opportunistic scheduling in multi-user wireless uplinks and downlinks
IEEE/ACM Transactions on Networking (TON)
Stability and Asymptotic Optimality of Generalized MaxWeight Policies
SIAM Journal on Control and Optimization
Effective capacity: a wireless link model for support of quality of service
IEEE Transactions on Wireless Communications
A Large Deviations Analysis of Scheduling in Wireless Networks
IEEE Transactions on Information Theory
A tutorial on cross-layer optimization in wireless networks
IEEE Journal on Selected Areas in Communications
Effective bandwidth in high-speed digital networks
IEEE Journal on Selected Areas in Communications
Downlink scheduling for multiclass traffic in LTE
EURASIP Journal on Wireless Communications and Networking - 3GPP LTE and LTE Advanced
Allerton'09 Proceedings of the 47th annual Allerton conference on Communication, control, and computing
The impact of queue length information on buffer overflow in parallel queues
Allerton'09 Proceedings of the 47th annual Allerton conference on Communication, control, and computing
On scheduling for minimizing end-to-end buffer usage over multihop wireless networks
INFOCOM'10 Proceedings of the 29th conference on Information communications
Large Deviations of Max-Weight Scheduling Policies on Convex Rate Regions
Mathematics of Operations Research
On the queue-overflow probabilities of a class of distributed scheduling algorithms
Computer Networks: The International Journal of Computer and Telecommunications Networking
Delay-optimal opportunistic scheduling and approximations: the log rule
IEEE/ACM Transactions on Networking (TON)
Hi-index | 0.01 |
In this paper, we are interested in wireless scheduling algorithms for the downlink of a single cell that can minimize the queue-overflow probability. Specifically, in a large-deviation setting, we are interested in algorithms that maximize the asymptotic decay rate of the queue-overflow probability, as the queue-overflow threshold approaches infinity. We first derive an upper bound on the decay rate of the queue-overflow probability over all scheduling policies. We then focus on a class of scheduling algorithms collectively referred to as the "α-algorithms." For a given α ≥ 1, the α-algorithm picks the user for service at each time that has the largest product of the transmission rate multiplied by the backlog raised to the power α. We show that when the overflow metric is appropriately modified, the minimum-cost-to-overflow under the α-algorithm can be achieved by a simple linear path, and it can be written as the solution of a vector-optimization problem. Using this structural property, we then show that when α approaches infinity, the α-algorithms asymptotically achieve the largest decay rate of the queue-overflow probability. Finally, this result enables us to design scheduling algorithms that are both close to optimal in terms of the asymptotic decay rate of the overflow probability and empirically shown to maintain small queue-overflow probabilities over queue-length ranges of practical interest.