Analysis of polling systems
Polling and greedy servers on a line
Queueing Systems: Theory and Applications
Light-traffic analysis for queues with spatially distributed arrivals
Mathematics of Operations Research
Queueing analysis of polling models: progress in 1990-1994
Frontiers in queueing
Queueing Systems: Theory and Applications
Queueing Systems: Theory and Applications
Stability and performance of greedy server systems
Queueing Systems: Theory and Applications
Continuous polling with rerouting and applications to ferry assisted wireless LANs
Proceedings of the 5th International ICST Conference on Performance Evaluation Methodologies and Tools
Mixed polling with rerouting and applications
Performance Evaluation
| Hi-index | 0.00 |
We study the limiting behavior of gated polling systems, as their dimension (the number of queues) tends to infinity, while the system's total incoming workflow and total switchover time (per cycle) remain unchanged. The polling systems are assumed asymmetric, with incoming workflow obeying general Lévy statistics, and with general inter-dependent switchover times. We prove convergence, in law, to a limiting polling system on the circle. The derivation is based on an asymptotic analysis of the stochastic Poincaré maps of the polling systems. The obtained polling limit is identified as a snowplowing system on the circle--whose evolution, steady-state equilibrium, and statistics have been recently investigated and are known.