TY - JOUR
T1 - Throughput bounds for closed queueing networks with queue-dependent service rates
AU - Shanthikumar, J. George
AU - Yao, David D.
PY - 1988/11
Y1 - 1988/11
N2 - Consider a closed queueing network (CQN) with a set of stations; the service rate at each station can be any function of the queue length at that station. Upper and lower bounds are developed for the throughput of the CQN. The bounds make use of some results recently developed by the authors on likelihood ratio ordering and its preservation under convolution. As a special case, bounds for the throughput of CQN with multi-server stations are also considered. © 1988.
AB - Consider a closed queueing network (CQN) with a set of stations; the service rate at each station can be any function of the queue length at that station. Upper and lower bounds are developed for the throughput of the CQN. The bounds make use of some results recently developed by the authors on likelihood ratio ordering and its preservation under convolution. As a special case, bounds for the throughput of CQN with multi-server stations are also considered. © 1988.
KW - Closed Queueing Network
KW - Stochastic Monotonicity
KW - Throughput Bound
UR - http://www.scopus.com/inward/record.url?scp=0024108336&partnerID=8YFLogxK
UR - https://www.scopus.com/record/pubmetrics.uri?eid=2-s2.0-0024108336&origin=recordpage
U2 - 10.1016/0166-5316(88)90025-9
DO - 10.1016/0166-5316(88)90025-9
M3 - RGC 21 - Publication in refereed journal
SN - 0166-5316
VL - 9
SP - 69
EP - 78
JO - Performance Evaluation
JF - Performance Evaluation
IS - 1
ER -