Gated polling with stationary ergodic walking times, Markovian routing and random feedback

Gated polling with stationary ergodic walking times, Markovian routing and random feedback

0.00 Avg rating0 Votes
Article ID: iaor20124782
Volume: 198
Issue: 1
Start Page Number: 145
End Page Number: 164
Publication Date: Sep 2012
Journal: Annals of Operations Research
Authors: ,
Keywords: networks: scheduling, markov processes, queues: theory, stochastic processes, programming: linear
Abstract:

We investigate a gated polling system with semi‐linear feedback and Markovian routing. We thereby relax the classical independence assumption on the walking times; the walking times constitute a sequence of stationary ergodic random variables. It is shown that the dynamics of this polling system can be described by semi‐linear stochastic recursive equations in a Markovian environment. We obtain expressions for the first and second order moments of the workload and queue content at polling instants and for the mean queue content and workload at random instants.

Reviews

Required fields are marked *. Your email address will not be published.