Closed-form waiting time approximations for polling systems

Authors:
M. A. A. Boon;E. M. M. Winands;I. J. B. F. Adan;A. C. C. van Wijk
Affiliations:
Eurandom and Department of Mathematics and Computer Science, Eindhoven University of Technology, P.O. Box 513, 5600MB Eindhoven, The Netherlands;Department of Mathematics, Section Stochastics, VU University, De Boelelaan 1081a, 1081HV Amsterdam, The Netherlands;Eurandom and Department of Mathematics and Computer Science, Eindhoven University of Technology, P.O. Box 513, 5600MB Eindhoven, The Netherlands;Eurandom and Department of Mathematics and Computer Science, Eindhoven University of Technology, P.O. Box 513, 5600MB Eindhoven, The Netherlands and Department of Industrial Engineering & Innovati ...
Venue:
Performance Evaluation
Year:
2011

Citing 16
Cited 3

An interpolation approximation for queueing systems with Poisson input

Operations Research
Queuing analysis of polling models

ACM Computing Surveys (CSUR)
Workloads and waiting times in single-server systems with multiple customer classes

Proceedings of the workshop held at the Mathematical Sciences Institute Cornell University on Mathematical theory of queueing systems
An interpolation approximation for the mean workload in a GI/G/1 queue

Operations Research
Interpolation approximations of sojourn time distributions

Operations Research
A simple relationship between light and heavy traffic limits

Operations Research - Supplement to Operations Research: stochastic processes
Optimization of polling systems with Bernoulli schedules

Performance Evaluation
Polling Systems in Heavy Traffic: a Bessel Process Limit

Mathematics of Operations Research
An interpolation approximation for expected wait in a time-limited polling system

Computers and Operations Research
Decomposition results for general polling systems and their applications

Queueing Systems: Theory and Applications
LIMIT THEOREMS FOR POLLING MODELS WITH INCREASING SETUPS

Probability in the Engineering and Informational Sciences
Branching-type polling systems with large setups

OR Spectrum
A note on polling models with renewal arrivals and nonzero switch-over times

Operations Research Letters
On polling systems with large setups

Operations Research Letters
Polling systems with periodic server routing in heavy traffic: renewal arrivals

Operations Research Letters
The distributional form of little's law and the fuhrmann-cooper decomposition

Operations Research Letters

On open problems in polling systems

Queueing Systems: Theory and Applications
Polling systems with batch service

OR Spectrum
Analysis of a two-layered network by means of the power-series algorithm

Performance Evaluation

Quantified Score

Hi-index	0.01

Visualization

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 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.