Polling system optimization through dynamic routing policies

Pseudocyclic algorithms that can prioritize the various stations by dynamically changing their service order but maintain fairness by visiting each station exactly once in a cycle re considered. The waiting time performance of systems operated under cycle-time guided algorithms in semi-dynamic polling models is studied. In fully symmetric systems the waiting times of all pseudocyclic policies are bounded by stochastic dominance. This dominance is quantified by the analysis of a fluid approximation model and simulations of the general polling model