| Computational algorithms for closed queueing networks with exponential servers |
| Full text |
Pdf
(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
|
|
| Publisher |
|
| Bibliometrics |
Downloads (6 Weeks): 15, Downloads (12 Months): 98, Citation Count: 125
|
|
|
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
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
Raymond M. Bryant , Anthony E. Krzesinski , Peter Teunissen, The MVA Pre-empt resume priority approximation, Proceedings of the 1983 ACM SIGMETRICS conference on Measurement and modeling of computer systems, p.12-27, August 29-31, 1983, Minneapolis, Minnesota, United States
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
Wei-hsing Wang , Meichun Hsu , Eugene Pinsky, Modeling hot spots in database systems (extended abstract), Proceedings of the tenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems, p.82-91, May 29-31, 1991, Denver, Colorado, United States
|
|
|
|
|
|
G. Varghese , W. Chou , A. A. Nilsson, Queueing delays on virtual circuits using a sliding window flow control scheme, Proceedings of the 1983 ACM SIGMETRICS conference on Measurement and modeling of computer systems, p.275-281, August 29-31, 1983, Minneapolis, Minnesota, United States
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
Rusty O. Baldwin , Nathaniel J. Davis, IV , Scott F. Midkiff , John E. Kobza, Queueing network analysis: concepts, terminology, and methods, Journal of Systems and Software, v.66 n.2, p.99-117, 15 May 2003
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
Hisham M. Almasaeid , Ahmed E. Kamal, Data delivery in fragmented wireless sensor networks using mobile agents, Proceedings of the 10th ACM Symposium on Modeling, analysis, and simulation of wireless and mobile systems, October 22-26, 2007, Chania, Crete Island, Greece
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
W. C. Brantley, Jr. , G. W. Leive , D. P. Siewiorek, Decomposition of data flow graphs on multiprocessors, Proceedings of the June 13-16, 1977, national computer conference, June 13-16, 1977, Dallas, Texas
|
|
|
|
|