The single server queue in discrete time‐numerical analysis I

Abstract

Abstract This is the first of a sequence of papers dealing with the computational aspects of the transient behavior of queues in discrete time It is shown that for a substantial class of queues of practical interest, a wealth of numerical information may be obtained by relatively unsophisticated methods This approach should prove useful in the analysis of unstable queues which operate over a limited time interval, but is by no means limited to such queues Mathematically the service unit is modeled in terms of a multivariate Markov chain, whose particular structure is used in iterative computation. Many important queue features may then be derived from the n‐step transition probabilities of this chain.

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