[1] F. Baskett, K. M. Chandy, R. R. Muntz, and F. G. Palacios, F. G., "Open, closed, and mixed networks of queues with different classes of customers," J. ACM 22, 2, April 1975, pp. 248 260. [2] S. C. Bruell and G. Balbo, Computational Algorithms for Closed Queueing Networks, North Holland, New York, 1980. [3] E. D. Lazowska, J. Zahorjan, S. Graham, and K. C. Sevcik, Quantitative System Performance: Computer System Analysis Using Queueing Network Models, Prentice-Hall, Upper Saddle River, New Jersey, 1984. [4] D. A. Menascé, V. A. F. Almeida, and L. W. Dowdy, Capacity Planning and Performance Modeling: From Mainframes to Client-Server Systems, Prentice-Hall, Upper Saddle River, New Jersey, 1994. [5] M. Reiser and S. Lavenberg, "Mean value analysis of closed multichain queueing networks," J. ACM 27, 2, April 1980, pp. 313 322. [6] K. C. Sevcik and I. Mitrani, "The distribution of queueing network states at input and output instants," J. ACM 28, 2, April 1981, pp. 358 371. [7] W. Wang and K. C. Sevcik, "Experiments with improved approximate mean value analysis algorithms," Performance Evaluation 39, 1, February 2000, pp. 189 206. [8] J. Zahorjan, K. C. Sevcik, D. L. Eager, and B. I. Galler, "Balanced job bound analysis of queueing networks," Comm. ACM 25, 2, February 1982, pp. 134 141. |