SCHEDULING IN A QUEUING SYSTEM WITH ASYNCHRONOUSLY VARYING SERVICE RATES
Probability in the Engineering and Informational Sciences
Opportunistic beamforming using dumb antennas
IEEE Transactions on Information Theory
A Large Deviations Analysis of Scheduling in Wireless Networks
IEEE Transactions on Information Theory
CDMA/HDR: a bandwidth efficient high speed wireless data service for nomadic users
IEEE Communications Magazine
Providing quality of service over a shared wireless link
IEEE Communications Magazine
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
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
Qualitative properties of α-weighted scheduling policies
Proceedings of the ACM SIGMETRICS international conference on Measurement and modeling of computer systems
Low-complexity scheduling algorithms for multi-channel downlink wireless networks
INFOCOM'10 Proceedings of the 29th conference on Information communications
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 sum-queue optimality of a radial sum-rate monotone opportunistic scheduler
IEEE Transactions on Information Theory
On the queue-overflow probabilities of a class of distributed scheduling algorithms
Computer Networks: The International Journal of Computer and Telecommunications Networking
On wireless scheduling algorithms for minimizing the queue-overflow probability
IEEE/ACM Transactions on Networking (TON)
Delay-optimal opportunistic scheduling and approximations: the log rule
IEEE/ACM Transactions on Networking (TON)
Optimal queue-size scaling in switched networks
Proceedings of the 12th ACM SIGMETRICS/PERFORMANCE joint international conference on Measurement and Modeling of Computer Systems
Optimal control of wireless networks with finite buffers
IEEE/ACM Transactions on Networking (TON)
Low-complexity scheduling algorithms for multichannel downlink wireless networks
IEEE/ACM Transactions on Networking (TON)
| Hi-index | 0.06 |
We consider a discrete-time model where multiple queues, each with its own exogenous arrival process, are served by a server whose capacity varies randomly and asynchronously with respect to different queues. This model is primarily motivated by the problem of efficient scheduling of transmissions of multiple data flows sharing a wireless channel.We address the following problem of controlling large deviations of the queues: find a scheduling rule, which is optimal in the sense of maximizing 0.1 $$\min_{i}\biggl[\lim_{n\to\infty}\frac{-1}{n}\log P(a_{i}Q_{i}n)\biggr],$$ where Q i is the length of the i-th queue in a stationary regime, and a i 0 are parameters. Thus, we seek to maximize the minimum of the exponential decay rates of the tails of distributions of weighted queue lengths a i Q i . We give a characterization of the upper bound on (0.1) under any scheduling rule, and of the lower bound on (0.1) under the exponential (EXP) rule. We prove that the two bounds match, thus proving optimality of the EXP rule. The EXP rule is very parsimonious in that it does not require any "pre-computation" of its parameters, and uses only current state of the queues and of the server.The EXP rule is not invariant with respect to scaling of the queues, which complicates its analysis in the large deviations regime. To overcome this, we introduce and prove a refined sample path large deviations principle, or refined Mogulskii theorem, which is of independent interest.