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

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

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

authors

• Kumar, Panganamala

published proceedings

• Proceedings of the 48h IEEE Conference on Decision and Control (CDC) held jointly with 2009 28th Chinese Control Conference

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

• Institute of Electrical and Electronics Engineers (IEEE)  Publisher

published in

• Proceedings of the ... IEEE Conference on Decision & Control / IEEE Control Systems Society. IEEE Conference on Decision & Control  Journal

Digital Object Identifier (DOI)

• 10.1109/cdc.1995.478631

start page

• 3150-3151 vol.3

end page

• 3151

volume

• 3

URL

• http://dx.doi.org/10.1109/cdc.1995.478631