Interference queueing networks on grids

DOI10.1214/19-AAP1470MaRDI QIDQ2286457zbMATH OpenOpenAlexFDO

Authors Abishek Sankararaman, Francois Baccelli, Sergey Foss

Publication date 22 January 2020

Published in The Annals of Applied Probability (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1710.09797

zbMATH Keywords

coupling from the pastinformation theoryinteracting queuesinterference fieldloynes' constructionmass transport theoremmonotonicityparticle systemspercolationpositive correlationqueueing theoryrate conservation principlestability and instabilitystationary distributionwireless network

Mathematics Subject Classification ID

Interacting random processes; statistical mechanics type models; percolation theory (60K35) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Communication networks in operations research (90B18)

Abstract: Consider a countably infinite collection of interacting queues, with a queue located at each point of the $d$-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 that the identified condition is also necessary in certain special cases and conjecture it to be true in all cases. Remarkably, the rate conservation principle also provides a closed form expression for the mean queue size. When the stability condition holds, this minimal solution is the unique translation invariant stationary regime. In addition, there exists a range of small initial conditions for which the dynamics is attracted to the minimal regime. Nevertheless, there exists another range of larger though finite initial conditions for which the dynamics diverges, even though stability criterion holds.

Recommendations

• Ergodicity and steady state analysis for interference queueing networks
• Stability of parallel queueing systems with coupled service rates
• The stability of open queueing networks
• Interacting queues in heavy traffic
• Queues in Series via Interacting Particle Systems

Cites work

• A Queueing System with Local Interaction
• Asymptotic results on infinite tandem queueing networks
• Balanced loads in infinite networks
• Bounds for clump size characteristics in the Boolean model
• Chaoticity on path space for a queueing network with selection of the shortest queue among several
• Communication networks. An optimization, control and stochastic networks perspective
• Completely analytical interactions: Constructive description
• Elements of Information Theory
• Empirical Processes with Applications to Statistics
• Ergodicity of a polling network with an infinite number of stations
• Gibbs measures and phase transitions.
• scientific article; zbMATH DE number 1460450 (Why is no real title available?)
• scientific article; zbMATH DE number 3322728 (Why is no real title available?)
• Interacting particle systems at Saint-Flour
• Large tandem queueing networks with blocking
• Mutual service processes in Euclidean spaces: existence and ergodicity
• On Jackson Networks on Denumerable Graphs
• On polling systems with infinitely many stations
• On the saturation rule for the stability of queues
• On transience conditions for Markov chains
• Poisson hail on a hot ground
• Power law condition for stability of Poisson hail
• Queueing system with selection of the shortest of two queues: An asymptotic approach
• Shape theorems for Poisson hail on a bivariate ground
• Spatial Birth–Death Wireless Networks
• Stability conditions for a discrete-time decentralised medium access algorithm
• Stochastic geometry and wireless networks. Volume I. Theory
• The existence of fixed points for the \(\cdot\)/GI/1 queue.
• The hydrodynamic limit of a randomized load balancing network
• The net output process of a system with infinitely many queues
• The power of slightly more than one sample in randomized load balancing
• Transience of multiclass queueing networks via fluid limit models

Cited in

(5)

• Stability conditions for a decentralised medium access algorithm: single- and multi-hop networks
• Stability and moment bounds under utility-maximising service allocations: finite and infinite networks
• Ergodicity and steady state analysis for interference queueing networks
• On Network Interference Management
• Interference calculus. A general framework for interference management and network utility optimization.

This page was built for publication: Interference queueing networks on grids

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2286457)