On Polling Systems where Servers wait for Customers - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Reports (Research Report) Year : 1996

On Polling Systems where Servers wait for Customers


In this paper, a particular polling system with $N$ queues and $V$ servers is analyzed. Whenever a server visits an empty queue, it waits for the next customer to come to this queue. A customer chooses his destination according to a routing matrix $P$. The model originates from specific problems arising in transportation networks. A global classification of the process describing the system is given under general assumptions. It is shown that this process can only be {\em transient} or {\em null recurrent}. In addition, a detailed classification of each node, together with limit laws (after proper time-scaling) are obtained. The method of analysis rel= ies on the central limit theorem and a coupling with a reference system in which transportation times are identically zero.


Other [cs.OH]
Fichier principal
Vignette du fichier
RR-3058.pdf (266.89 Ko) Télécharger le fichier

Dates and versions

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


  • HAL Id : inria-00073634 , version 1


Larissa G. Afanassieva, Franck Delcoigne, Guy Fayolle. On Polling Systems where Servers wait for Customers. [Research Report] RR-3058, INRIA. 1996. ⟨inria-00073634⟩
138 View
89 Download


Gmail Facebook Twitter LinkedIn More