The stability of longest-queue-first scheduling with variable packet sizes

It is well known that the MaxWeight scheduling algorithm is throughput-optimal in wireless networks. However, its complexity is exponential in the number of links in an ad hoc network. In this work, we consider a greedy variant of the MaxWeight algorithm, called Longest Queue First (LQF). A synchronous version of LQF is known to be throughput-optimal under a topological condition called local pooling. Here we study an asynchronous version of LQF which is suitable for implementation in networks with variable packet sizes. We show that asynchronous LQF is also throughput-optimal under the local pooling condition.

[1]  J. Dai.  On Positive Harris Recurrence of Multiclass Queueing Networks: A Unified Approach Via Fluid Limit Models , 1995 .

[2]  Devavrat Shah,et al.  Randomized Scheduling Algorithm for Queueing Networks , 2009, ArXiv.

[3]  Kathryn Fraughnaugh,et al.  Introduction to graph theory , 1973, Mathematical Gazette.

[4]  Leandros Tassiulas,et al.  Stability properties of constrained queueing systems and scheduling policies for maximum throughput in multihop radio networks , 1992 .

[5]  Ness B. Shroff,et al.  Understanding the Capacity Region of the Greedy Maximal Scheduling Algorithm in Multihop Wireless Networks , 2008, IEEE/ACM Transactions on Networking.

[6]  D. Yao,et al.  Fundamentals of Queueing Networks: Performance, Asymptotics, and Optimization , 2001, IEEE Transactions on Automatic Control.

[7]  Maury Bramson,et al.  State space collapse with application to heavy traffic limits for multiclass queueing networks , 1998, Queueing Syst. Theory Appl..

[8]  Jean C. Walrand,et al.  A Distributed CSMA Algorithm for Throughput and Utility Maximization in Wireless Networks , 2010, IEEE/ACM Transactions on Networking.

[9]  Jian Ni,et al.  Q-CSMA: Queue-Length Based CSMA/CA Algorithms for Achieving Maximum Throughput and Low Delay in Wireless Networks , 2010, INFOCOM 2010.

[10]  Siva Theja Maguluri.  Optimal scheduling algorithms for ad hoc wireless networks , 2011 .

[11]  E. Modiano,et al.  Distributed Throughput Maximization in Wireless Mesh Networks via Pre-Partitioning , 2008, IEEE/ACM Transactions on Networking.

[12]  Soung Chang Liew,et al.  Back-of-the-Envelope Computation of Throughput Distributions in CSMA Wireless Networks , 2007, 2009 IEEE International Conference on Communications.

[13]  J. Dai,et al.  Asymptotic optimality of maximum pressure policies in stochastic processing networks. , 2008, 0901.2451.

[14]  Thomas Bonald,et al.  Rate optimal scheduling schemes for asynchronous input-queued packet switches , 2012, ACM SIGMETRICS 2012.

[15]  Ness B. Shroff,et al.  Understanding the capacity region of the Greedy maximal scheduling algorithm in multihop wireless networks , 2009, TNET.

[16]  Basil S. Maglaris,et al.  Throughput Analysis in Multihop CSMA Packet Radio Networks , 1987, IEEE Trans. Commun..

[17]  J. Walrand,et al.  Sufficient conditions for stability of longest-queue-first scheduling: second-order properties using fluid limits , 2006, Advances in Applied Probability.

[18]  Eytan Modiano,et al.  Enabling distributed throughput maximization in wireless mesh networks: a partitioning approach , 2006, MobiCom '06.

[19]  Jian Ni,et al.  Improved bounds on the throughput efficiency of greedy maximal scheduling in wireless networks , 2011, TNET.