Jeffrey P. Buzen
Abstract
Methods are presented for computing the equilibrium distribution of customers in closed queueing networks with exponential servers. Expressions for various marginal distributions are also derived. The computational algorithms are based on two-dimensional iterative techniques which are highly efficient and quite simple to implement. Implementation considerations such as storage allocation strategies and order of evaluation are examined in some detail.
- 1 Buzen, J.P. Analysis of system bottlenecks using a queueing network model. ACM-SIGOPS Workshop on System Performance Evaluation, ACM, New York, Apr. 1971, 82-103. Google Scholar
Digital Library
- 2 Buzen, J.P. Queueing Network Models of Multiprogramming. Ph.D. Thesis, Div. of Engineering and Applied Physics. (NTIS AD 731 575 August 1971) Harvard U., Cambridge, Mass., May 1971.Google Scholar
- 3 Buzen, J.P. Optimizing the degree of multiprogramming in demand paging systems. Proc. IEEE-CS Conf. 1971 (71 C41-C), IEEE, New York, Sept. 1971, 139-140.Google Scholar
- 4 Gordon, W.J., and Newell, G.F. Closed queuing systems with exponential servers. Oper. Res. 15, 2 (Apr. 1967), 254-265.Google ScholarDigital Library
- 5 Jackson, J.R. Jobshop-like queueing systems. Management Sci. 10, 1 (Oct. 1963), 131-142.Google ScholarDigital Library
- 6 Moore, C.G., III. Network Models for large-Scale Time- Sharing Systems. Ph.D. Thesis, Dept. of Industrial Engineering, (TR-71-1) U. of Michigan, Ann Arbor, Mich., Apr. 1971. Google ScholarDigital Library
Recommendations
Some Equivalence Results for Load-Independent Exponential Queueing Networks
In this paper we derive a number of results concerning the behavior of closed load-independent exponential queueing networks. It is shown that if the service rate of any station is increased (decreased), then the throughput of the network itself also ...
Robust Queueing Theory
We propose an alternative approach for studying queues based on robust optimization. We model the uncertainty in the arrivals and services via polyhedral uncertainty sets, which are inspired from the limit laws of probability. Using the generalized ...
Sojourn time approximations in queueing networks with feedback
This paper is motivated by the response-time analysis of distributed information systems, where transactions are handled by a sequence of front-end server and back-end server actions. We study sojourn times in an open queueing network with a single ...
Comments