A queueing network with a single cyclically roving server
Queueing Systems: Theory and Applications - Polling models
Polling Systems in Heavy Traffic: a Bessel Process Limit
Mathematics of Operations Research
Customer Routing on Polling Systems
Performance '90 Proceedings of the 14th IFIP WG 7.3 International Symposium on Computer Performance Modelling, Measurement and Evaluation
Towards a unifying theory on branching-type polling systems in heavy traffic
Queueing Systems: Theory and Applications
Waiting times in queueing networks with a single shared server
Queueing Systems: Theory and Applications
Hi-index | 0.00 |
We study a queueing network with a single shared server, that serves the queues in a cyclic order according to the gated service discipline. External customers arrive at the queues according to independent Poisson processes. After completing service, a customer either leaves the system or is routed to another queue. This model is very generic and finds many applications in computer systems, communication networks, manufacturing systems and robotics. Special cases of the introduced network include well-known polling models and tandem queues. We derive exact limits of the mean delays under both heavy-traffic and light-traffic conditions. By interpolating between these asymptotic regimes, we develop simple closed-form approximations for the mean delays for arbitrary loads.