Relaxation times for queueing systems

Abstract

When a stochastic queueing model is used for performance analysis of, e.g., a comRuter or communication system, the steady-state situation is usually assumed to prevail.Since many systems exist where the validity of this assumption is questionable, while determination of the time-dependent behaviour of the system is difficult or even impossible, some simple means to characterize the speed with which system performance measures tend to their steady-state values is called for.In this paper the concept of relaxation time is put forward to provide such a characterization.We give a survey of results pertaining to relaxation times for a variety of queueing models.Also, some conjectures and open problems will be mentioned.

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

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