Transient behaviour of queueing networks

Abstract

In most contemporary queueing network analysis, the assumption is made that a network is in a state of equilibrium. That is, the network's state space probabilities are assumed to be time independent. It is therefore important to be able to quantify precisely when this assumption is valid. Furthermore there are also situations in which it is desirable to model the transient behaviour of networks which occur in practice, such as computer and communication systems. For example, the immediate effects of component failure or instantaneous alteration of system status may be predicted. In this paper an iterative solution is derived to the time-dependent Kolmogorov equations of queueing networks, and is shown to be convergent. From the solution, modelling of transient situations becomes possible and the time periods during which the equilibrium assumption can and should not be made may be identified; for example in terms of a time constant which is easily computed to a first-order approximation.

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

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