Arranging Queues in Series: A Simulation Experiment
For given external arrival process and given service-time distributions, the object is to determine the order of infinite-capacity single-server queues in series that minimizes the long-run average sojourn time per customer. We gain additional insight into this queueing design problem, and congestion in non-Markov open queueing networks more generally, by performing simulations for the case of two queues. For this design problem, we conclude that the key issue is variability: The order tends to matter more when the service-time distributions have significantly different variability, and less otherwise. Arranging the queues in order of increasing service-time variability, using the squared coefficient of variation as a partial characterization of variability, seems to be an effective simple design heuristic. Parametric-decomposition approximations seem to provide relatively good quantitative estimates of how much the order matters.
Year of publication: |
1990
|
---|---|
Authors: | Suresh, S. ; Whitt, W. |
Published in: |
Management Science. - Institute for Operations Research and the Management Sciences - INFORMS, ISSN 0025-1909. - Vol. 36.1990, 9, p. 1080-1091
|
Publisher: |
Institute for Operations Research and the Management Sciences - INFORMS |
Subject: | queueing networks | tandem queues | departure processes | queueing system design | simulation | approximations | parametric-decomposition approximations |
Saved in:
Online Resource
Saved in favorites
Similar items by subject
-
Variability Functions for Parametric-Decomposition Approximations of Queueing Networks
Whitt, Ward, (1995)
-
The Best Order for Queues in Series
Whitt, Ward, (1985)
-
A Light-Traffic Approximation for Single-Class Departure Processes from Multi-Class Queues
Whitt, Ward, (1988)
- More ...
Similar items by person