On power-of-choice in downlink transmission scheduling

A low-complexity guiding principle is considered for transmission scheduling from n homogeneous queues whose channel states fluctuate independently. The scheduler transmits from a longest queue within d randomly chosen queues with eligible channel states. A Markovian model is studied where mean packet transmission time is n-1 and packet arrival rate is lambda < 1 per queue. Equilibrium distribution of queue occupancy is obtained in the limit as n rarr infin and it is shown to have tails that decay as Theta((lambda/d)k). If transmissions are scheduled from a longest eligible queue in the entire system then almost all queues are empty in equilibrium; the number of queues with one packet is Theta(1) and the number of queues with more than one packet is o(1) as n rarr infin. Equilibrium distribution of the total number of packets in the system is also characterized in this latter case.

[1]  Eytan Modiano,et al.  Optimal Transmission Scheduling in Symmetric Communication Models With Intermittent Connectivity , 2007, IEEE Transactions on Information Theory.

[2]  Thomas G. Kurtz,et al.  Averaging for martingale problems and stochastic approximation , 1992 .

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

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

[5]  Murat Alanyali.  Three management policies for a resource with partition constraints , 1999, Advances in Applied Probability.

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

[7]  Stan Zachary,et al.  A Refinement of the Hunt-Kurtz Theory of Large Loss Networks, with an Application to Virtual Partitioning , 2002 .

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

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

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

[11]  Murat Alanyali.  Asymptotically exact analysis of a loss network with channel continuity , 2003 .

[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]  T. Kurtz,et al.  Large loss networks , 1994 .

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