Analysis of polling systems
Efficient visit frequencies for polling tables: minimization of waiting cost
Queueing Systems: Theory and Applications
Elevator-type polling systems (abstract)
SIGMETRICS '92/PERFORMANCE '92 Proceedings of the 1992 ACM SIGMETRICS joint international conference on Measurement and modeling of computer systems
Cyclic reservation schemes for efficient operation of multiple-queue single-server systems
Annals of Operations Research - Special issue on stochastic modeling of telecommunication systems
On elevator polling with globally gated regime
Queueing Systems: Theory and Applications - Polling models
Efficient visit orders for polling systems
Performance Evaluation
Mean value analysis for polling systems
Queueing Systems: Theory and Applications
Quantifying fairness in queuing systems: Principles, approaches, and applicability
Probability in the Engineering and Informational Sciences
Polling systems with a gated/exhaustive discipline
Proceedings of the 3rd International Conference on Performance Evaluation Methodologies and Tools
Polling models with two-stage gated service: fairness versus efficiency
ITC20'07 Proceedings of the 20th international teletraffic conference on Managing traffic performance in converged networks
A polling model with multiple priority levels
Performance Evaluation
A polling model with smart customers
Queueing Systems: Theory and Applications
On ergodicity conditions in a polling model with Markov modulated input and state-dependent routing
Queueing Systems: Theory and Applications
| Hi-index | 0.00 |
We study a polling model in which we want to achieve a balance between the fairness of the waiting times and the efficiency of the system. For this purpose, we introduce a novel service discipline: the @k-gated service discipline. It is a hybrid of the classical gated and exhausted disciplines, and consists of using @k"i consecutive gated service phases at queue i before the server switches to the next queue. The advantage of this discipline is that the parameters @k"i can be used to balance fairness and efficiency. We derive the distributions and means of the waiting times, a pseudo conservation law for the weighted sum of the mean waiting times, and the fluid limits of the waiting times. Our goal is to optimize the @k"i so as to minimize the differences in the mean waiting times, i.e. to achieve maximal fairness, without giving up too much on the efficiency of the system. From the fluid limits we derive a heuristic rule for setting the @k"i. In a numerical study, the heuristic is shown to perform well in most cases.