Skip to main content
Article thumbnail
Location of Repository

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

By I. M. MacPhee, M. Menshikov, D. Petritis and S. Popov


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\ud 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

Topics: Polling system, Hitting time moments, Random environment, Parameter regeneration, Stability, Time-inhomogeneous Markov chains, Recurrence, Lyapunov functions.
Publisher: Institute of Mathematical Statistics
Year: 2007
DOI identifier: 10.1214/105051607000000212
OAI identifier:

Suggested articles

To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.