Thermodynamic Limit and Propagation of Chaos in Polling Networks - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Reports (Research Report) Year : 1998

Thermodynamic Limit and Propagation of Chaos in Polling Networks

Abstract

{${\P\n,¸N\geq 1 }$ is a sequence of standard polling networks, consisting of $N$ nodes attended by $V\n$ mobile servers. When a server arrives at a node $i$, he serves one of the waiting customers, if any, and then moves to node $j$ with probability $p_{ij}\n$. Customers arrive according to a Poisson process. Service requirements and switch-over times between nodes are independent exponentially distributed random variables. The behavior of $\P\n$ is analyzed in {\em thermodynamic limit}, i.e when both $N$ and $V\n$ tend to infinity, with $U\egaldef\lim_{N\rightarrow\infty}V\n/N,\ 0
Fichier principal
Vignette du fichier
RR-3398.pdf (463.82 Ko) Télécharger le fichier

Dates and versions

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

Identifiers

  • HAL Id : inria-00073291 , version 1

Cite

Franck Delcoigne, Guy Fayolle. Thermodynamic Limit and Propagation of Chaos in Polling Networks. [Research Report] RR-3398, INRIA. 1998. ⟨inria-00073291⟩
64 View
58 Download

Share

Gmail Facebook Twitter LinkedIn More