Induced idleness leads to deterministic heavy traffic limits for queue-based random-access algorithms
From MaRDI portal
Publication:2240840
DOI10.1214/20-AAP1609zbMath1479.60186arXiv1904.03980MaRDI QIDQ2240840
Laurent Miclo, Florian Simatos, Eyal Castiel, Sem C. Borst, Philip A. Whiting
Publication date: 4 November 2021
Published in: The Annals of Applied Probability (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1904.03980
Queueing theory (aspects of probability theory) (60K25) Interacting random processes; statistical mechanics type models; percolation theory (60K35)
Related Items (3)
Adding edge dynamics to bipartite random-access networks ⋮ Large deviations of mean-field interacting particle systems in a fast varying environment ⋮ On partially homogeneous nearest-neighbour random walks in the quarter plane and their application in the analysis of two-dimensional queues with limited state-dependency
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Lingering issues in distributed scheduling
- Serve the shortest queue and Walsh Brownian motion
- Diffusion limits for shortest remaining processing time queues under nonstandard spatial scaling
- Reflected Brownian motion on an orthant
- Percolation and the hard-core lattice gas model
- Large loss networks
- MaxWeight scheduling in a generalized switch: State space collapse and workload minimization in heavy traffic
- Polling systems with zero switchover times: A heavy-traffic averaging principle
- A multiclass closed queueing network with unconventional heavy traffic behavior
- Averaging over fast variables in the fluid limit for Markov chains: Application to the supermarket model with memory
- Randomized scheduling algorithm for queueing networks
- Towards a unifying theory on branching-type polling systems in heavy traffic
- The problem of uniqueness of a Gibbsian random field and the problem of phase transitions
- Logarithmic Sobolev inequalities for finite Markov chains
- Polling Systems in Heavy Traffic: A Bessel Process Limit
- An Open Queueing Network with Asymptotically Stable Fluid Model and Unconventional Heavy Traffic Behavior
- Queue-Based Random-Access Algorithms: Fluid Limits and Stability Issues
- Averaging Principles for a Diffusion-Scaled, Heavy-Traffic Polling Station with K Job Classes
- Open Queueing Networks in Heavy Traffic
- Some Inequalities for Reversible Markov Chains
- A Scaling Analysis of a Transient Stochastic Network
- A Fluid Limit for an Overloaded X Model via a Stochastic Averaging Principle
- Stability properties of constrained queueing systems and scheduling policies for maximum throughput in multihop radio networks
- HEAVY-TRAFFIC ANALYSIS OF K-LIMITED POLLING SYSTEMS
- Medium Access Using Queues
This page was built for publication: Induced idleness leads to deterministic heavy traffic limits for queue-based random-access algorithms
