Approximation of discrete-time polling systems via structured Markov chains

P. Beekhuizen, J.A.C. Resing

Research output: Chapter in Book/Report/Conference proceedingConference contributionAcademicpeer-review

1 Downloads (Pure)

Abstract

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).
Original languageEnglish
Title of host publicationProceedings 4th International Workshop on Tools for Solving Structured Markov Chains (SMCTools 2009, Pisa, Italy, October 19, 2009; co-located with ValueTools 2009)
Place of PublicationBrussels
PublisherICST
Pages16-1/10
ISBN (Print)978-963-9799-70-7
DOIs
Publication statusPublished - 2009

    Fingerprint

Cite this

Beekhuizen, P., & Resing, J. A. C. (2009). Approximation of discrete-time polling systems via structured Markov chains. In Proceedings 4th International Workshop on Tools for Solving Structured Markov Chains (SMCTools 2009, Pisa, Italy, October 19, 2009; co-located with ValueTools 2009) (pp. 16-1/10). Brussels: ICST. https://doi.org/10.4108/ICST.VALUETOOLS2009.7667