|
Problemy Peredachi Informatsii, 2016, Volume 52, Issue 2, Pages 86–110
(Mi ppi2207)
|
|
|
|
This article is cited in 5 scientific papers (total in 5 papers)
The International Dobrushin Prize
Queueing networks with mobile servers: the mean-field approach
F. Baccellia, A. N. Rybkob, S. B. Shlosmanbcd a Department of Mathematics, University of Texas at Austin, Austin, USA
b Kharkevich Institute for Information Transmission Problems,
Russian Academy of Sciences, Moscow, Russia
c Le Centre de Physique Théorique, Aix-Marseille Université, Marseille, France
d Université de Toulon, La Garde, France
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.
Received: 17.08.2015 Revised: 12.01.2016
Citation:
F. Baccelli, A. N. Rybko, S. B. Shlosman, “Queueing networks with mobile servers: the mean-field approach”, Probl. Peredachi Inf., 52:2 (2016), 86–110; Problems Inform. Transmission, 52:2 (2016), 178–199
Linking options:
https://www.mathnet.ru/eng/ppi2207 https://www.mathnet.ru/eng/ppi/v52/i2/p86
|
Statistics & downloads: |
Abstract page: | 357 | Full-text PDF : | 58 | References: | 37 | First page: | 19 |
|