Computing stationary queueing-time distributions ofGI/D/1 andGI/D/c queues

Abstract

This article gives closed-form analytic expressions as well as the exact computational analysis of stationary queueing-time distribution for the GI/D/I queue. By exploiting the relationship between the distributions of queueing times of GI/D/1 and GI/D/c queues, the computational analysis of the queueing-time distribution of GI/D/c queue is also done. Numerical results are presented for (i) the first two moments of queueing time and (ii) the probability that queueing time is zero. Also, comments are made regarding the graphs of the distribution functions for particular cases of Em/D/1 and HE2/D/1. Some further properties such as computing the pre- and postdeparture probabilities for GI/D/1 are also discussed. The results discussed here should prove to be useful to practitioners and queueing theorists dealing with inequalities, bounds, et cetera. © 1992 John Wiley & Sons, Inc.

Cite this work

No public copy is stored for this record, so only the metadata is cited.

Stored only when both papers are in the corpus — 12 citations exist upstream.

Papers that cite the same references — the relational fallback while embeddings are still backfilling.