Thermodynamic Limit and Propagation of Chaos in Polling NetworksReport as inadecuate




Thermodynamic Limit and Propagation of Chaos in Polling Networks - Download this document for free, or read online. Document in PDF available to download.

1 MEVAL - Methods, algorithms and software in automatic control Inria Paris-Rocquencourt

Abstract : {${\P ,¸N\geq 1 }$ is a sequence of standard polling networks, consisting of $N$ nodes attended by $V $ 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} $. 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 $ is analyzed in {\em thermodynamic limit}, i.e when both $N$ and $V $ tend to infinity, with $U\egaldef\lim {N ightarrow\infty}V -N,\ 0

Keywords : MEAN-FIELD PROPAGATION OF CHAOS POLLING NETWORKS THERMODYNAMIC LIMIT PROPAGATION OF CHAOS. MARKOV PROCESS





Author: Franck Delcoigne - Guy Fayolle -

Source: https://hal.archives-ouvertes.fr/



DOWNLOAD PDF




Related documents