Large number of queues in tandem: Scaling properties under back-pressure algorithm

We consider a system with N unit-service-rate queues in tandem, with exogenous arrivals of rate λ at queue 1, under a back-pressure (MaxWeight) algorithm: service at queue n is blocked unless its queue length is greater than that of the next queue n+1. The question addressed is how steady-state queues scale as N→∞. We show that the answer depends on whether λ is below or above the critical value 1/4: in the former case the queues remain uniformly stochastically bounded, while otherwise they grow to infinity.The problem is essentially reduced to the behavior of the system with an infinite number of queues in tandem, which is studied using tools from interacting particle systems theory. In particular, the criticality of load 1/4 is closely related to the fact that this is the maximum possible flux (flow rate) of a stationary totally asymmetric simple exclusion process.

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

[2]  Stefan Grosskinsky Warwick,et al.  Interacting Particle Systems , 2016 .

[3]  P. Glynn,et al.  Logarithmic asymptotics for steady-state tail probabilities in a single-server queue , 1994, Journal of Applied Probability.

[4]  Alexander L. Stolyar,et al.  Maximizing Queueing Network Utility Subject to Stability: Greedy Primal-Dual Algorithm , 2005, Queueing Syst. Theory Appl..

[5]  R. M. Loynes,et al.  The stability of a queue with non-independent inter-arrival and service times , 1962, Mathematical Proceedings of the Cambridge Philosophical Society.

[6]  J. G. Dai,et al.  Maximum Pressure Policies in Stochastic Processing Networks , 2005, Oper. Res..

[7]  R. Bass,et al.  Review: P. Billingsley, Convergence of probability measures , 1971 .

[8]  T. Liggett,et al.  Stochastic Interacting Systems: Contact, Voter and Exclusion Processes , 1999 .

[9]  Loc Bui,et al.  Optimal resource allocation for multicast sessions in multi-hop wireless networks , 2008, Philosophical Transactions of the Royal Society A: Mathematical, Physical and Engineering Sciences.

[10]  Alexander L. Stolyar,et al.  Optimal resource allocation for multicast flows in multihop wireless networks , 2007, 2007 46th IEEE Conference on Decision and Control.

[11]  Alexander L. Stolyar,et al.  Novel Architectures and Algorithms for Delay Reduction in Back-Pressure Scheduling and Routing , 2009, IEEE INFOCOM 2009.

[12]  James B. Martin.  Large Tandem Queueing Networks with Blocking , 2002, Queueing Syst. Theory Appl..

[13]  T. Liggett.  Ergodic theorems for the asymmetric simple exclusion process , 1975 .

[14]  Nick Duffield,et al.  Large deviations and overflow probabilities for the general single-server queue, with applications , 1995 .