A queueing network with a single cyclically roving server
Queueing Systems: Theory and Applications - Polling models
File and work transfers in cyclic queue systems
Management Science
Polling Systems in Heavy Traffic: a Bessel Process Limit
Mathematics of Operations Research
Analysis and Application of Polling Models
Performance Evaluation: Origins and Directions
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
Sojourn times in polling systems with various service disciplines
Performance Evaluation
A polling model with smart customers
Queueing Systems: Theory and Applications
Queueing networks with a single shared server: light and heavy traffic
ACM SIGMETRICS Performance Evaluation Review - Special Issue on IFIP PERFORMANCE 2011- 29th International Symposium on Computer Performance, Modeling, Measurement and Evaluation
Polling systems with periodic server routing in heavy traffic: renewal arrivals
Operations Research Letters
The distributional form of little's law and the fuhrmann-cooper decomposition
Operations Research Letters
The M/G/1 queue with permanent customers
IEEE Journal on Selected Areas in Communications
| Hi-index | 0.00 |
We study a queueing network with a single shared server that serves the queues in a cyclic order. 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, tandem queues, systems with a waiting room, multi-stage models with parallel queues, and many others. A complicating factor of this model is that the internally rerouted customers do not arrive at the various queues according to a Poisson process, causing standard techniques to find waiting-time distributions to fail. In this paper, we develop a new method to obtain exact expressions for the Laplace---Stieltjes transforms of the steady-state waiting-time distributions. This method can be applied to a wide variety of models which lacked an analysis of the waiting-time distribution until now.