Metastability of queuing networks with mobile servers
From MaRDI portal
(Redirected from Publication:1756563)
Abstract: We study symmetric queuing networks with moving servers and FIFO service discipline. The mean-field limit dynamics demonstrates unexpected behavior which we attribute to the meta-stability phenomenon. Large enough finite symmetric networks on regular graphs are proved to be transient for arbitrarily small inflow rates. However, the limiting non-linear Markov process possesses at least two stationary solutions. The proof of transience is based on martingale techniques.
Recommendations
Cites work
- Optimal throughput-delay scaling in wireless networks. I: The fluid model
- Probability. Theory and examples.
- Queueing networks with mobile servers: the mean-field approach
- Spontaneous resonances and the coherent states of the queuing networks
- Stochastic geometry and wireless networks. Volume II. Applications
- Stochastic networks with multiple stable points
- The capacity of wireless networks
- Wulff droplets and the metastable relaxation of kinetic Ising models
Cited in
(8)- Queueing networks with mobile servers: the mean-field approach
- Locating a Mobile Server Queueing Facility on a Tree Network
- Stochastic Transportation Networks and Stability of Dynamical Systems
- scientific article; zbMATH DE number 3997523 (Why is no real title available?)
- The pair-replica-mean-field limit for intensity-based neural networks
- Replica-mean-field limits for intensity-based neural networks
- Asymptotic analysis of the elephant random walk
- Replica mean field limits for neural networks with excitatory and inhibitory activity
This page was built for publication: Metastability of queuing networks with mobile servers
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1756563)