Queueing networks with mobile servers: The mean-field approach

François Baccelli 1 Aleksandr N. Rybko 2 Semen B. Shlosman 2, 3, 4
1 DYOGENE - Dynamics of Geometric Networks
DI-ENS - Département d'informatique de l'École normale supérieure, CNRS - Centre National de la Recherche Scientifique : UMR 8548, Inria de Paris
4 CPT - E5 Physique statistique et systèmes complexes
CPT - Centre de Physique Théorique - UMR 7332
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.
Type de document :
Article dans une revue
Problems of Information Transmission, MAIK Nauka/Interperiodica, 2016, 52 (2), pp.178 - 199. 〈10.1134/S0032946016020071〉
Liste complète des métadonnées

https://hal.inria.fr/hal-01394044
Contributeur : Bartlomiej Blaszczyszyn <>
Soumis le : mardi 8 novembre 2016 - 15:16:06
Dernière modification le : samedi 21 avril 2018 - 14:50:03

Identifiants

Collections

Citation

François Baccelli, Aleksandr N. Rybko, Semen B. Shlosman. Queueing networks with mobile servers: The mean-field approach. Problems of Information Transmission, MAIK Nauka/Interperiodica, 2016, 52 (2), pp.178 - 199. 〈10.1134/S0032946016020071〉. 〈hal-01394044〉

Partager

Métriques

Consultations de la notice

289