
Stability and Metastability of Traffic Dynamics in Uplink Random Access Networks
We characterize the stability, metastability, and the stationary regime ...
read it

How wireless queues benefit from motion: an analysis of the continuum between zero and infinite mobility
This paper considers the time evolution of a queue that is embedded in a...
read it

Interference Queuing Networks on Grids
Motivated by applications in large scale wireless networks, we introduce...
read it

Stability conditions for a decentralised medium access algorithm: single and multihop networks
We consider a decentralised multiaccess algorithm, motivated primarily ...
read it

A Lower Bound on the stability region of Redundancyd with FIFO service discipline
Redundancyd (R(d)) is a load balancing method used to route incoming jo...
read it

Analysis of the Symmetric Join the Shortest Orbit Queue
This work introduces the join the shortest queue policy in the retrial s...
read it

Queueing Subject To ActionDependent Server Performance: Utilization Rate Reduction
We consider a discretetime system comprising a firstcomefirstserved ...
read it
Interference Queueing Networks on Grids
Consider a countably infinite collection of coupled queues representing a large wireless network with a queue at each point of the ddimensional 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 meanfield 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
Comments
There are no comments yet.