Dobrushin's Mean-Field Approximation for a Queue With Dynamic Routing - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Reports (Research Report) Year : 1997

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.
Fichier principal
Vignette du fichier
RR-3328.pdf (390.79 Ko) Télécharger le fichier

Dates and versions

inria-00073361 , version 1 (24-05-2006)

Identifiers

  • HAL Id : inria-00073361 , version 1

Cite

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⟩
139 View
337 Download

Share

Gmail Facebook Twitter LinkedIn More