Cookies

We use cookies to ensure that we give you the best experience on our website. You can change your cookie settings at any time. Otherwise, we'll assume you're OK to continue.


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.

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.

Item Type:Article
Keywords:Polling systems, Greedy algorithm, Transience, Random walk, Dynamical system, Interval exchange transformation, a.s. convergence.
Full text:PDF - Published Version (354Kb)
Status:Peer-reviewed
Publisher Web site:http://dx.doi.org/10.1214/105051606000000376
Record Created:20 Feb 2008
Last Modified:17 May 2010 16:19

Social bookmarking: del.icio.usConnoteaBibSonomyCiteULikeFacebookTwitterExport: EndNote, Zotero | BibTex
Usage statisticsLook up in GoogleScholar | Find in a UK Library