Approximate mean value analysis algorithms for queuing networks (Q3477947)
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: Publication:3477947 |
scientific article; zbMATH DE number 4147495
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Approximate mean value analysis algorithms for queuing networks |
scientific article; zbMATH DE number 4147495 |
Statements
Approximate mean value analysis algorithms for queuing networks (English)
0 references
1990
0 references
Schweitzer-Bard approximation
0 references
throughput bounds
0 references
performance of
0 references
systems
0 references
modeling techniques
0 references
mean value analysis
0 references
closed product-form queueing networks
0 references
primal-dual algorithms
0 references
convex programming
0 references
0.8903626799583435
0 references
0.8278694748878479
0 references
0.8232073187828064
0 references
0.8182936906814575
0 references
