Premium
Some order relations in closed networks of queues with multiserver stations
Author(s) -
Yao David D.,
Kim Sung Chul
Publication year - 1987
Publication title -
naval research logistics (nrl)
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.665
H-Index - 68
eISSN - 1520-6750
pISSN - 0894-069X
DOI - 10.1002/1520-6750(198702)34:1<53::aid-nav3220340106>3.0.co;2-0
Subject(s) - queue , throughput , computer science , majorization , function (biology) , server , computer network , product (mathematics) , order (exchange) , mathematical optimization , queueing theory , distributed computing , mathematics , discrete mathematics , telecommunications , finance , geometry , evolutionary biology , economics , wireless , biology
Consider a closed network of queues of the “product‐form” type, where each station has s servers ( s ≥ 1 is identical for all stations). We show that the throughput function of the network is Schur concave with respect to the loading of the stations and arrangement increasing with respect to the assignment of server groups. Consequently, different loading/assignment policies can be compared under majorization/arrangement orderings and their relative merits decided according to the yields of throughput. The results can be used to support planning decisions in computer and production systems which are modeled as closed networks of queues.