Analysis of polling systems
The analysis of random polling systems
Operations Research
Workloads and waiting times in single-server systems with multiple customer classes
Proceedings of the workshop held at the Mathematical Sciences Institute Cornell University on Mathematical theory of queueing systems
Waiting Lines and Times in a System with Polling
Journal of the ACM (JACM)
Stochastic Analysis of Computer and Communication Systems
Stochastic Analysis of Computer and Communication Systems
Waiting Times in Polling Systems with Markovian Server Routing
Messung, Modellierung und Bewertung von Rechensystemen, 5. GI/ITG-Fachtagung
LIMIT THEOREMS FOR POLLING MODELS WITH INCREASING SETUPS
Probability in the Engineering and Informational Sciences
Queueing Systems: Theory and Applications
Closed-form waiting time approximations for polling systems
Performance Evaluation
A note on polling models with renewal arrivals and nonzero switch-over times
Operations Research Letters
| Hi-index | 0.00 |
In this paper we derive decomposition results for the number of customers in polling systems under arbitrary (dynamic) polling order and service policies. Furthermore, we obtain sharper decomposition results for both the number of customers in the system and the waiting times under static polling policies. Our analysis, which is based on distributional laws, relaxes the Poisson assumption that characterizes the polling systems literature. In particular, we obtain exact decomposition results for systems with either Mixed Generalized Erlang (MGE) arrival processes, or asymptotically exact decomposition results for systems with general renewal arrival processes under heavy traffic conditions. The derived decomposition results can be used to obtain the performance analysis of specific systems. As an example, we evaluate the performance of gated Markovian polling systems operating under heavy traffic conditions. We also provide numerical evidence that our heavy traffic analysis is very accurate even for moderate traffic.