ACM Home Page
Please provide us with feedback. Feedback
Open, Closed, and Mixed Networks of Queues with Different Classes of Customers
Full text PdfPdf (901 KB)
Source Journal of the ACM (JACM) archive
Volume 22 ,  Issue 2  (April 1975) table of contents
Pages: 248 - 260  
Year of Publication: 1975
ISSN:0004-5411
Authors
Forest Baskett  Departments of Computer Science and Electrical Engineering, Stanford University, Stanford, CA
K. Mani Chandy  Department of Computer Sciences, University of Texas at Austin, Austin, TX
Richard R. Muntz  Department of Computer Science, University of California, Los Angeles, CA
Fernando G. Palacios  Department of Computer Sciences, University of Texas at Austin, Austin, TX
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 41,   Downloads (12 Months): 333,   Citation Count: 286
Additional Information:

references   cited by   index terms   collaborative colleagues  

Tools and Actions: Request Permissions Request Permissions    Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/321879.321887
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
 
2
BASKETT, F., ~tND PALACZOS, F G. Processor shanng in a central server queueing model of mtfltaprogrammmg with apphcations. Proc. Sixth Annual Princeton Conference on Information Sciences and Systems, Princeton U, Princeton, N j. March 1972, pp. 598-603.
 
3
BUZEN, J. Queueing network models of multiprogramming. Ph.D. Th., Div. of Eng. and Appl. Sci., Harvard. U., Cambridge, Mass, 1971.
4
 
5
CHANDY, K. M The analysis and solutions for general queueing networks Proc. Sixth Annual Princeton Conference on Information Sciences and Systems, Princeton U,, Princeton, N. J., March 1972, pp. 224-228.
6
 
7
Cox, D.R. A use of complex probabilities m the theory of stochastic processes. Proc. Cambr~.dge Phd. Soc. 51 (1955), 313-319
 
8
F~:LLER, W. An Introduction to Probab~hty Theory and Its Apphcat~ons, Vol. 1, 3rd ed Wiley, New York, 1968.
 
9
F~:RDINAND, A.E. An analysis of the machine interference model IBM Syst. J. 10, 2 (1971), 129-142.
 
10
GORDON, W J, AND NEWELL, G F. Closed queuemg systems with exponential servers Oper Res 15 (1967), 254-265
 
11
JACKSON, J R Jobshop-like queueing systems Manage. Sc~ 10, 1 (Oct 1963), 131-142
 
12
L,~VENBERO, S. S Queueing analysls of a multlprogrammed computer system having a multilevel storage hierarchy. SIAM J Comput 2, 4 (1973), 232-252.
 
13
MOORE, C G, III Network models for large-scale time-sharing systems Tech. Rep. No. 71-1, Dep. of Ind Eng, U of Michigan, Ann Arbor, Mich., April 1971
 
14
 
15
POSNER, M., AND BERNHOLTZ, B Closed fimte queuemg networks with time lags and with several classes of units Oper Res. 16 (1968), 977-985.
 
16
S.~KATA, M., NOGUCHI, S., AND OIZUMI, J Analysm of a processor-shared queueing model for time-sharing systems Proc Second Hawaii Internatmnal Conference on System Scmnces, U. of Hawaii, Hono}ulu, Hawaii, Jan 1969, pp 625-628.
 
17
WHITTLE, P Nonhnear migration processes. Internat. Stalzst Inst Bull ~2, Bk. 1 (1969), 642- 647.
 
18
rHITTLE, P. Equilibrium dlstnbutmns for an open mlgratmn process. J A ppl. Probabd. 5

CITED BY  286

Collaborative Colleagues:
Forest Baskett: colleagues
K. Mani Chandy: colleagues
Richard R. Muntz: colleagues
Fernando G. Palacios: colleagues