Large Deviations of Queues Sharing a Randomly Time-Varying Server
Queueing Systems: Theory and Applications
Proceedings of the tenth ACM international symposium on Mobile ad hoc networking and computing
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
Importance Sampling for Weighted-Serve-the-Longest-Queue
Mathematics of Operations Research
QoS-driven network coded wireless multicast
IEEE Transactions on Wireless Communications
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
Delay analysis for wireless networks with single hop traffic and general interference constraints
IEEE/ACM Transactions on Networking (TON)
Joint scheduling and resource allocation in CDMA systems
IEEE Transactions on Information Theory
Queuing analysis in multichannel cognitive spectrum access: a large deviation approach
INFOCOM'10 Proceedings of the 29th conference on Information communications
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
Analysis of the tradeoff between delay and source rate in multiuser wireless systems
EURASIP Journal on Wireless Communications and Networking - Special issue on adaptive cross-layer strategies for fourth generation wireless communications
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 analysis and optimality of scheduling policies for multihop wireless networks
IEEE/ACM Transactions on Networking (TON)
Low-complexity scheduling algorithms for multichannel downlink wireless networks
IEEE/ACM Transactions on Networking (TON)
| Hi-index | 754.90 |
In this correspondence, we consider a cellular network consisting of a base station and N receivers. The channel states of the receivers are assumed to be identical and independent of each other. The goal is to compare the throughput of two different scheduling policies (a queue-length-based (QLB) policy and a greedy policy) given an upper bound on the queue overflow probability or the delay violation probability. We consider a multistate channel model, where each channel is assumed to be in one of L states. Given an upper bound on the queue overflow probability or an upper bound on the delay violation probability, we show that the total network throughput of the (QLB) policy is no less than the throughput of the greedy policy for all N. We also obtain a lower bound on the throughput of the (QLB) policy. For sufficiently large N, the lower bound is shown to be tight, strictly increasing with N, and strictly larger than the throughput of the greedy policy. Further, for a simple multistate channel model-ON-OFF channel, we prove that the lower bound is tight for all N