On open problems in polling systems

Authors:
Marko Boon;Onno J. Boxma;Erik M. Winands
Affiliations:
Eurandom and Department of Mathematics and Computer Science, Eindhoven University of Technology, Eindhoven, The Netherlands 5600MB;Eurandom and Department of Mathematics and Computer Science, Eindhoven University of Technology, Eindhoven, The Netherlands 5600MB;Department of Mathematics, Section Stochastics, VU University, Amsterdam, The Netherlands 1081HV
Venue:
Queueing Systems: Theory and Applications
Year:
2011

Citing 11
Cited 0

Queuing analysis of polling models

ACM Computing Surveys (CSUR)
Alternating service queues with mixed exhaustive and K-limited services

Performance Evaluation
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
A queueing model with applications to bridges and the DQDB (IEEE 802.6) MAN

Computer Networks and ISDN Systems
Waiting time distributions in a two-queue model with mixed exhaustive and gated-type K-limited services

PMCCN '97 Proceedings of the IFIP TC6 / WG6.3 & WG7.3 International Conference on the Performance and Management of Complex Communication Networks
LIMIT THEOREMS FOR POLLING MODELS WITH INCREASING SETUPS

Probability in the Engineering and Informational Sciences
Towards a unifying theory on branching-type polling systems in heavy traffic

Queueing Systems: Theory and Applications
A state-dependent polling model with k-limited service

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

OR Spectrum
Closed-form waiting time approximations for polling systems

Performance Evaluation
On polling systems with large setups

Operations Research Letters

Quantified Score

Hi-index	0.00

Visualization

Abstract

In the present paper we address two open problems concerning polling systems, viz., queueing systems consisting of multiple queues attended by a single server that visits the queues one at a time. The first open problem deals with a system consisting of two queues, one of which has gated service, while the other receives 1-limited service. The second open problem concerns polling systems with general (renewal) arrivals and deterministic switch-over times that become infinitely large. We discuss related, known results for both problems, and the difficulties encountered when trying to solve them.