# Dobrushin's Mean-Field Approximation for a Queue With Dynamic Routing

Abstract : A queueing system is considered, with a large number $N$ of identical infinite-buffer FCFS single-servers. The system is fed by a Poisson flow of rate $\l N$, with i.i.d. service times, under the non-overload condition. Each arriving task joins a server by selecting it from an independently (and `completely randomly') chosen collection of $m\ll N$ servers, on the basis of some fixed dynamic routing policy. We discuss various properties of such a system as $N\to\infty$. In particular, a natural limiting random process describing statistical properties of the system turns out to be deterministic.
Keywords :
Type de document :
Rapport
[Research Report] RR-3328, INRIA. 1997
Domaine :

https://hal.inria.fr/inria-00073361
Contributeur : Rapport de Recherche Inria <>
Soumis le : mercredi 24 mai 2006 - 12:37:12
Dernière modification le : mardi 17 avril 2018 - 11:25:29
Document(s) archivé(s) le : dimanche 4 avril 2010 - 21:52:00

### Identifiants

• HAL Id : inria-00073361, version 1

### Citation

Nikita D. Vvedenskaya, Yuri M. Suhov. Dobrushin's Mean-Field Approximation for a Queue With Dynamic Routing. [Research Report] RR-3328, INRIA. 1997. 〈inria-00073361〉

### Métriques

Consultations de la notice

## 158

Téléchargements de fichiers