TY - JOUR
T1 - Closed-form waiting time approximations for polling systems
AU - Boon, M.A.A.
AU - Winands, E.M.M.
AU - Adan, I.J.B.F.
AU - Wijk, van, A.C.C.
PY - 2011
Y1 - 2011
N2 - A typical polling system consists of a number of queues, attended by a single server in a fixed order. The vast majority of papers on polling systems focus on Poisson arrivals, whereas very few results are available for general arrivals. The current study is the first one presenting simple closed-form approximations for the mean waiting times in polling systems with renewal arrival processes, performing well for all workloads. The approximations are constructed using heavy traffic limits and newly developed light traffic limits. The closed-form approximations may prove to be extremely useful for system design and optimisation in application areas as diverse as telecommunications, maintenance, manufacturing and transportation.
AB - A typical polling system consists of a number of queues, attended by a single server in a fixed order. The vast majority of papers on polling systems focus on Poisson arrivals, whereas very few results are available for general arrivals. The current study is the first one presenting simple closed-form approximations for the mean waiting times in polling systems with renewal arrival processes, performing well for all workloads. The approximations are constructed using heavy traffic limits and newly developed light traffic limits. The closed-form approximations may prove to be extremely useful for system design and optimisation in application areas as diverse as telecommunications, maintenance, manufacturing and transportation.
U2 - 10.1016/j.peva.2010.12.004
DO - 10.1016/j.peva.2010.12.004
M3 - Article
SN - 0166-5316
VL - 68
SP - 290
EP - 306
JO - Performance Evaluation
JF - Performance Evaluation
IS - 3
ER -