Some properties of the throughput function of closed networks of queues
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.
scientific article; zbMATH DE number 3910103