Analysis of polling systems
A queueing network with a single cyclically roving server
Queueing Systems: Theory and Applications - Polling models
Polling systems with station breakdowns
Performance Evaluation
Analysis and Control of Poling Systems
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 VISIT-ORDER RULES FOR BATCH-SERVICE POLLING
Probability in the Engineering and Informational Sciences
A saturated tree network of polling stations with flow control
Proceedings of the 23rd International Teletraffic Congress
| Hi-index | 0.00 |
Closed polling systems with station breakdowns, under the gated, exhaustive or globally gated services regimes, are studied and analyzed. Multi-dimensional sets of probability generating functions of the system’s state are derived. They are further utilized to obtain an approximate solution for the mean number of jobs residing in the system’s various queues at polling instants. The analysis is then concentrated on the case of cyclic Bernoulli polling. Explicit formulae for the mean number of jobs, as well as for the expected cycle duration and system utilization, are derived. Comparison of the throughputs of the three regimes concludes the paper.