Some properties of the throughput function of closed networks of queues (Q1060944)
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 3910103
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Some properties of the throughput function of closed networks of queues |
scientific article; zbMATH DE number 3910103 |
Statements
Some properties of the throughput function of closed networks of queues (English)
0 references
1985
0 references
The throughput function of a closed network of queues is shown to be Schur concave and arrangement increasing. As a consequence of these properties, loading and server-assignment policies can be compared based on the majorization and the arrangement orderings. Implications of the results are discussed.
0 references
Schur convexity
0 references
throughput function
0 references
closed network of queues
0 references
arrangement increasing
0 references
majorization
0 references
0.8472487926483154
0 references
0.8467896580696106
0 references
0.8310776352882385
0 references
