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

Authors:
R. D. Van Der Mei;E. M. M. Winands
Affiliations:
Center for Mathematics and Computer Science (CWI), Department of Probability and Stochastic Networks, 1098 SJ Amsterdam, The Netherlands and Vrije Universiteit, Department of Mathematics, 1081 HV ...;Department of Mathematics and Computer Science, Technische Universiteit Eindhoven, P.O. Box 513, 5600 MB Eindhoven, The Netherlands and Department of Technology Management, Technische Universiteit ...
Venue:
Operations Research Letters
Year:
2008

Citing 10
Cited 2

Analysis of polling systems

Analysis of polling systems
Expected waiting time for nonsymmetric cyclic queueing systems—exact results and applications

Management Science
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
Stability, monotonicity and invariant quantities in general polling systems

Queueing Systems: Theory and Applications - Polling models
Polling Systems in Heavy Traffic: a Bessel Process Limit

Mathematics of Operations Research
Distribution of the delay in polling systems in heavy traffic

Performance Evaluation
Decomposition results for general polling systems and their applications

Queueing Systems: Theory and Applications
Analysis and Application of Polling Models

Performance Evaluation: Origins and Directions
Polling models with renewal arrivals: A new method to derive heavy-traffic asymptotics

Performance Evaluation
Polling systems with periodic server routing in heavy traffic: renewal arrivals

Operations Research Letters

Closed-form waiting time approximations for polling systems

Performance Evaluation
Polling systems with batch service

OR Spectrum

Quantified Score

Hi-index	0.00

Visualization

Abstract

We consider gated polling systems with general service and switch-over times and with renewal arrival processes. We derive closed-form expressions for the expected delay in heavy-traffic (HT). So far, proofs of HT limits have only been obtained for Poisson-type arrival processes, whereas for renewal arrivals limits are based on conjectures.