Metastability of queuing networks with mobile servers

DOI10.1007/S10955-018-2023-ZzbMATH Open1403.60074arXiv1704.02521OpenAlexW3100530677WikidataQ98839657 ScholiaQ98839657MaRDI QIDQ1756563FDOQ1756563

A. N. Rybko, Francois Baccelli, Alexander Vladimirov, S. B. Shlosman

Publication date: 21 December 2018

Published in: Journal of Statistical Physics (Search for Journal in Brave)

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.

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

Recommendations

• Queueing networks with mobile servers: the mean-field approach
• Stochastic Transportation Networks and Stability of Dynamical Systems
• Queues in Series via Interacting Particle Systems
• Transience of multiclass queueing networks via fluid limit models
• Phase transitions in multiserver queuing systems

zbMATH Keywords

martingalemean-field limitrandom walks on graphsnon-linear Markov process

Mathematics Subject Classification ID

Queueing theory (aspects of probability theory) (60K25) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)

Cites Work

• Probability
• Stochastic networks with multiple stable points
• Wulff droplets and the metastable relaxation of kinetic Ising models
• The capacity of wireless networks
• Stochastic Geometry and Wireless Networks: Volume II Applications
• Spontaneous resonances and the coherent states of the queuing networks
• Title not available (Why is that?)
• Queueing networks with mobile servers: the mean-field approach

Cited In (6)

• Stochastic Transportation Networks and Stability of Dynamical Systems
• The Pair-Replica-Mean-Field Limit for Intensity-based Neural Networks
• Replica-Mean-Field Limits for Intensity-Based Neural Networks
• Locating a Mobile Server Queueing Facility on a Tree Network
• Asymptotic analysis of the elephant random walk
• Title not available (Why is that?)

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)