Closed-Form Waiting Time Approximations for Polling Systems
Probability
2014-08-04 v1 Performance
Abstract
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 focusses 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 telecommunication, maintenance, manufacturing and transportation.
Keywords
Cite
@article{arxiv.1408.0134,
title = {Closed-Form Waiting Time Approximations for Polling Systems},
author = {Marko Boon and Erik Winands and Ivo Adan and Sandra van Wijk},
journal= {arXiv preprint arXiv:1408.0134},
year = {2014}
}