Simple bounds for closed queueing networks

Queueing Systems

Volumn 31, Issue 1-2, 1999, Pages 125-135

  Harel, Arie ^a   Namn, Su ^b   Sturm, Jacob ^c  

^a NATIONAL UNIVERSITY OF SINGAPORE   (Singapore)

^b Hannam University   (South Korea)

^c RUTGERS UNIVERSITY   (United States)

Author keywords

Balanced job bounds; Closed queueing networks; Complete symmetric function; Lower bound; Majorization; Mean performance measures; Normalization constant; Throughput; Upper bound

Indexed keywords

QUEUEING THEORY; THROUGHPUT;

BALANCED JOB BOUNDS; CLOSED QUEUEING NETWORK; LOWER BOUNDS; MAJORIZATION; NORMALIZATION CONSTANTS; PERFORMANCE MEASURE; SYMMETRIC FUNCTIONS; UPPER BOUND;

QUEUEING NETWORKS;

EID: 0033242756     PISSN: 02570130     EISSN: 15729443     Source Type: Journal    
DOI: 10.1023/a:1019102112869     Document Type: Article

References (16)

1. J.P. Buzen, Computational algorithms for closed queueing networks with exponential servers, Comm. ACM. 16 (1973) 527-531.
2. 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.
3. A. Dallery, An improved balanced job bound analysis of closed queueing networks, Oper. Res. Lett. 6 (1987) 77-82.
4. J.J. Gordon, The evaluation of normalizing constants in closed queueing networks, Oper. Res. 38 (1990) 863-869.
5. A. Harel, S. Namn and J. Sturm, Zeros of successive derivatives and closed queueing networks, Working Paper (1996).
6. P.G. Harrison, On normalizing constants in queueing networks, Oper. Res. 33 (1985) 464-468.
7. D.L. Eager, Bounding algorithms for queueing network models of computer systems, Ph.D. thesis, Department of Computer Science, University of Toronto, Canada (1984).
8. E. Koenigsberg, Cyclic queues, Oper. Res. Quart. 9 (1958) 22-35.
9. I.G. Macdonald, Symmetric Functions and Hall Polynomials (Oxford Univ. Press, Oxford, 1979).
10. A.W. Marshall and I. Olkin, Inequalities: Theory of Majorization and Its Applications (Academic Press, New York, 1979).
11. G.H. Hardy, J.E. Littlewood and G. Pólya, Inequalities (Cambridge Univ. Press, Cambridge, 1952).
12. M. Reiser and S.S. Lavenberg, Mean value analysis of closed multi-chain queueing networks, J. ACM 27 (1980) 314-322.
13. 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.
14. C.H. Sauer and K.M. Chandy, Computer Systems Performance Modeling (Prentice-Hall, Englewood Cliffs, NJ, 1981).
15. W. Whitt, Open and closed models of queues, AT&T Bell Lab. Tech. J. 63 (1984) 1911-1979.
16. J. Zahorjan, K.C. Sevcik, D.L. Eager and B. Galler, Balanced job bound analysis of queueing networks, Comm. ACM 25 (1982) 134-141.