Throughput, efficiency, and heavy traffic asymptotic loss of closed queueing networks Conference Paper uri icon

abstract

  • 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

  • 1995 34th IEEE Conference on Decision and Control

published proceedings

  • Proceedings of 1995 34th IEEE Conference on Decision and Control

author list (cited authors)

  • Jin, H., Ou, J., & Kumar, P. R

citation count

  • 2

complete list of authors

  • Jin, H||Ou, J||Kumar, PR

publication date

  • January 1995

publisher