Queueing networks with mobile servers: The mean-field approach |
| |
| Authors: | F Baccelli A N Rybko S B Shlosman |
| |
| Affiliation: | 1.Department of Mathematics,University of Texas at Austin,Austin,USA;2.Kharkevich Institute for Information Transmission Problems,Russian Academy of Sciences,Moscow,Russia;3.Aix Marseille Université,Université de Toulon, CNRS, CPT,Marseille,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. |
| |
| Keywords: | |
| 本文献已被 SpringerLink 等数据库收录！ |
|
