Waiting-time approximations in multi-queue systems with cyclic service
Performance Evaluation
Simulation of Computer Communication Systems
Simulation of Computer Communication Systems
Two Symmmetric Queues with Alternating Service and Switching Times
Performance '84 Proceedings of the Tenth International Symposium on Computer Performance Modelling, Measurement and Evaluation
Performance Evaluation of Cyclic Service Strategies - A Survey
Performance '84 Proceedings of the Tenth International Symposium on Computer Performance Modelling, Measurement and Evaluation
Performance modelling of a HSLAN slotted ring protocol
SIGMETRICS '88 Proceedings of the 1988 ACM SIGMETRICS conference on Measurement and modeling of computer systems
Queuing analysis of polling models
ACM Computing Surveys (CSUR)
Performance Analysis of Transaction Driven Computer Systems Via Queueing Analysis of Polling Models
IEEE Transactions on Computers
End-to-end delays in polling tree networks
Proceedings of the 3rd International Conference on Performance Evaluation Methodologies and Tools
On pseudo-conservation laws for the cyclic server system with compound Poisson arrivals
Operations Research Letters
| Hi-index | 0.00 |
Mean waiting-time approximations are derived for a single-server multi-queue system with nonexhaustive cyclic service. Non-zero switch-over times of the server between consecutive queues are assumed. The main tool used in the derivation is a pseudo-conservation law recently found by Watson. The approximation is simpler and, as extensive simulations show, more accurate than existing approximations. Moreover, it gives very good insight into the qualitative behavior of cyclic-service queueing systems.