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

Authors:
Alexander L. Stolyar
Affiliations:
Bell Labs, Alcatel-Lucent, Murray Hill, USA 07974
Venue:
Queueing Systems: Theory and Applications
Year:
2011

Citing 3
Cited 2

Large Tandem Queueing Networks with Blocking

Queueing Systems: Theory and Applications
Maximum Pressure Policies in Stochastic Processing Networks

Operations Research
Maximizing Queueing Network Utility Subject to Stability: Greedy Primal-Dual Algorithm

Queueing Systems: Theory and Applications

A novel architecture for reduction of delay and queueing structure complexity in the back-pressure algorithm

IEEE/ACM Transactions on Networking (TON)
Throughput-optimal scheduling in multihop wireless networks without per-flow information

IEEE/ACM Transactions on Networking (TON)

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.