Interference Queueing Networks on Grids
share
Consider a countably infinite collection of coupled queues representing a large wireless network with a queue at each point of the d-dimensional integer grid. These queues have independent Poisson arrivals, but are coupled through their service rates which is the signal to interference ratio of wireless network theory. More precisely, the service discipline is translation invariant and of the processor sharing type, with the service rate in each queue slowed down, when the neighboring queues have a larger workload. The dynamics is infinite dimensional Markov, with each queue having a non compact state space. It is neither reversible nor asymptotically product form, as in the mean-field setting. Coupling and percolation techniques are first used to show that this dynamics has well defined trajectories. Coupling from the past techniques of the Loynes' type are then proposed to build its minimal stationary regime. This regime is the one obtained when starting from the all empty initial condition in the distant past. The rate conservation principle of Palm calculus is then used to identify the stability condition of this system, namely the condition on the interference sequence and arrival rates guaranteeing the finiteness of this minimal regime. Remarkably, the rate conservation principle also provides a closed form expression for its mean queue size. When the stability condition holds, this minimal solution is the unique stationary regime, provided it has finite second moments, and this is the case if the arrival rate is small enough. In addition, there exists a range of small initial conditions for which the dynamics is attracted to the minimal regime. Surprisingly however, there exists another range of larger though finite initial conditions for which the dynamics diverges, even though stability criterion holds.
READ FULL TEXT