betaFeedback

WorksMathematics

Queue lengths and workloads in polling systems

Abstract

We consider a polling system: a queueing system of N≥1N\ge 1 queues with Poisson arrivals Q1,...,QNQ_1,...,Q_N visited in a cyclic order (with or without switchover times) by a single server. For this system we derive the probability generating function Q(⋅)\mathscr Q(\cdot) of the joint queue length distribution at an arbitrary epoch in a stationary cycle, under no assumptions on service disciplines. We also derive the Laplace-Stieltjes transform W(⋅)\mathscr W(\cdot) of the joint workload distribution at an arbitrary epoch. We express Q\mathscr Q and W\mathscr W in the probability generating functions of the joint queue length distribution at visit beginnings, Vbi(⋅){\mathscr V}_{b_i}(\cdot), and visit completions, Vci(⋅){\mathscr V}_{c_i}(\cdot), at QiQ_i, i=1,...,Ni=1,...,N. It is well known that Vbi{\mathscr V}_{b_i} and Vci{\mathscr V}_{c_i} can be computed in a broad variety of cases. Furthermore, we establish a workload decomposition result.

Paper details

vlnc:W_4tg4vz4g
Version
v1 · latest
Published
Added
License
arXiv nonexclusive license
Usage

views · 0

downloads · 0

A view counts once per browser per day, a download each time the PDF is requested.

  • Mathematics

Not recorded for this paper

View statement
Looking for related papers…