Queueing networks with mobile servers: The mean-field approach
- 作者: Baccelli F.1, Rybko A.N.2, Shlosman S.B.3,2
-
隶属关系:
- Department of Mathematics
- Kharkevich Institute for Information Transmission Problems
- Aix Marseille Université
- 期: 卷 52, 编号 2 (2016)
- 页面: 178-199
- 栏目: The International Dobrushin Prize
- URL: https://journal-vniispk.ru/0032-9460/article/view/166291
- DOI: https://doi.org/10.1134/S0032946016020071
- ID: 166291
如何引用文章
详细
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.
作者简介
F. Baccelli
Department of Mathematics
编辑信件的主要联系方式.
Email: Baccelli@math.utexas.edu
美国, Austin
A. Rybko
Kharkevich Institute for Information Transmission Problems
Email: Baccelli@math.utexas.edu
俄罗斯联邦, Moscow
S. Shlosman
Aix Marseille Université; Kharkevich Institute for Information Transmission Problems
Email: Baccelli@math.utexas.edu
法国, Marseille; Moscow
补充文件
