Periodicity in the transient regime of exhaustive polling systems

From MaRDI portal
Publication:997406

DOI10.1214/105051606000000376zbMATH Open1121.60098arXivmath/0702252OpenAlexW2088223949MaRDI QIDQ997406FDOQ997406


Authors: S. Popov, Stanislav Volkov, Iain M. MacPhee, Mikhail V. Menshikov Edit this on Wikidata


Publication date: 6 August 2007

Published in: The Annals of Applied Probability (Search for Journal in Brave)

Abstract: 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.


Full work available at URL: https://arxiv.org/abs/math/0702252




Recommendations




Cites Work


Cited In (6)





This page was built for publication: Periodicity in the transient regime of exhaustive polling systems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q997406)