Queue lengths and workloads in polling systems

O. J. Boxma, O. Kella, K. M. Kosiski*

*Corresponding author for this work

Research output: Contribution to journalArticlepeer-review

27 Scopus citations

Abstract

For a single-server multi-station polling system, we focus on the generating function and LaplaceStieltjes transform of the time-stationary joint queue length and workload distributions, respectively, under no further assumptions on the service discipline. We express these quantities as expressions involving the generating functions of the joint queue length distribution at visit beginnings and visit completions at the various stations. The latter is known for a broad variety of cases. Finally, we identify a workload decomposition result.

Original languageAmerican English
Pages (from-to)401-405
Number of pages5
JournalOperations Research Letters
Volume39
Issue number6
DOIs
StatePublished - Nov 2011

Bibliographical note

Funding Information:
The second author is supported by grant No. 434/09 from the Israel Science Foundation and the Vigevani Chair in Statistics . The third author is supported by NWO grant 613.000.701 . The authors would also like to thank Marko Boon for reading the first draft of this paper, which led to the nice simplification of Formula (9) into (10) .

Keywords

  • Polling system
  • Queue length
  • Steady-state distribution

Fingerprint

Dive into the research topics of 'Queue lengths and workloads in polling systems'. Together they form a unique fingerprint.

Cite this