Analysis of polling systems
Performance evaluation of polling systems by means of the power-series algorithm
Annals of Operations Research - Special issue on stochastic modeling of telecommunication systems
Queueing analysis of polling models: progress in 1990-1994
Frontiers in queueing
Polling Systems in Heavy Traffic: a Bessel Process Limit
Mathematics of Operations Research
SIAM Journal on Control and Optimization
Polling systems in heavy traffic: Exhaustiveness of service policies
Queueing Systems: Theory and Applications
Dynamic Scheduling of a Two-Class Queue with Setups
Operations Research
Heavy Traffic Analysis of the Dynamic Stochastic Inventory-Routing Problem
Transportation Science
Classifying scheduling policies with respect to unfairness in an M/GI/1
SIGMETRICS '03 Proceedings of the 2003 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
LIMIT THEOREMS FOR POLLING MODELS WITH INCREASING SETUPS
Probability in the Engineering and Informational Sciences
A resource-allocation queueing fairness measure
Proceedings of the joint international conference on Measurement and modeling of computer systems
Analysis of Alternating-Priority Queueing Models with (Cross) Correlated Switchover Times
Queueing Systems: Theory and Applications
Mean value analysis for polling systems
Queueing Systems: Theory and Applications
Polling models with renewal arrivals: A new method to derive heavy-traffic asymptotics
Performance Evaluation
SQF: A slowdown queueing fairness measure
Performance Evaluation
Expected waiting time in symmetric polling systems with correlated walking times
Queueing Systems: Theory and Applications
Towards a unifying theory on branching-type polling systems in heavy traffic
Queueing Systems: Theory and Applications
Heavy traffic analysis of polling models by mean value analysis
Performance Evaluation
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
Polling systems with periodic server routing in heavy traffic: renewal arrivals
Operations Research Letters
Hi-index | 0.00 |
We study an asymmetric cyclic polling system with Poisson arrivals, general service-time and switch-over time distributions, and so-called two-phase gated service at each queue, an interleaving scheme that aims to enforce some level of “fairness” among the different customer classes. For this model, we use the classical theory of multitype branching processes to derive closed-form expressions for the Laplace–Stieltjes transform of the waiting-time distributions when the load tends to 1, in a general parameter setting and under proper heavy-traffic scalings. This result is strikingly simple and provides new insights in the behavior of two-phase polling systems. In particular, the result provides insight in the waiting-time performance and the trade-off between efficiency and fairness of two-phase gated polling compared to the classical one-phase gated service policy.