Year: 1984
Type: other
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.
Authors: Blanc, J.P.C., Doorn, E.A.
Language: English
Subfield: Management Information Systems
Domain: Social Sciences
Open Access status: green
OpenAlex ID: W2573515768