No label defined (Q3707741)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 3936897
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | No label defined |
scientific article; zbMATH DE number 3936897 |
Statements
1986
0 references
Operational Analysis
0 references
single queuing station
0 references
network of queues
0 references
multiple-class networks
0 references
0.80987948179245
0 references
0.80987948179245
0 references
0.7965514659881592
0 references
0.7868358492851257
0 references
0.7774499654769897
0 references
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.
0 references