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.
Similar content being viewed by others
References
J. Dai and J.H.V. Vate, Global stability of two-station queueing networks, Preprint, School of Industrial and Systems Engineering, Georgia Institute of Technology (1996).
V. Dumas, A multiclass network with non-linear, non-convex, non-monotonic stability conditions, Preprint (1995).
J.M. Harrison and V. Nguyen, Some badly behaved closed queueing networks, in: Stochastic Networks, eds. F.P. Kelly and R. Williams, Vol. 71 (Springer, New York, NY, 1995) pp. 117-124.
J.M. Harrison and L.M. Wein, Scheduling networks of queues: Heavy traffic analysis of a two-station closed network, Oper. Res. 38(6) (1990) 1052-1064.
J.J. Hasenbein, Necessary conditions for global stability of multiclass queueing networks, Report J-96-01, Industrial and Systems Engineering Report Series, Georgia Institute of Technology (May 1996).
C. Humes, Jr., J. Ou and P.R. Kumar, The delay of open Markovian queueing networks: Uniform functional bounds, heavy traffic pole multiplicities, and stability, to appear in Math. Oper. Res.
H. Jin, J. Ou and P.R. Kumar, The throughput of irreducible closed Markovian queueing networks: Functional bounds, asymptotic loss, efficiency, and the Harrison-Wein conjectures, to appear in Math. Oper. Res.
P.R. Kumar and T.I. Seidman, Dynamic instabilities and stabilization methods in distributed real-time scheduling of manufacturing systems, IEEE Trans. Automat. Control 35 (March 1990) 289-298.
S. Kumar and P.R. Kumar, Performance bounds for queueing networks and scheduling policies, IEEE Trans. Automat. Control 39 (August 1994) 1600-1611.
S.H. Lu and P.R. Kumar, Distributed scheduling based on due dates and buffer priorities, IEEE Trans. Automat. Control 36 (December 1991) 1406-1416.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Morrison, J.R., Kumar, P. On the guaranteed throughput and efficiency of closed re-entrant lines. Queueing Systems 28, 33–54 (1998). https://doi.org/10.1023/A:1019199022922
Issue Date:
DOI: https://doi.org/10.1023/A:1019199022922