A polling model with multiple priority levels

Authors:
M. A. A. Boon;I. J. B. F. Adan;O. J. Boxma
Affiliations:
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;Eurandom and Department of Mathematics and Computer Science, Eindhoven University of Technology, P.O. Box 513, 5600MB Eindhoven, The Netherlands
Venue:
Performance Evaluation
Year:
2010

Citing 11
Cited 2

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
Priority queues with setup times

Operations Research
Expected waiting times in polling systems under priority disciplines

Queueing Systems: Theory and Applications
Cyclic reservation schemes for efficient operation of multiple-queue single-server systems

Annals of Operations Research - Special issue on stochastic modeling of telecommunication systems
Polling systems with synchronization constraints

Annals of Operations Research - Special issue on stochastic modeling of telecommunication systems
Computing distributions and moments in polling models by numerical transform inversion

Performance Evaluation
Mean value analysis for polling systems

Queueing Systems: Theory and Applications
Scheduling in polling systems

Performance Evaluation
Sojourn times in polling systems with various service disciplines

Performance Evaluation
The distributional form of little's law and the fuhrmann-cooper decomposition

Operations Research Letters

Fairness and efficiency for polling models with the κ-gated service discipline

Performance Evaluation
Scheduling in polling systems in heavy traffic

ACM SIGMETRICS Performance Evaluation Review - Special issue on the 31st international symposium on computer performance, modeling, measurements and evaluation (IFIPWG 7.3 Performance 2013)

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper we consider a single-server cyclic polling system. Between visits to successive queues, the server is delayed by a random switch-over time. The order in which customers are served in each queue is determined by a priority level that is assigned to each customer at his arrival. For this situation the following service disciplines are considered: gated, exhaustive, and globally gated. We study the cycle time distribution, the waiting times for each customer type, the joint queue length distribution of all priority classes at all queues at polling epochs, and the steady-state marginal queue length distributions for each customer type.