Comparative throughput analysis of queueing networks with exponential and deterministic service times in the nodes (Q1177484)
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: Comparative throughput analysis of queueing networks with exponential and deterministic service times in the nodes |
scientific article; zbMATH DE number 20602
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Comparative throughput analysis of queueing networks with exponential and deterministic service times in the nodes |
scientific article; zbMATH DE number 20602 |
Statements
Comparative throughput analysis of queueing networks with exponential and deterministic service times in the nodes (English)
0 references
26 June 1992
0 references
This paper investigates the behaviour of some queueing networks with exponential and deterministic service times in the nodes. A comparative analysis for the throughput is given for open and closed networks.
0 references
queueing networks
0 references
throughput
0 references
0.7914014458656311
0 references
0.7847212553024292
0 references
0.7649415135383606
0 references
