scientific article; zbMATH DE number 3936897
Operational Analysis (O.A.) is a recent approach to the study of queuing systems. It enables already known results, proved by means of the stochastic approach, to be recovered under a different set of assumptions. These assumptions pertain to quantities which can be measured from the observation of the system over a finite time horizon. The aim of this paper is to provide an overview of results in O.A. for a single queuing station as well as a single customer class network of queues. Moreover new results are presented for multiple-class networks, in the setting of O.A. A counterpart to the stochastic theorem of \textit{F. Baskett, K. M. Chandy, R. R. Muntz} and \textit{F. G. Palacios} [J. Assoc. Comput. Mach. 22, 248-260 (1975; Zbl 0313.68055)] is found. Lastly the strong and weak points of O.A. are discussed, including a comparison with other methodologies.
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3707741)