Queueing networks with mobile servers: The mean-field approach


Cite item

Full Text

Open Access Open Access
Restricted Access Access granted
Restricted Access 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

Supplementary Files
Action
1. JATS XML

Copyright (c) 2016 Pleiades Publishing, Inc.