Analysis of polling systems
Optimization of polling systems with Bernoulli schedules
Performance Evaluation
Computing distributions and moments in polling models by numerical transform inversion
Performance Evaluation
Customer delay in very large multi-queue single-server systems
Performance Evaluation
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
Distribution of the delay in polling systems in heavy traffic
Performance Evaluation
Polling systems in heavy traffic: Exhaustiveness of service policies
Queueing Systems: Theory and Applications
Polling systems in heavy traffic: Higher moments of the delay
Queueing Systems: Theory and Applications
Performance Analysis and Optimization with the Power-Series Algorithm
Performance Evaluation of Computer and Communication Systems, Joint Tutorial Papers of Performance '93 and Sigmetrics '93
Performance Evaluation of Cyclic Service Strategies - A Survey
Performance '84 Proceedings of the Tenth International Symposium on Computer Performance Modelling, Measurement and Evaluation
Dynamic Scheduling of a Two-Class Queue with Setups
Operations Research
Mean value analysis for polling systems in heavy traffic
valuetools '06 Proceedings of the 1st international conference on Performance evaluation methodolgies and tools
Polling models with renewal arrivals: A new method to derive heavy-traffic asymptotics
Performance Evaluation
Heavy traffic analysis of polling models by mean value analysis
Performance Evaluation
On a unifying theory on polling models in heavy traffic
ITC20'07 Proceedings of the 20th international teletraffic conference on Managing traffic performance in converged networks
| Hi-index | 0.00 |
Consider an asymmetric cyclic polling system with general service-time and switch-over time distributions, and with general mixtures of exhaustive and gated service, in heavy traffic. We obtain explicit expressions for all moments of the steady-state delay at each of the queues, under heavy-traffic scalings. The expressions are strikingly simple: they depend on only a few system parameters, and moreover, can be expressed as finite products of simple known terms. The exact results provide new and useful insights into the behavior of polling systems in heavy traffic. In addition, the results suggest simple and fast approximations for the moments of the delay in stable polling systems. Numerical experiments demonstrate the usefulness of the approximations for moderately and heavily loaded systems.