RECAL—a new efficient algorithm for the exact analysis of multiple-chain closed queuing networks

Full Text: PDFPDF Buy this ArticleBuy this Article
Authors: A. E. Conway Univ. of Ottawa, Ont., Canada
N. D. Georganas Univ. of Ottawa, Ont., Canada
Published in:
· Journal
Journal of the ACM (JACM) JACM Homepage archive
Volume 33 Issue 4, Oct. 1986
Pages 768-791
ACM New York, NY, USA
table of contents doi>10.1145/6490.6495
RECAL—a new efficient algorithm for the exact analysis of multiple-chain closed queuing networks Published by ACM 1986 Article
Bibliometrics Data  Bibliometrics
· Downloads (6 Weeks): 0
· Downloads (12 Months): 7
· Downloads (cumulative): 365
· Citation Count: 22


Tools and Resources

Share:

|
feedback Feedback | Switch to single page view (no tabs)

Powered by The ACM Guide to Computing Literature


The ACM Digital Library is published by the Association for Computing Machinery. Copyright © 2013 ACM, Inc.
Terms of Usage   Privacy Policy   Code of Ethics   Contact Us

Useful downloads: Adobe Acrobat    QuickTime    Windows Media Player    Real Player
The ACM Guide to Computing Literature
All Tags
Export Formats
 
 
Save to Binder