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 metastability 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.
CITATION STYLE
Baccelli, F., Rybko, A., Shlosman, S., & Vladimirov, A. (2018). Metastability of Queuing Networks with Mobile Servers. Journal of Statistical Physics, 173(3–4), 1227–1251. https://doi.org/10.1007/s10955-018-2023-z
Mendeley helps you to discover research relevant for your work.