A generalization of Norton's theorem for queueing networks (Q1801812)
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: A generalization of Norton's theorem for queueing networks |
scientific article; zbMATH DE number 218356
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A generalization of Norton's theorem for queueing networks |
scientific article; zbMATH DE number 218356 |
Statements
A generalization of Norton's theorem for queueing networks (English)
0 references
20 June 1994
0 references
The authors consider queueing networks which can be decomposed into subnetworks. Using the analogy with electrical circuit theory, the authors show the computability of characteristic properties of the global queueing process and the local process in the subnetworks. By this way Norton's theorem for queueing networks is generalized. Many examples are described.
0 references
applications of Markov renewal processes
0 references
queueing networks
0 references
electrical circuit theory
0 references
0 references
0 references
