Throughput, efficiency, and heavy traffic asymptotic loss of closed queueing networks
Additional Document Info
We obtain linear programs which can obtain bounds on the throughput of closed queueing networks, as a function of the population size N. These linear programs also bound the asymptotic loss in heavy traffic, and can establish efficiency of a scheduling policy. We also apply these general results to two-station systems, for which we study the Harrison-Wein policy.
name of conference
Proceedings of 1995 34th IEEE Conference on Decision and Control