Balanced job bound analysis of queueing networks

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

Balanced job bound analysis of queueing networks

Full text

Pdf (538 KB)

Source

Communications of the ACM archive
Volume 25 , Issue 2 (February 1982) table of contents

Pages: 134 - 141

Year of Publication: 1982

ISSN:0001-0782

Authors

John Zahorjan	Univ. of Washington, Seattle
Kenneth C. Sevcik	Univ. of Toronto, Toronto, Ont., Canada
Derek L. Eager	Univ. of Toronto, Toronto, Ont., Canada
Bruce Galler	Univ. of Toronto, Toronto, Ont., Canada

Publisher

ACM New York, NY, USA

Bibliometrics

Downloads (6 Weeks): 2, Downloads (12 Months): 18, Citation Count: 28

Additional Information:

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/358396.358447 What is a DOI?

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	Au, M. Some properties of queueing network models. M.Sc. Thesis, Univ. of Toronto, Toronto, Canada, 1981.
	2	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]
	3	Peter J. Denning , Jeffrey P. Buzen, The Operational Analysis of Queueing Network Models, ACM Computing Surveys (CSUR), v.10 n.3, p.225-261, Sept. 1978 [doi>10.1145/356733.356735]
	4	Kleinrock, L. Queueing Systems: Volume 2. John Wiley & Sons, New York, 1976.
	5	Little, J.D.C. A proof of the queueing formula L = W. Oper. Res. 9, (1961), 383-387.
	6	Muntz, R.R., and Wong, J. Asymptotic properties of closed queueing network models. Proc. of the 8th Annual Princeton Conf. on Info. Sci. and Systems, Princeton University (March 1974).
	7	M. Reiser , S. S. Lavenberg, Mean-Value Analysis of Closed Multichain Queuing Networks, Journal of the ACM (JACM), v.27 n.2, p.313-322, April 1980 [doi>10.1145/322186.322195]
	8	Sevcik, K.C., Graham, G.S., and Zahorjan, J. Configuration and capacity planning in a distributed processing system. Proc. CPEUG 80, NBS Special Publ. 500-65, 165-171.

CITED BY 28

	K. K. Ramakrishnan , R. Jain, A binary feedback scheme for congestion avoidance in computer networks with a connectionless network layer, ACM SIGCOMM Computer Communication Review, v.18 n.4, p.303-313, August 1988
	K. R. Pattipati , M. M. Kostreva , J. L. Teele, Approximate mean value analysis algorithms for queuing networks: existence, uniqueness, and convergence results, Journal of the ACM (JACM), v.37 n.3, p.643-673, July 1990
	Charles E. Knadler, Jr., The robustness of separable queueing network models, Proceedings of the 23rd conference on Winter simulation, p.661-668, December 08-11, 1991, Phoenix, Arizona, United States
	Hiroshi Kobayashi , Mario Gerla, Optimal routing in closed queuing networks, ACM Transactions on Computer Systems (TOCS), v.1 n.4, p.294-310, Nov. 1983
	Yves Dallery , Rajan Suri, Approximate disaggregation and performance bounds for queueing networks with multiple-server stations, ACM SIGMETRICS Performance Evaluation Review, v.14 n.1, p.111-128, May 1986
	Charles E. Knadler, Jr. , Ralph M. May, Using simulation to evaluate analytic models of memory queueing, Proceedings of the 24th conference on Winter simulation, p.1242-1248, December 13-16, 1992, Arlington, Virginia, United States
	J. McKenna , Debasis Mitra, Asymptotic Expansions and Integral Representations of Moments of Queue Lengths in Closed Markovian Networks, Journal of the ACM (JACM), v.31 n.2, p.346-360, April 1984
	Derek L. Eager , Kenneth C. Sevcik, Bound hierarchies for multiple-class queuing networks, Journal of the ACM (JACM), v.33 n.1, p.179-206, Jan. 1986
	C.-H. Hsieh , S. S. Lam, PAM-a noniterative approximate solution method for closed multichain queueing networks, ACM SIGMETRICS Performance Evaluation Review, v.16 n.1, p.261-269, May 1988
	Y. C. Tay , Rajan Suri, Error bounds for performance prediction in queuing networks, ACM Transactions on Computer Systems (TOCS), v.3 n.3, p.227-254, Aug. 1985
	K. K. Ramakrishnan , R. Jain, A binary feedback scheme for congestion avoidance in computer networks, ACM Transactions on Computer Systems (TOCS), v.8 n.2, p.158-181, May 1990
	Lawrence W. Dowdy , Brian M. Carlson , Alan T. Krantz , Satish K. Tripathi, Single-class bounds of multi-class queuing networks, Journal of the ACM (JACM), v.39 n.1, p.188-213, Jan. 1992
	Y. c. Tay , HweeHwa Pang, Load Sharing in Distributed Multimedia-on-Demand Systems, IEEE Transactions on Knowledge and Data Engineering, v.12 n.3, p.410-428, May 2000
	Elizabeth Varki , Lawrence W. Dowdy, Analysis of balanced fork-join queueing networks, ACM SIGMETRICS Performance Evaluation Review, v.24 n.1, p.232-241, May 1996
	Rajan Suri, Robustness of queuing network formulas, Journal of the ACM (JACM), v.30 n.3, p.564-594, July 1983
	Arjan J. C. van Gemund, Symbolic Performance Modeling of Parallel Systems, IEEE Transactions on Parallel and Distributed Systems, v.14 n.2, p.154-165, February 2003
	Derek L. Eager , Kenneth C. Sevcik, Performance bound hierarchies for queueing networks, ACM Transactions on Computer Systems (TOCS), v.1 n.2, p.99-115, May 1983
	Daniel A. Reed, Queueing network models of multimicrocomputer networks, Proceedings of the 1983 ACM SIGMETRICS conference on Measurement and modeling of computer systems, p.190-197, August 29-31, 1983, Minneapolis, Minnesota, United States
	John Zahorjan , Edward D. Lazowska, Incorporating load dependent servers in approximate mean value analysis, ACM SIGMETRICS Performance Evaluation Review, v.12 n.3, p.52-62, August 1984
	Charles Knessl , Charles Tier, Asymptotic Expansions for Large Closed Queueing Networks with Multiple Job Classes, IEEE Transactions on Computers, v.41 n.4, p.480-488, April 1992
	D. L. Eager , K. C. Sevcik, Performance bound hierarchies for queueing networks, ACM SIGMETRICS Performance Evaluation Review, v.11 n.4, December 1982
	Lindsey E. Stephens , Lawrence W. Dowdy, Convolutional bound hierarchies, ACM SIGMETRICS Performance Evaluation Review, v.12 n.3, p.120-133, August 1984
	Giuliano Casale, An efficient algorithm for the exact analysis of multiclass queueing networks with large population sizes, ACM SIGMETRICS Performance Evaluation Review, v.34 n.1, June 2006
	K. R. Pattipati , M. M. Kostreva, On the properties of approximate mean value analysis algorithms for queueing networks, ACM SIGMETRICS Performance Evaluation Review, v.16 n.1, p.244-252, May 1988
	Kenneth C. Sevcik, Data base system performance prediction using an analytical model (invited paper), Proceedings of the seventh international conference on Very Large Data Bases, p.182-198, September 09-11, 1981, Cannes, France
	Marin Litoiu, A performance analysis method for autonomic computing systems, ACM Transactions on Autonomous and Adaptive Systems (TAAS), v.2 n.1, p.3-es, March 2007
	K. K. Ramakrishnan , Raj Jain, A binary feedback scheme for congestion avoidance in computer networks with a connectionless network layer, ACM SIGCOMM Computer Communication Review, v.25 n.1, p.138-156, Jan. 1995
	Arie Harel , Su Namn , Jacob Sturm, Simple bounds for closed queueing networks, Queueing Systems: Theory and Applications, v.31 n.1-2, p.125-135, 1999