Queueing networks with mobile servers: The mean-field approach


如何引用文章

全文:

开放存取 开放存取
受限制的访问 ##reader.subscriptionAccessGranted##
受限制的访问 订阅存取

详细

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

补充文件

附件文件
动作
1. JATS XML

版权所有 © Pleiades Publishing, Inc., 2016