ACM Home Page
Please provide us with feedback. Feedback
Computational algorithms for closed queueing networks with exponential servers
Full text PdfPdf (450 KB)
Source
Communications of the ACM archive
Volume 16 ,  Issue 9  (September 1973) table of contents
Pages: 527 - 531  
Year of Publication: 1973
ISSN:0001-0782
Author
Jeffrey P. Buzen  Harvard Univ., Cambridge, MA
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 15,   Downloads (12 Months): 98,   Citation Count: 125
Additional Information:

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

ABSTRACT

Methods are presented for computing the equilibrium distribution of customers in closed queueing networks with exponential servers. Expressions for various marginal distributions are also derived. The computational algorithms are based on two-dimensional iterative techniques which are highly efficient and quite simple to implement. Implementation considerations such as storage allocation strategies and order of evaluation are examined in some detail.


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
Buzen, J.P. Queueing Network Models of Multiprogramming. Ph.D. Thesis, Div. of Engineering and Applied Physics. (NTIS AD 731 575 August 1971) Harvard U., Cambridge, Mass., May 1971.
 
3
Buzen, J.P. Optimizing the degree of multiprogramming in demand paging systems. Proc. IEEE-CS Conf. 1971 (71 C41-C), IEEE, New York, Sept. 1971, 139-140.
 
4
Gordon, W.J., and Newell, G.F. Closed queuing systems with exponential servers. Oper. Res. 15, 2 (Apr. 1967), 254-265.
 
5
Jackson, J.R. Jobshop-like queueing systems. Management Sci. 10, 1 (Oct. 1963), 131-142.
 
6

CITED BY  125