Approximation of discrete-time polling systems via structured Markov chains

P. Beekhuizen, J.A.C. Resing

Onderzoeksoutput: Boek/rapportRapportAcademic

65 Downloads (Pure)

Samenvatting

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 routing is a special case of Markovian routing. The key step of our approximation is the translation of the polling system to a structured Markov chain, while truncating all but one queue. Numerical experiments show that the approximation is very accurate in general. Our study is motivated by networks on chips with multiple masters (e.g., processors) sharing a single slave (e.g., memory).
Originele taal-2Engels
Plaats van productieEindhoven
UitgeverijEurandom
Aantal pagina's16
StatusGepubliceerd - 2009

Publicatie series

NaamReport Eurandom
Volume2009042
ISSN van geprinte versie1389-2355

    Vingerafdruk

Citeer dit

Beekhuizen, P., & Resing, J. A. C. (2009). Approximation of discrete-time polling systems via structured Markov chains. (Report Eurandom; Vol. 2009042). Eindhoven: Eurandom.