Approximations of the Mean Waiting Time in an M/G/s Queueing System

Abstract

This paper considers the problem of obtaining approximate expressions for the first moment WGs of the stationary waiting time distribution in an M/G/s queueing system. Special attention is paid to the case G ≡ D, i.e., constant service times. Most known approximations are in fact heavy traffic approximations which have rather large relative errors in the light traffic case. In the present study both the light traffic and heavy traffic behavior of WGs (WDs) are taken into account. In order to obtain mean waiting time approximations it appears to be useful to introduce a quantity (the “normed cooperation coefficient”) which is inversely proportional to WGs and which is in some sense a measure for the “cooperation” between the servers of the service facility. A part of the paper is devoted to the analysis of this normed cooperation coefficient.

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 — 113 citations exist upstream.

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