Experiments with improved approximate mean value analysis algorithms

Performance Evaluation

Volumn 39, Issue 1-4, 2000, Pages 189-206

  Wang, Hai ^a   Sevcik, Kenneth C ^a  

^a UNIVERSITY OF TORONTO   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

APPROXIMATION THEORY; COMPUTATIONAL COMPLEXITY; COMPUTER SOFTWARE; ERRORS; PERFORMANCE; QUEUEING NETWORKS;

IMPROVED APPROXIMATE MEAN VALUE ANALYSIS LIBRARY; QUEUEING NETWORK MODELS;

ALGORITHMS;

EID: 0034140595     PISSN: 01665316     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0166-5316(99)00064-4     Document Type: Article

References (32)

1. Y. Bard, Some extensions to multiclass queueing network analysis, in: M. Arato, A. Butrimenko, E. Gelenbe (Eds.), Performance of Computer Systems, North-Holland, Amsterdam, 1979, pp. 51-62.
2. F. Baskett, K.M. Chandy, R.R. Muntz, F.G. Palacios, Open, closed, and mixed networks of queues with different classes of customers, J. ACM 22 (2) (1975) 248-260.
3. J.V. Bradley, Distribution Free Statistical Tests, Prentice-Hall, Englewood Cliffs, NJ, 1968.
4. J.P. Buzen, Computational algorithms for closed queueing networks with exponential servers, Commun. ACM 16 (9) (1973) 527-531.
5. W.-M. Chow, Approximations for large scale closed queueing networks, Performance Evaluation 3 (1) (1983) 1-12.
6. K.M. Chandy, D. Neuse, Linearizer: a heuristic algorithm for queueing network models of computing systems, Commun. ACM 25 (2) (1982) 126-134.
7. K.M. Chandy, C.H. Sauer, Computational algorithms for product form queueing networks, Commun. ACM 23 (10) (1980) 573-583.
8. A.E. Conway, N.D. Georganas, RECAL - A new efficient algorithm for the exact analysis of multiple-chain closed queueing networks, J. ACM 33 (4) (1986) 768-791.
9. A.E. Conway, E. de Souza e Silva, S.S. Lavenberg, Mean value analysis by chain product form queueing networks, IEEE Trans. Computers C 38 (3) (1989) 432-442.
10. D.L. Eager, Bounding algorithms for queueing network models of computer systems, Ph.D. Thesis, Tech. Rep. CSRG-156, Department of Computer Science, University of Toronto, 1984.
11. D.L. Eager, K.C. Sevcik, Analysis of an approximation algorithm for queueing networks, Performance Evaluation 4 (4) (1984) 275-284.
12. D.L. Eager, K.C. Sevcik, Bound hierarchies for multiple-class queueing networks, J. ACM 33 (1) (1986) 179-206.
13. K.P. Hoyme, S.C. Bruell, P.V. Afshari, R.Y. Kain, A tree-structured mean value analysis algorithm, ACM Trans. Computer Systems 4 (2) (1986) 178-185.
14. C.T. Hsieh, S.S. Lam, PAM - A noniterative approximate solution method for closed multichain queueing networks, ACM SIGMETRICS Performance Evaluation Rev. 16 (1) (1988) 261-269.
15. S.S. Lam, A simple derivation of the MVA and LBANC algorithms from the convolution algorithm, IEEE Trans. Computers C 32 (11) (1983) 1062-1064.
16. S.S. Lam, Y.L. Lien, A tree convolution algorithm for the solution of queueing networks, Commun. ACM 26 (3) (1983) 203-215.
17. S.S. Lavenberg, M. Reiser, Stationary state probabilities of arrival instants for closed queueing networks with multiple types of customers, J. Appl. Probab. 17 (4) (1980) 1048-1061.
18. J.D.C. Little, A proof of the queueing formula L = λW, Oper. Res. 9 (3) (1961) 383-387.
19. K.R. Pattipati, M.M. Kostreva, J.L. Teele, Approximate mean value analysis algorithms for queueing networks: existence, uniqueness, and convergence results, J. ACM 37 (3) (1990) 643-673.
20. M. Reiser, H. Kobayashi, Queueing networks with multiple closed chains: theory and computational algorithms, IBM J. Res. Dev. 19 (3) (1975) 283-294.
21. M. Reiser, H. Kobayashi, On the convolution algorithm for separable queueing networks, in: Proceedings of the International Symposium on Computer Performance Measurement, Modeling, and Evaluation, Cambridge, UK, 1976, pp. 109-117.
22. M. Reiser, S.S. Lavenberg, Mean value analysis of closed multichain queueing networks, J. ACM 27 (2) (1980) 313-322.
23. P.J. Schweitzer, Approximate analysis of multiclass closed networks of queues, in: Proceedings of the International Conference on Stochastic Control and Optimization, Amsterdam, Netherlands, 1979, pp. 25-29.
24. P.J. Schweitzer, G. Serazzi, M. Broglia, A queue-shift approximation technique for product-form queueing networks, in: Proceedings of the International Conference on Modeling Techniques and Tools for Computer Performance Evaluation Palma de Mallorca, Spain, 1998, Lecture Notes in Computer Science, vol. 1469, Springer, New York, 1998, pp. 267-279,
25. K.C. Sevcik, I. Mitrani, The distribution of queueing network states at input and output instants, J. ACM 28 (2) (1981) 358-371.
26. K. Sevcik, H. Wang, An improved approximate mean value analysis algorithm for solving separable queueing network models, Tech. Rep. CSRG-379, Department of Computer Science, University of Toronto, 1999.
27. E. de Souza e Silva, S.S. Lavenberg, R.R. Muntz, A perspective on iterative methods for the approximate analysis of closed queueing networks, in: G. lazeolla, P.J. Courtois, A. Hordijk (Eds.), Mathematical Computer Performance and Reliability, North-Holland, Amsterdam, 1984, pp. 225-244.
28. E. de Souza e Silva, S.S. Lavenberg, R.R. Muntz, A clustering approximation technique for queueing network models with a large number of chains, IEEE Trans. Computers C 35 (5) (1986) 419-430.
29. E. de Souza e Silva, R.R. Muntz, A note on the computational cost of the linearizer algorithm for queueing networks, IEEE Trans. Computers 39 (6) (1990) 840-842.
30. S. Tucci, C.H. Sauer, The tree MVA algorithm, Performance Evaluation 5 (3) (1985) 187-196.
31. H. Wang, Approximate MVA algorithms for solving queueing network models, M.Sc. Thesis, Tech. Rep. CSRG-360, Department of Computer Science, University of Toronto, 1997.
32. J. Zahorjan, D.L. Eager, H.M. Sweillam, Accuracy, speed, and convergence of approximate mean value analysis, Performance Evaluation 8 (4) (1988) 255-270.