Abstract
Consider a closed Jackson type network in which each queue has a single exponential server. Assume that N customers are moving among k queues. We establish simple closed form bounds on the network throughput (both lower and upper), which are sharper than those that are currently available. Numerical evaluation indicates that the improvements are significant.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
J.P. Buzen, Computational algorithms for closed queueing networks with exponential servers, Comm. ACM. 16 (1973) 527–531.
G.L. Choudhury, K.K. Leung and W. Whitt, Calculating normalization constants of closed queueing networks by numerically inverting their generating functions, J. ACM 50 (1995) 1–30.
A. Dallery, An improved balanced job bound analysis of closed queueing networks, Oper. Res. Lett. 6 (1987) 77–82.
J.J. Gordon, The evaluation of normalizing constants in closed queueing networks, Oper. Res. 38 (1990) 863–869.
A. Harel, S. Namn and J. Sturm, Zeros of successive derivatives and closed queueing networks, Working Paper (1996).
P.G. Harrison, On normalizing constants in queueing networks, Oper. Res. 33 (1985) 464–468.
D.L. Eager, Bounding algorithms for queueing network models of computer systems, Ph.D. thesis, Department of Computer Science, University of Toronto, Canada (1984).
E. Koenigsberg, Cyclic queues, Oper. Res. Quart. 9 (1958) 22–35.
I.G. Macdonald, Symmetric Functions and Hall Polynomials (Oxford Univ. Press, Oxford, 1979).
A.W. Marshall and I. Olkin, Inequalities: Theory of Majorization and Its Applications (Academic Press, New York, 1979).
G.H. Hardy, J.E. Littlewood and G. Pólya, Inequalities (Cambridge Univ. Press, Cambridge, 1952).
M. Reiser and S.S. Lavenberg, Mean value analysis of closed multi-chain queueing networks, J. ACM 27 (1980) 314–322.
K. Ross, D.H.K Tsang and J. Wang, Monte Carlo summation and integration applied to multiclass queueing networks, J. ACM 41 (1994) 1110–1135.
C.H. Sauer and K.M. Chandy, Computer Systems Performance Modeling (Prentice-Hall, Englewood Cliffs, NJ, 1981).
W. Whitt, Open and closed models of queues, AT & T Bell Lab. Tech. J. 63 (1984) 1911–1979.
J. Zahorjan, K.C. Sevcik, D.L. Eager and B. Galler, Balanced job bound analysis of queueing networks, Comm. ACM 25 (1982) 134–141.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Harel, A., Namn, S. & Sturm, J. Simple bounds for closed queueing networks. Queueing Systems 31, 125–135 (1999). https://doi.org/10.1023/A:1019102112869
Issue Date:
DOI: https://doi.org/10.1023/A:1019102112869