Interference Queueing Networks on Grids
Abishek Sankararaman, Fran\c{c}ois Baccelli, Sergey Foss

TL;DR
This paper studies an infinite grid of queues with spatially dependent service rates, establishing stability conditions, constructing stationary regimes, and analyzing the system's long-term behavior using advanced probabilistic techniques.
Contribution
It introduces a novel model of interacting queues on a grid with dependent service rates and develops methods to analyze its stability and stationary regimes.
Findings
Established well-defined trajectories for the system.
Derived a stability condition using Palm calculus.
Provided a closed-form expression for the mean queue size.
Abstract
Consider a countably infinite collection of interacting queues, with a queue located at each point of the -dimensional integer grid, having independent Poisson arrivals, but dependent service rates. The service discipline is of the processor sharing type,with the service rate in each queue slowed down, when the neighboring queues have a larger workload. The interactions are translation invariant in space and is neither of the Jackson Networks type, nor of the mean-field type. Coupling and percolation techniques are first used to show that this dynamics has well defined trajectories. Coupling from the past techniques are then proposed to build its minimal stationary regime. The rate conservation principle of Palm calculus is then used to identify the stability condition of this system, where the notion of stability is appropriately defined for an infinite dimensional process. We show…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
