Paper Info
Title
On the guaranteed throughput and efficiency of closed re-entrant lines
Abstract
A closed network is said to be “guaranteed efficient” if the throughput converges under all non-idling policies to the capacity of the bottlenecks in the network, as the number of trapped customers increases to infinity. We obtain a necessary condition for guaranteed efficiency of closed re-entrant lines. For balanced two-station systems, this necessary condition is almost sufficient, differing from it only by the strictness of an inequality. This near characterization is obtained by studying a special type of virtual station called “alternating visit virtual station”. These special virtual stations allow us to relate the necessary condition to certain indices arising in heavy traffic studies using a Brownian network approximation, as well as to certain policies proposed as being extremal with respect to the asymptotic loss in the throughput. Using the near characterization of guaranteed efficiency we also answer the often pondered question of whether an open network or its closed counterpart has greater throughput – the answer is that neither can assure a greater guaranteed throughput.
Year
DOI
Venue
1998
10.1023/A:1019199022922
Queueing Systems: Theory and Applications
Keywords
Field
DocType
queueing networks,throughput,closed networks,efficiency,stability
Mathematical optimization,Queue,Infinity,Real-time computing,Throughput,Brownian motion,Mathematics
Journal
Volume
Issue
ISSN
28
1/3
1572-9443
Citations 
PageRank 
References 
8
0.96
4
Authors
2
Name
Order
Citations
PageRank
James R. Morrison119526.43
P. R. Kumar271771067.24