On the convolution algorithm for separable queuing networks

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

On the convolution algorithm for separable queuing networks

Full text

Pdf (512 KB)

Source

Joint International Conference on Measurement and Modeling of Computer Systems archive
Proceedings of the 1976 ACM SIGMETRICS conference on Computer performance modeling measurement and evaluation table of contents

Cambridge, Massachusetts, United States

Pages: 109 - 117

Year of Publication: 1976

Authors

M. Reiser
H. Kobayashi

Sponsors

IFIP WG 7.3 : IFIP WG 7.3
SIGMETRICS: ACM Special Interest Group on Measurement and Evaluation

Publisher

ACM New York, NY, USA

Bibliometrics

Downloads (6 Weeks): 6, Downloads (12 Months): 17, Citation Count: 7

Additional Information:

abstract references cited by index terms collaborative colleagues

Tools and Actions:	Request Permissions Review this Article Save this Article to a Binder Display Formats: BibTeX EndNote ACM Ref

DOI Bookmark:	Use this link to bookmark this Article: http://doi.acm.org/10.1145/800200.806187 What is a DOI?

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.

REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

	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.
	2	M. Reiser, "QNET4 User's Guide", IBM Research Report RA 71, June 1975.
	3	Forest Baskett , K. Mani Chandy , Richard R. Muntz , Fernando G. Palacios, Open, Closed, and Mixed Networks of Queues with Different Classes of Customers, Journal of the ACM (JACM), v.22 n.2, p.248-260, April 1975 [doi>10.1145/321879.321887]
	4	F.R. Moore, "Computational Model of a Closed Queuing Network with Exponential Servers," IBM J. Res. Dev., 16, November 1972, pp. 567-572.
	5	S.S. Lam, "On an Extension of Moore's Results for Closed Queuing Networks," IBM Research Report, April 9, 1975.
	6	Jeffrey P. Buzen, Computational algorithms for closed queueing networks with exponential servers, Communications of the ACM, v.16 n.9, p.527-531, Sept. 1973 [doi>10.1145/362342.362345]
	7	M. Reiser and H. Kobayashi, "Recursive Algorithms for General Queuing Networks with Exponential Servers," IBM Res. Report, RC-4254, March 1973.
	8	M. Reiser , H. Kobayashi, Horner's rule for the evaluation of general closed queueing networks, Communications of the ACM, v.18 n.10, p.592-593, Oct. 1975 [doi>10.1145/361020.361217]
	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.
	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.
	11	M. Reiser, "Numerical Methods in Separable Queuing Networks", IBM Research Report
	12	Lin Woo, private communication (see also ref. 1).

CITED BY 7

	John Zahorjan, An exact solution method for the general class of closed separable queueing networks, ACM SIGMETRICS Performance Evaluation Review, v.8 n.3, p.107-112, Fall 1979
	Karen D. Gordon , Lawrence W. Dowdy, The impact of certain parameter estimation errors in queueing network models, ACM SIGMETRICS Performance Evaluation Review, v.9 n.2, p.3-9, Summer 1980
	J. C. Browne, A critical overview of computer performance evaluation, Proceedings of the 2nd international conference on Software engineering, p.138-145, October 13-15, 1976, San Francisco, California, United States
	John Zahorjan , Eugene Wong, The solution of separable queueing network models using mean value analysis, ACM SIGMETRICS Performance Evaluation Review, v.10 n.3, p.80-85, Fall 1981
	Martin G. Kienzle , K. C. Sevcik, Survey of analytic queueing network models of computer systems, ACM SIGSIM Simulation Digest, v.11 n.1, p.113-129, Fall 1979
	E. de Souza e Silva , R. Muntz, Simple Relationships Among Moments of Queue Lengths in Product form Queueing Networks, IEEE Transactions on Computers, v.37 n.9, p.1125-1129, September 1988
	Hai Wang , Kenneth C. Sevcik , Giuseppe Serazzi , Shouhong Wang, The general form linearizer algorithms: A new family of approximate mean value analysis algorithms, Performance Evaluation, v.65 n.2, p.129-151, February, 2008