The Distribution of Queuing Network States at Input and Output Instants

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

The Distribution of Queuing Network States at Input and Output Instants

Full text

Pdf (898 KB)

Source

Journal of the ACM (JACM) archive
Volume 28 , Issue 2 (April 1981) table of contents

Pages: 358 - 371

Year of Publication: 1981

ISSN:0004-5411

Authors

K. C. Sevcik	Computer Systems Research Group, University of Toronto, 121 St. Joseph Street, Toronto, Ontario, Canada M5S 1A1
I. Mitrani	University of Newcastle-upon-Tyne, England NE1 7RU

Publisher

ACM New York, NY, USA

Bibliometrics

Downloads (6 Weeks): 5, Downloads (12 Months): 70, Citation Count: 26

Additional Information:

references cited by index terms collaborative colleagues peer to peer

Tools and Actions:	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/322248.322257 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	BARBOUR, A D Networks of queues and the method of stages Adv AppL Prob 8, 3 (Sept 1976), 584-591
	2	Yonathan Bard, Some Extensions to Multiclass Queueing Network Analysis, Proceedings of the Third International Symposium on Modelling and Performance Evaluation of Computer Systems: Performance of Computer Systems, p.51-62, February 06-08, 1979
	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	BURKE, P.J Proof of a conjecture on the mterarnval time distribution m an M/M/I queue with feedback IEEE Trans. Comput TC 24, 5 (May 1976), 575-576
	5	BUZEN, J P, AND DENNING, P J Operational treatment of queueing distributions and mean value analysis Tech Rep, Computer Science Dep, Purdue Univ., Lafayette, lnd, Aug, 1979
	6	K. Mani Chandy , John H. Howard, Jr. , Donald F. Towsley, Product Form and Local Balance in Queueing Networks, Journal of the ACM (JACM), v.24 n.2, p.250-263, April 1977 [doi>10.1145/322003.322009]
	7	CHANDY, K M In preparation.
	8	CINLAR, E.Introduction to Stochastic Processes Prentice-Hall, Englewood Cliffs, N.J., 1975
	9	COOPER, R B Introductlon to Queuemg Theory. MacMillan Publishing Co, New York, 1972
	10	Cox, DR A use of complex probabilities in the theory of stochastic processes Proc. Cambridge Phd Soc. 51 (1955), 313-319
	11	DISNEY, R L Random flow m queuemg networks" A review and crmque AIIE Trans. 7, 3 (Sept 1975) 268-288
	12	DISNEY, R L, AND McNICKLE, D C The M/G/I queue with instantaneous Bernoulli feedback Tech Rep 77-4, Dep of Industrial and Operational Engineering, Umv of Michigan, Ann Arbor, Mich, Aprd 1977.
	13	GORDON, W J, AND NEWELL, G F.Closed queuemg systems w~th exponential servers Oper Res 15 (1967), 254-265
	14	JACKSON, J R Networks of waiting lines Oper Res 5 (1957), 518-521
	15	JACKSON, J.R Jobshop-hke queuemg systems Manage Sct. 10, 1 (Oct 1963), 131-142
	16	KELLY, F.P Networks of queues w~th customers of different classes J Appl Prob 12 (1975), 542- 554.
	17	KELLY, F.P Networks of queues Adv AppL Prob 8, 2 (June 1976), 416-432
	18	KOBAYASHI, H, AND REISER, M On generalization of job routing behavior in a queuelng network model Res Rep RC5252, IBM homas J. Watson Research Center, Yorktown Heights, N Y, Feb 1975
	19	LAM, S.S Queuemg networks with population size constraints IBM J Res Devel 21, 4 (July 1977), 370-378
	20	LAVENBERG, S S, AND REISER, M.Stattonary state probabdmes at arrival instants for dosed queuemg networks w~th muluple types of customers. Res Rep. RC7592, IBM Thomas J Watson Research Center, Yorktown Heights, N Y, April, 1979
	21	LEMOINE, A J Networks of queues--a survey of equdtbnum results Manage Sci 24, 4 (Dec 1977), 464--481
	22	MELAMED, B On Markov jump processes imbedded at jump epochs and thetr queuemg-theorettc apphcauons, Dep. of Industrial Engmeermg and Management Sctences, Northwestern Univ, Nov. 1978
	23	I. Mitrani, Nonpriority Multiprogramming Systems Under Heavy Demand Conditions—Customers' Viewpoint, Journal of the ACM (JACM), v.19 n.3, p.445-452, July 1972 [doi>10.1145/321707.321715]
	24	REISER, M, AND KOBAYASHI, H. Numertcal soluuon of semi-closed exponenual server queuemg networks. Proc 7th Asdomar Conf, Asdomar~ Cahf, 1973, pp 308-312.
	25	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]
	26	Martin Reiser, Mean Value Analysis fo Queueing Networks - A New Look at an Old Problem, Proceedings of the Third International Symposium on Modelling and Performance Evaluation of Computer Systems: Performance of Computer Systems, p.63-77, February 06-08, 1979

CITED BY 26

	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
	Isi Mitrani , Philippe Robert, On the ASTA property in a feedback processor-sharing queue, Performance Evaluation, v.58 n.1, p.81-85, October 2004
	Brigitte Plateau , Andreas Staphylopatis, Modelling of the parallel resolution of a numerical problem on a locally distributed computing system, ACM SIGMETRICS Performance Evaluation Review, v.11 n.4, December 1982
	Michael A. Zazanis, The Time-To-Empty For Tandem Jackson Networks, Probability in the Engineering and Informational Sciences, v.18 n.4, p.493-502, October 2004
	O. J. Boxma , F. P. Kelly , A. G. Konheim, The Product Form for Sojourn Time Distributions in Cyclic Exponential Queues, Journal of the ACM (JACM), v.31 n.1, p.128-133, Jan. 1984
	Daniel A. Menascé , Odysseas I. Pentakalos , Yelena Yesha, An analytic model of hierarchical mass storage systems with network-attached storage devices, ACM SIGMETRICS Performance Evaluation Review, v.24 n.1, p.180-189, May 1996
	D. Neuse , K. Chandy, SCAT: A heuristic algorithm for queueing network models of computing systems, ACM SIGMETRICS Performance Evaluation Review, v.10 n.3, p.59-79, Fall 1981
	K. Mani Chandy , Doug Neuse, Linearizer: a heuristic algorithm for queueing network models of computing systems, Communications of the ACM, v.25 n.2, p.126-134, Feb 1982
	Jogesh K. Muppala , Kishor S. Trivedi , Steven P. Woolet, Real-time Systems Performance in the Presence of Failures, Computer, v.24 n.5, p.37-47, May 1991
	V. W. Mak , S. F. Lundstrom, Predicting Performance of Parallel Computations, IEEE Transactions on Parallel and Distributed Systems, v.1 n.3, p.257-270, July 1990
	Elizabeth Varki, Mean value technique for closed fork-join networks, ACM SIGMETRICS Performance Evaluation Review, v.27 n.1, p.103-112, June 1999
	Michael L. Fontenot, Software Congestion, Mobile Servers, and the Hyperbolic Model, IEEE Transactions on Software Engineering, v.15 n.8, p.947-962, August 1989
	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
	Charles Knessl, On the sojourn time distribution in a finite capacity processor shared queue, Journal of the ACM (JACM), v.40 n.5, p.1238-1301, Nov. 1993
	Hans Daduna , Stephan Meyer, Individual customer’s behaviour in networks with state-dependent arrival rates, Queueing Systems: Theory and Applications, v.32 n.4, p.351-362, 1999
	G. Balbo , S. C. Bruell , M. Sereno, Arrival theorems for product-form stochastic Petri nets, ACM SIGMETRICS Performance Evaluation Review, v.22 n.1, p.87-97, May 1994
	Ian F. Akyildiz, Mean Value Analysis for Blocking Queueing Networks, IEEE Transactions on Software Engineering, v.14 n.4, p.418-428, April 1988
	Hans Daduna, The joint distribution of sojourn times for a customer traversing an overtake–free series of queues: The discrete time case, Queueing Systems: Theory and Applications, v.27 n.3-4, p.297-323, 1997
	James McKenna, Asymptotic expansions of the sojourn time distribution functions of jobs in closed, product-form queuing networks, Journal of the ACM (JACM), v.34 n.4, p.985-1003, Oct. 1987
	Raymond M. Bryant , Anthony E. Krzesinski , M. Seetha Lakshmi , K. Mani Chandy, The MVA priority approximation, ACM Transactions on Computer Systems (TOCS), v.2 n.4, p.335-359, Nov. 1984
	Michael A. Zazanis, Formulas and representations for cyclic Markovian networks via Palm calculus, Queueing Systems: Theory and Applications, v.26 n.1-2, p.151-167, 1997
	Peter G. Harrison, The representation of multistage interconnection networks in queuing models of parallel systems, Journal of the ACM (JACM), v.37 n.4, p.863-898, Oct. 1990
	Yong Tan , Vijay S. Mookerjee, Allocating Spending Between Advertising and Information Technology in Electronic Retailing, Management Science, v.51 n.8, p.1236-1249, August 2005
	Matthew I. Frank , Anant Agarwal , Mary K. Vernon, LoPC: modeling contention in parallel algorithms, ACM SIGPLAN Notices, v.32 n.7, p.276-287, July 1997
	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
	Randolph D. Nelson, The mathematics of product form queuing networks, ACM Computing Surveys (CSUR), v.25 n.3, p.339-369, Sept. 1993