Occupancy Distribution of Queueing Systems with Opportunistic Scheduling in the Downlink

We consider a block-fading homogeneous broadcast channel with n users each receiving packets randomly and independently with a rate of lambda. Packets are stored in separate queues to await transmission using an opportunistic scheduling which exploits the multiuser diversity of the channel by serving the user with the most favorable channel condition at each coherence interval. In this paper, we consider a stochastic model in which mean packet transmission time is n-1 and establish a convergence result for the occupancy distribution of all n queues under opportunistic scheduling. It is shown that if lambda < 1 then the expected length of the longest queue is less than log1/lambda n + O(1) for large n. In order to improve the occupancy distribution while exploiting the multiuser diversity, we also study a scheme that serves the user with the longest queue among the d users with the most favorable channel conditions. It is shown that upper bound on the expected length of the longest queue improves to logd/lambda n + O(1). Simulation results are presented to validate our asymptotic results.

[1]  Babak Hassibi,et al.  A delay analysis for opportunistic transmission in fading broadcast channels , 2005, Proceedings IEEE 24th Annual Joint Conference of the IEEE Computer and Communications Societies..

[2]  S. Shakkottai,et al.  Pathwise optimality of the exponential scheduling rule for wireless channels , 2004, Advances in Applied Probability.

[3]  R. Srikant,et al.  Stable scheduling policies for fading wireless channels , 2005, IEEE/ACM Transactions on Networking.

[4]  Matthew Andrews,et al.  Providing quality of service over a shared wireless link , 2001, IEEE Commun. Mag..

[5]  Leandros Tassiulas,et al.  Dynamic server allocation to parallel queues with randomly varying connectivity , 1993, IEEE Trans. Inf. Theory.

[6]  S. Ethier,et al.  Markov Processes: Characterization and Convergence , 2005 .

[7]  Michael J. Neely,et al.  Optimal Energy and Delay Tradeoffs for Multiuser Wireless Downlinks , 2007, IEEE Transactions on Information Theory.

[8]  R. L. Dobrushin,et al.  Queueing system with selection of the shortest of two queues: an assymptotic approach , 1996 .

[9]  Anthony Ephremides,et al.  Delay Analysis of Interacting Queues with an Approximate Model , 1987, IEEE Trans. Commun..

[10]  Eli Upfal,et al.  Balanced allocations (extended abstract) , 1994, STOC '94.

[11]  Michael J. Neely,et al.  Optimal Energy and Delay Tradeoffs for Multi-User Wireless Downlinks , 2006, Proceedings IEEE INFOCOM 2006. 25TH IEEE International Conference on Computer Communications.

[12]  Michael J. Neely,et al.  Order Optimal Delay for Opportunistic Scheduling in Multi-User Wireless Uplinks and Downlinks , 2008, IEEE/ACM Transactions on Networking.

[13]  Randall Berry,et al.  Exploiting multiuser diversity for medium access control in wireless networks , 2003, IEEE INFOCOM 2003. Twenty-second Annual Joint Conference of the IEEE Computer and Communications Societies (IEEE Cat. No.03CH37428).

[14]  Edmund M. Yeh,et al.  Throughput and delay optimal resource allocation in multiaccess fading channels , 2003, IEEE International Symposium on Information Theory, 2003. Proceedings..