Skip to Main content Skip to Navigation

On Polling Systems where Servers wait for Customers

Abstract : 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.
Document type :
Complete list of metadata

Cited literature [1 references]  Display  Hide  Download
Contributor : Rapport de Recherche Inria <>
Submitted on : Wednesday, May 24, 2006 - 1:23:06 PM
Last modification on : Friday, May 25, 2018 - 12:02:05 PM
Long-term archiving on: : Sunday, April 4, 2010 - 11:52:42 PM


  • 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⟩



Record views


Files downloads