Mean-value analysis of queueing networks: a time-recurrent approach (Q1881901)
From MaRDI portal
| This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Mean-value analysis of queueing networks: a time-recurrent approach |
scientific article; zbMATH DE number 2108460
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Mean-value analysis of queueing networks: a time-recurrent approach |
scientific article; zbMATH DE number 2108460 |
Statements
Mean-value analysis of queueing networks: a time-recurrent approach (English)
0 references
18 October 2004
0 references
The author declares that he designs a new method for determining the mean characteristics of networks both in stationary and transient modes. In fact, the paper considers closed service networks with a fixed number of inputs and focuses attention on a) intensity of input flow on a given service system; b) mean number of inputs and c) mean residence time of inputs in this service system. Theorem 1 states that convergence of any considered characteristics is followed by convergence of others. It is worth to note that in proving Theorem 1 the Cauchy test is used incorrectly, so this theorem is not proved.
0 references
queueing networks
0 references