Article thumbnail

Queue lengths and workloads in polling systems

By OJ Onno Boxma, Offer Kella and KM Kamil Kosinski

Abstract

For a single-server multi-station polling system, we focus on the generating function and Laplace–Stieltjes 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. Keywords: Polling system; Queue length; Steady-state distributio

Publisher: 'Elsevier BV'
Year: 2011
OAI identifier: oai:library.tue.nl:721343
Provided by: Repository TU/e
Download PDF:
Sorry, we are unable to provide the full text but you may find it at the following location(s):
  • http://repository.tue.nl/72134... (external link)
  • Suggested articles


    To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.