A stochastic network with mobile users in heavy traffic

DOI10.1007/s11134-012-9330-xzbMath1279.60120arXiv1202.2881OpenAlexW3101755210MaRDI QIDQ352980

Florian Simatos, Sem C. Borst

Publication date: 5 July 2013

Published in: Queueing Systems (Search for Journal in Brave)

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

zbMATH Keywords

heavy trafficstochastic network with mobility

Mathematics Subject Classification ID

Queueing theory (aspects of probability theory) (60K25) Functional limit theorems; invariance principles (60F17) Continuous-time Markov processes on discrete state spaces (60J27)

Related Items

Adding edge dynamics to bipartite random-access networks ⋮ Mobility can drastically improve the heavy traffic performance from \(\frac{1}{1-\varrho}\) to \(\log(1/(1-\varrho))\) ⋮ The weak convergence of regenerative processes using some excursion path decompositions

Cites Work

• Scaling limits via excursion theory: interplay between Crump-Mode-Jagers branching processes and processor-sharing queues
• Criteria for the recurrence or transience of stochastic process. I
• Diffusion approximations for open multiclass queueing networks: Sufficient conditions involving state space collapse
• State space collapse with application to heavy traffic limits for multiclass queueing networks
• MaxWeight scheduling in a generalized switch: State space collapse and workload minimization in heavy traffic
• Sojourn time asymptotics in the \(M/G/1\) processor sharing queue
• Spatial homogenization in a stochastic network with mobility
• The weak convergence of regenerative processes using some excursion path decompositions
• Stochastic-Process Limits
• On the Transient Behavior of Ehrenfest and Engset Processes
• Heavy-Traffic Analysis of a Multiple-Phase Network with Discriminatory Processor Sharing
• On a heavy traffic limit theorem for the M/G/1 processor-sharing queue
• An approximation for the sojourn-time distribution for the gi/g/1 processor-sharing queue
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: A stochastic network with mobile users in heavy traffic