M. Reiser
ABSTRACT
Research into queuing networks and their applications to computer systems is in a state of prosperity. The object of this paper is to discuss the computational aspect of separable queuing networks. Separable networks constitute that class of models for which a solution can be computed efficiently for fairly large problems. Open networks do not pose any computational problem. It is the case of closed networks where the subject of numerical algorithms becomes an issue.
In this paper, we shall take a fresh look at closed queuing networks, which we introduce as conditioned solution of suitably chosen open networks. This view will provide a probabilistic interpretation of what is normally called the normalization constant. Computational algorithms, then, result in a systematic way.
- 1.K.M. Chandy, U. Herzog and L. Woo, "Approximate Analysis of General Queuing Networks", IBM J. Res. and Develop., 19, January 1975, pp. 43-49.Google Scholar
Digital Library
- 2.M. Reiser, "QNET4 User's Guide", IBM Research Report RA 71, June 1975.Google Scholar
- 3.F. Baskett, K.M. Chandy, R.R. Muntz, and F.G. Palacios, "Open, Closed, and Mixed Networks of Queues with Different Classes of Customers," Journal of the ACM, April 1975. pp. 248-260 Google ScholarDigital Library
- 4.F.R. Moore, "Computational Model of a Closed Queuing Network with Exponential Servers," IBM J. Res. Dev., 16, November 1972, pp. 567-572.Google ScholarDigital Library
- 5.S.S. Lam, "On an Extension of Moore's Results for Closed Queuing Networks," IBM Research Report, April 9, 1975.Google Scholar
- 6.T.P. Buzen, "Computational Algorithms for Closed Queuing Networks with Exponential Servers," Communications of the ACM, 16, September pp. 527-531. Google ScholarDigital Library
- 7.M. Reiser and H. Kobayashi, "Recursive Algorithms for General Queuing Networks with Exponential Servers," IBM Res. Report, RC-4254, March 1973.Google Scholar
- 8.M. Reiser and H. Kobayashi, "Horner's Rule for the Evaluation of General Closed Queuing Networks," CACM, 18 October 1975, pp. 592-593. Google ScholarDigital Library
- 9.M. Reiser and H. Kobayashi, "Queuing Networks with Multiple Closed Chains: Theory and Computational Algorithms," IBM Research Report RC-4919, July, 1974, IBM Research Center, Yorktown Heights, New York Also in IBM Journal of Research and Development, May 1975. pp. 283-294.Google Scholar
- 10.M. Reiser and H. Kobayashi, "Numerical Methods in Queueing Networks", Proc. Camp. Sci and Statistics, 8th Annual Symp. of the Interface, (Univ. of California, Los Angelos), Feb. 1975.Google Scholar
- 11.M. Reiser, "Numerical Methods in Separable Queuing Networks", IBM Research ReportGoogle Scholar
- 12.Lin Woo, private communication (see also ref. 1).Google Scholar
Index Terms
On the convolution algorithm for separable queuing networks
Recommendations
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 ...
Improved lineariser methods for queueing networks with queue dependent centres
The Lineariser is an MVA-based technique developed for the approximate solution of large multiclass product form queueing networks. The Lineariser is capable of computing accurate solutions for networks of fixed rate centres. However, problems arise ...
Improved lineariser methods for queueing networks with queue dependent centres
The Lineariser is an MVA-based technique developed for the approximate solution of large multiclass product form queueing networks. The Lineariser is capable of computing accurate solutions for networks of fixed rate centres. However, problems arise ...
Comments