DocumentCode
294369
Title
Throughput, efficiency, and heavy traffic asymptotic loss of closed queueing networks
Author
Jin, H. ; Ou, J. ; Kumar, P.R.
Author_Institution
Dept. of Electr. & Comput. Eng., Illinois Univ., Urbana, IL, USA
Volume
3
fYear
1995
fDate
13-15 Dec 1995
Firstpage
3150
Abstract
Obtains 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. The authors also apply these general results to two-station systems, for which they study the Harrison-Wein policy
Keywords
exponential distribution; graph theory; linear programming; queueing theory; scheduling; Harrison-Wein policy; closed queueing networks; efficiency; heavy traffic asymptotic loss; inear programs; population size; scheduling policy; throughput; two-station systems; Computer networks; Contracts; Matrix converters; Network synthesis; Sampling methods; Steady-state; Telecommunication traffic; Throughput; Traffic control;
fLanguage
English
Publisher
ieee
Conference_Titel
Decision and Control, 1995., Proceedings of the 34th IEEE Conference on
Conference_Location
New Orleans, LA
ISSN
0191-2216
Print_ISBN
0-7803-2685-7
Type
conf
DOI
10.1109/CDC.1995.478631
Filename
478631
Link To Document