Some properties of the throughput function of closed networks of queues

  • Authors:

  • David D. Yao

  • Affiliations:

  • Department of Industrial Engineering and Operations Research, Columbia University, New York, NY 10027, USA

  • Venue:
  • Operations Research Letters
  • Year:
  • 1985

Quantified Score

Hi-index 0.00

Visualization

Abstract

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.