Queueing networks with mobile servers: The mean-field approach

F. Baccelli, A. N. Rybko, S. B. Shlosman

Research output: Contribution to journalArticlepeer-review

5 Citations (Scopus)


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.

Original languageEnglish
Pages (from-to)178-199
Number of pages22
JournalProblems of information transmission
Issue number2
Publication statusPublished - 1 Apr 2016
Externally publishedYes


Dive into the research topics of 'Queueing networks with mobile servers: The mean-field approach'. Together they form a unique fingerprint.

Cite this