Mathematics – Probability
Scientific paper
2007-02-09
Annals of Applied Probability 2006, Vol. 16, No. 4, 1816-1850
Mathematics
Probability
Published at http://dx.doi.org/10.1214/105051606000000376 in the Annals of Applied Probability (http://www.imstat.org/aap/) by
Scientific paper
10.1214/105051606000000376
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.
MacPhee Iain M.
Menshikov Mikhail V.
Popov Sergei
Volkov Sergey
No associations
LandOfFree
Periodicity in the transient regime of exhaustive polling systems does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Periodicity in the transient regime of exhaustive polling systems, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Periodicity in the transient regime of exhaustive polling systems will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-8341