M. Reiser
Abstract
It is shown that mean queue sizes, mean waiting times, and throughputs in closed multiple-chain queuing networks which have product-form solution can be computed recursively without computing product terms and normalization constants. The resulting computational procedures have improved properties (avoidance of numerical problems and, in some cases, fewer operations) compared to previous algorithms. Furthermore, the new algorithms have a physically meaningful interpretation which provides the basis for heuristic extensions that allow the approximate solution of networks with a very large number of closed chains, and which is shown to be asymptotically valid for large chain populations.
- 1 BARD, Y The modehng of some scheduling strategies for an mteractwe computer system In Computer Performance, K M. Chandy and M Relser, Eds., North Holland, Amsterdam, 1977, pp 113-137.Google Scholar
- 2 BASKETT, F, CHANDY, K M., MUNTZ, R R., AND PALACIOS, F G Open, closed, and mtxed networks of queues with different classes of customers J A CM 22, 3 (Apr 1975), 248-260 Google Scholar
- 3 BOUHANA, J. Operational aspects of centrahzed queumg networks Ph D Th, U of Wisconsin, Madtson, Wls, Jan. 1978. Google Scholar
- 4 BUZEN, J P ComputaUonal algonthms for closed queuing networks wtth exponential servers Comm. A CM 16, 9 (Sept. 1973), 527-531. Google Scholar
- 5 Cox, D.R. A use of complex probabilities in the theory of stochastic processes. Pro(:. Cambridge Phil. Soc. M (1955), 313-319.Google Scholar
- 6 GORDON, W. T., AND NEWELL, G.F. Closed queuing systems with exponential servers. Operaoons Res 15 (Apr. 1967), 252-265.Google Scholar
- 7 JACKSON, J.R. Jobshop-fike queuing systems. Management Sci. 10 (Oct 1963), 131-142.Google Scholar
- 8 LAVENBERO, S. S, AND REISER, M. Stauonary state probabilities of arrival instants for closed queumg network with mulOple types of customers. Res. Pep RC 7592, IBM Thomas J. Watson Res. Ctr., Yorktown Heights, N.Y Apr. 1979. To appear in J. Appl. Prob, (Dec. 1980).Google Scholar
- 9 NEtrrs, M. F Probabdity dtstributtons of phase type To appear m Liber Amicorum, Leuven, Belgium.Google Scholar
- 10 PITTEL, B. Closed exponential networks of queues with blocking, the Jackson type stationary dtstnbuuon and its asymptotic analysts Res. Rep RC 6174, IBM Thomas J. Watson Res. Ctr, Yorktown Heights, N Y., 1976Google Scholar
- 11 RelsvR,M Numerical methods m separable queuing networks. Stu&es m Management Sa 7 (1977), 113- 142Google Scholar
- 12 Rtls~R, M. A queuing network analysis of computer ~ommumcation networks with window flow control IEEE Trans. Commun. 27 (Aug. 1979), 1199-1209.Google Scholar
- 13 REISVR, M, AND KOBAYASHI, H Homer's rule for the evaluaaon of general dosed queuing networks Comm. ACM 18, 10 (Oct. 1975), 592-593. Google Scholar
- 14 REIS~R, M., AND KOBAYASHI, H Queuing networks with multiple closed chains, theory and computauonal algorithms IBM J Res and Develop 19 (May 1975), 283-294.Google Scholar
- 15 SHUM, A.Queuing models for computer systems with general service tune dtstnbuuons Ph D Th, Harvard U, Cambridge, Mass, Dec. 1976Google Scholar
Index Terms
Mean-Value Analysis of Closed Multichain Queuing Networks
Recommendations
Approximate mean value analysis algorithms for queuing networks: existence, uniqueness, and convergence results
This paper is concerned with the properties of nonlinear equations associated with the Scheweitzer-Bard (S-B) approximate mean value analysis (MVA) heuristic for closed product-form queuing networks. Three forms of nonlinear S-B approximate 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 ...
The cyclic queue and the tandem queue
We consider a closed queueing network, consisting of two FCFS single server queues in series: a queue with general service times and a queue with exponential service times. A fixed number $$N$$ N of customers cycle through this network. We determine the joint ...
Comments