The generalized expansion method for open finite queueing networks (Q582720)
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 4131411
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The generalized expansion method for open finite queueing networks |
scientific article; zbMATH DE number 4131411 |
Statements
The generalized expansion method for open finite queueing networks (English)
0 references
1987
0 references
An open queueing network is analyzed approximately by superposing arrival streams, splitting departure streams and artificial nodes to allow for blocked customers. Renewal processes are assumed (not necessarily Poisson). Extensive numerical examples are given, which compare favorably with simulation results.
0 references
open queueing network
0 references
Renewal processes
0 references
simulation results
0 references
0 references
0.9517712
0 references
0 references
0.9037405
0 references
0.89915246
0 references
0.89671487
0 references
0.8864511
0 references
