Queueing Networks: A Survey of Their Random Processes

Abstract

In this paper we review three topics in queueing network theory: queue length processes, sojourn times, and flow processes. In the discussion of the queue length processes we present results for the continuous-time process and several embedded processes. Then we compare continuous-time processes with embedded processes. In considerable generality we present results for mean sojourn times and discuss the distributions of sojourn times. In the discussion of flow processes we present results for various queueing systems. Our bibliography of over 300 references, while not exhaustive, does cover the major papers for the topics considered.

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

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