Some explicit formulas and computational methods for infinite-server queues with phase-type arrivals

Abstract

This paper discusses infinite-server queues with phase-type input. The problems of obtaining the transient and steady-state distributions and moments of the queue length are reduced to the solution of certain well-behaved systems of linear differential equations. Sample computations, provided with as many as ten phases, show that although (even the time-dependent) mean queue length is very insensitive to substantial random variability in the arrival process, the higher moments of the queue length are highly sensitive. These examples indicate that considerable caution should be exercised in using robustness results for such stochastic models.

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

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