The Annals of Applied Probability
- Ann. Appl. Probab.
- Volume 16, Number 4 (2006), 1816-1850.
Periodicity in the transient regime of exhaustive polling systems
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.
Ann. Appl. Probab., Volume 16, Number 4 (2006), 1816-1850.
First available in Project Euclid: 17 January 2007
Permanent link to this document
Digital Object Identifier
Mathematical Reviews number (MathSciNet)
Zentralblatt MATH identifier
MacPhee, I. M.; Menshikov, M. V.; Popov, S.; Volkov, S. Periodicity in the transient regime of exhaustive polling systems. Ann. Appl. Probab. 16 (2006), no. 4, 1816--1850. doi:10.1214/105051606000000376. https://projecteuclid.org/euclid.aoap/1169065209