Analysis of polling systems
Queueing systems with vacations—a survey
Queueing Systems: Theory and Applications
An analysis of symmetric polling systems with two priority classes
Performance Evaluation
The analysis of random polling systems
Operations Research
Queuing analysis of polling models
ACM Computing Surveys (CSUR)
Expected waiting times in polling systems under priority disciplines
Queueing Systems: Theory and Applications
Mean delay analysis for a message priority-based polling schemes
Queueing Systems: Theory and Applications
Stability of token passing rings
Queueing Systems: Theory and Applications - Polling models
Stability, monotonicity and invariant quantities in general polling systems
Queueing Systems: Theory and Applications - Polling models
Symmetric queues served in cyclic order
Operations Research Letters
Research: Analysis of a time-limited polling system
Computer Communications
Hi-index | 0.24 |
In this paper, we model a data acquisition system as cyclic polling systems with two priority levels. Two types of polling system are studied, exhaustive and time limited service, with application to automatic meter reading. In the case of the exhaustive service strategy, stations are served exhaustively for both priorities, with high priority messages served first on a non-preemptive basis. For the case of the time limited discipline, each station is served for no more than @t"m"a"x but not less than @t"m"i"n. Approximate results are obtained for the high and low priority mean waiting time for polling systems with constant switchover times, N stations, general service times distributions, and independent arrival processes for each priority level. Comparisons of the approximations with simulation results for different service distributions, traffic intensities and load combinations show a high degree of accuracy.