Approximation of discrete-time polling systems via structured Markov chains

@inproceedings{Beekhuizen2009ApproximationOD,
  title={Approximation of discrete-time polling systems via structured Markov chains},
  author={Paul Beekhuizen and Jacques Resing},
  booktitle={VALUETOOLS},
  year={2009}
}
We devise an approximation of the marginal queue length distribution in discrete-time polling systems with batch arrivals and fixed packet sizes. The polling server uses the Bernoulli service discipline and Markovian routing. The 1-limited and exhaustive service disciplines are special cases of the Bernoulli service discipline, and traditional cyclic… CONTINUE READING