Waiting-time approximations for cyclic-service systems with switch-over times
- 1 May 1986
- journal article
- Published by Association for Computing Machinery (ACM) in ACM SIGMETRICS Performance Evaluation Review
- Vol. 14 (1) , 254-262
- https://doi.org/10.1145/317531.317558
Abstract
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.Keywords
This publication has 6 references indexed in Scilit:
- Waiting-time approximations in multi-queue systems with cyclic servicePerformance Evaluation, 1987
- Mean-delay approximation for cyclic-service queueing systemsPerformance Evaluation, 1983
- Poisson Arrivals See Time AveragesOperations Research, 1982
- Two Queues with Alternating ServiceSIAM Journal on Applied Mathematics, 1979
- Multiqueue Systems with Nonexhaustive Cyclic ServiceBell System Technical Journal, 1979
- A Priority Queuing System with Server-Walking TimeOperations Research, 1967