References
- Baskett, F., K.M. Chandy, R.R. Muntz, and F. Palacios, (1975) “Open, closed and mixed netv/orks of queues with different classes of customers,” J.ACM, 22, 248-60
- Bruell, S.C. and G. Balbo, (1980) Computational Algorithms for Closed Queueing Networks. New York: Elsevier- North-Holland
- Buzen, J.P. (1973) “Computational algorithms for closed queueing networks with exponential servers,” C.ACM, 16: 6, 527-31
- Conway, A.E. and N.D. Georganas, (1985a) “RECAL: A new efficient algorithm for the exact analysis of multiplechain closed queueing networks,” Rapports de Recherche no. 373, INRIA, Paris (to appear in J.ACM)
- (1985b) “A recursion by chain algorithm for multiple chain queueing network models,” Proc. 8th ACMInt. Comp. Symp. Amsterdam: North-Holland.
- Heidelberger, P. and S.S. Lavenberg, (1984) “Computer perfonnance evaluation methodology,” IEEE Trans. Computers, 12, 1195-220
- Lam, S.S. (1982) “Dynamic scaling and growth behavior of queueing network normalization constants,” J.ACM, 29, 492-513
- Lam, S.S. and Y.L. Lien (1983) “A tree convolution algorithm for the solution of queueing networks,” C.ACM 26, 203-15
- Lam, S.S. and J.W. Wong (1982) “Queueing network models of packet switching networks. Part 2: Networks with population size constraints,” Performance Evaluation, 2: 3, 161-80
- Lavenberg, S.S. (ed.) (1983) Computer performance modeling handbook. New York: Academic Press
- Reiser, M. and H. Kobayashi (1975) “Queueing networks with multiple closed chains; Theory and computational algorithms,” IBM J. Res. and Dev., 19, 283-94
- Reiser, M. and S.S. Lavenberg (1980) “Mean value analysis of closed multichain queueing networks,” J. ACM 27 313-22
- Sauer, C.H. and K.M. Chandy (1981) Computer systems perfonnance modeling. Englewood Cliffs, NJ: Prentice-Hall.