John Zahorjan
Abstract
Because it is more intuitively understandable than the previously existing convolution algorithms, Mean Value Analysis (MVA) has gained great popularity as an exact solution technique for separable queueing networks. However, the derivations of MVA presented to date apply only to closed queueing network models. Additionally, the problem of the storage requirement of MVA has not been dealt with satisfactorily. In this paper we address both these problems, presenting MVA solutions for open and mixed load independent networks, and a storage maintenance technique that we postulate is the minimum possible of any “reasonable” MVA technique.
- 1 Baskett, F., Chandy, K.M., Muntz, R.R., and Palacios, F., "Open, closed and mixed networks of queues with different classes of customers", J. ACM 22,2 (April 1975), 248-260. Google Scholar
Digital Library
- 2 Bruell, S.C., "On single and multiple job class queueing network models of computer systems", Ph.D. Thesis, Purdue University, December 1978. Google ScholarDigital Library
- 3 Brumfeld, J., Technical Report, Purdue University, to appear.Google Scholar
- 4 Buzen, J.P., "Computational algorithms for closed queueing networks with exponential servers", Comm. ACM 16,9 (Sept. 1973), 527-531. Google ScholarDigital Library
- 5 Chandy, K.M., Herzog, U., and Woo, L.S., "Parametric analysis of queueing networks", IBM J. Res. Dev. 19 (Jan. 1975), 36-42.Google ScholarDigital Library
- 6 Chandy, K.M., and Sauer, C.H., "Computational algorithms for product form queueing networks", Commun. ACM 20,10 (Oct. 1980), 573-583. Google ScholarDigital Library
- 7 Denning, P.J., and Buzen, J.P., "The operational analysis of queueing network models", ACM Comp. Surveys 10,3 (Sept. 1978), 225-262. Google ScholarDigital Library
- 8 Krzesinski, A.E., and Teunissen, P., "Efficient computational forms for the normalising constant and the statistical measures of mixed, multiclass queueing networks", Rpt. RW77-04, Dept. of Computer Science, Univ. of Stellenbosch, 1977.Google Scholar
- 9 Little, J.D.C., "A proof of the queueing formula L&equil;&lgr;W", Oper. Res. 9,3 (May 1961), 383-387.Google ScholarDigital Library
- 10 Muntz, R.R., "Poisson departure processes and queueing networks", 7th Annual Princeton Conf. on Inf. Sci. and Sys., March 1973.Google Scholar
- 11 Myhre, S., "Performance modelling of computer systems", M.Sc. Thesis, Univ. of Washington, 1979.Google Scholar
- 12 Reiser, M., and Kobayashi, H., "On the convolution algorithm for separable queueing networks", Proc. Int. Symp. CPMME 1976, 109-117. Google ScholarDigital Library
- 13 Reiser, M., and Lavenberg, S.S., "Mean value analysis of closed multichain queueing networks", IBM Res. Rpt. RC 7023, 1978.Google Scholar
- 14 Reiser, M., and Lavenberg. S.S., "Mean value analysis of closed multichain queueing networks", J. ACM 27,2 (April 1980), 313-322. Google ScholarDigital Library
- 15 Schwetman, H., "Implementing the mean value algorithm for the solution of queueing network models", Tech. Rpt. CSD-TR 355, Dept. of Computer Sciences, Purdue Univ., Dec. 1980.Google Scholar
- 16 Sevcik, K.C., and Mitrani, I., "The distribution of queueing network states at input and output instants", J. ACM 28,2 (April 1981), 358-371. Google ScholarDigital Library
- 17 Zahorjan, J., "The approximate solution of large queueing network models", Tech. Rpt. CSRG-122, Comp. Sys. Res. Grp., Univ. of Toronto, 1980.Google Scholar
Index Terms
The solution of separable queueing network models using mean value analysis
Recommendations
The solution of separable queueing network models using mean value analysis
Because it is more intuitively understandable than the previously existing convolution algorithms, Mean Value Analysis (MVA) has gained great popularity as an exact solution technique for separable queueing networks. However, the derivations of MVA ...
Queue decomposition & finite closed queueing network models
Closed, finite queueing networks are applicable to many different manufacturing and service system settings. The incorporation of material handling and transportation networks in finite buffer closed queueing networks is studied. A novel queue ...
A matrix-analytic solution for the DBMAP/PH/1 priority queue
Priority queueing models have been commonly used in telecommunication systems. The development of analytically tractable models to determine their performance is vitally important. The discrete time batch Markovian arrival process ( DBMAP ) has been ...
Comments