Email this article Queueing networks with mobile servers: The mean-field approach
- Authors: Baccelli F.1, Rybko A.N.2, Shlosman S.B.3,2
-
Affiliations:
- Department of Mathematics
- Kharkevich Institute for Information Transmission Problems
- Aix Marseille Université
- Issue: Vol 52, No 2 (2016)
- Pages: 178-199
- Section: The International Dobrushin Prize
- URL: https://journal-vniispk.ru/0032-9460/article/view/166291
- DOI: https://doi.org/10.1134/S0032946016020071
- ID: 166291
Cite item
Open Access
Access granted
Subscription Access
Abstract
We consider queueing networks which are made from servers exchanging their positions on a graph. When two servers exchange their positions, they take their customers with them. Each customer has a fixed destination. Customers use the network to reach their destinations, which is complicated by movements of the servers. We develop the general theory of such networks and establish the convergence of the symmetrized version of such a network to some nonlinear Markov process.
About the authors
F. Baccelli
Department of Mathematics
Author for correspondence.
Email: Baccelli@math.utexas.edu
United States, Austin
A. N. Rybko
Kharkevich Institute for Information Transmission Problems
Email: Baccelli@math.utexas.edu
Russian Federation, Moscow
S. B. Shlosman
Aix Marseille Université; Kharkevich Institute for Information Transmission Problems
Email: Baccelli@math.utexas.edu
France, Marseille; Moscow
Supplementary files
