Periodicity in the transient regime of exhaustive polling systems

Simple item page
dc.creatorMacPhee, I. M.
dc.creatorMenshikov, M. V.
dc.creatorPopov, S.
dc.creatorVolkov, S.
dc.date2007-02-09
dc.date.accessioned2026-07-07T07:45:47Z
dc.date.available2026-07-07T07:45:47Z
dc.descriptionWe 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.
dc.descriptionPublished at http://dx.doi.org/10.1214/105051606000000376 in the Annals of Applied Probability (http://www.imstat.org/aap/) by the Institute of Mathematical Statistics (http://www.imstat.org)
dc.identifierhttps://arxiv.org/abs/math/0702252
dc.identifierhttp://arxiv.org/abs/math/0702252
dc.identifierAnnals of Applied Probability 2006, Vol. 16, No. 4, 1816-1850
dc.identifierdoi:10.1214/105051606000000376
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/123645
dc.subjectProbability
dc.subject60K25 (Primary) 90B22, 37E05 (Secondary)
dc.titlePeriodicity in the transient regime of exhaustive polling systems
dc.typetext

Files

Collections

arXiv