We use cookies to ensure that we give you the best experience on our website. By continuing to browse this repository, you give consent for essential cookies to be used. You can read more about our Privacy and Cookie Policy.

Durham Research Online
You are in:

A Markov chain model of a polling system with parameter regeneration.

MacPhee, I. M. and Menshikov, M. and Petritis, D. and Popov, S. (2007) 'A Markov chain model of a polling system with parameter regeneration.', Annals of applied probability., 17 (5/6). pp. 1447-1473.


We study a model of a polling system i.e. a collection of d queues with a single server that switches from queue to queue. The service time distribution and arrival rates change randomly every time a queue is emptied. This model is mapped to a mathematically equivalent model of a random walk with random choice of transition probabilities, a model which is of independent interest. All our results are obtained using methods from the constructive theory of Markov chains. We determine conditions for the existence of polynomial moments of hitting times for the random walk. An unusual phenomenon of thickness of the region of null recurrence for both the random walk and the queueing model is also proved.

Item Type:Article
Keywords:Polling system, Hitting time moments, Random environment, Parameter regeneration, Stability, Time-inhomogeneous Markov chains, Recurrence, Lyapunov functions.
Full text:(VoR) Version of Record
Download PDF
Publisher Web site:
Record Created:25 Feb 2008
Last Modified:25 Sep 2017 11:08

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