We use cookies to ensure that we give you the best experience on our website. By continuing to browse this repository, you give consent for essential cookies to be used. You can read more about our Privacy and Cookie Policy.

Durham Research Online
You are in:

Periodicity in the transient regime of exhaustive polling systems.

MacPhee, I. M. and Menshikov, M. V. and Popov, S. and Volkov, S. (2006) 'Periodicity in the transient regime of exhaustive polling systems.', Annals of applied probability., 16 (4). pp. 1816-1850.


We consider an exhaustive polling system with three nodes in its transient regime under a switching rule of generalized greedy type. We show that, for the system with Poisson arrivals and service times with finite second moment, the sequence of nodes visited by the server is eventually periodic almost surely. To do this, we construct a dynamical system, the triangle process, which we show has eventually periodic trajectories for almost all sets of parameters and in this case we show that the stochastic trajectories follow the deterministic ones a.s. We also show there are infinitely many sets of parameters where the triangle process has aperiodic trajectories and in such cases trajectories of the stochastic model are aperiodic with positive probability.

Item Type:Article
Keywords:Polling systems, Greedy algorithm, Transience, Random walk, Dynamical system, Interval exchange transformation, a.s. convergence.
Full text:(VoR) Version of Record
Download PDF
Publisher Web site:
Date accepted:No date available
Date deposited:17 May 2010
Date of first online publication:01 January 1970
Date first made open access:No date available

Save or Share this output

Look up in GoogleScholar