Queue lengths and workloads in polling systems

Abstract: We consider a polling system: a queueing system of

N g e 1

queues with Poisson arrivals

Q_{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

m a t h s c r Q (c d o t)

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

m a t h s c r W (c d o t)

of the joint workload distribution at an arbitrary epoch. We express

m a t h s c r Q

and

m a t h s c r W

in the probability generating functions of the joint queue length distribution at visit beginnings,

{m a t h s c r V}_{b_{i}} (c d o t)

, and visit completions,

{m a t h s c r V}_{c_{i}} (c d o t)

, at

Q_{i}

,

i = 1, ..., N

. It is well known that

{m a t h s c r V}_{b_{i}}

and

{m a t h s c r V}_{c_{i}}

can be computed in a broad variety of cases. Furthermore, we establish a workload decomposition result.

Recommendations

Cites work

Cited in

(13)

This page was built for publication: Queue lengths and workloads in polling systems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q408416)