Computational algorithms for state-dependent queueing networks
- 1 February 1983
- journal article
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Computer Systems
- Vol. 1 (1) , 67-92
- https://doi.org/10.1145/357353.357359
Abstract
No abstract availableThis publication has 15 references indexed in Scilit:
- Dynamic Scaling and Growth Behavior of Queuing Network Normalization ConstantsJournal of the ACM, 1982
- SCATACM SIGMETRICS Performance Evaluation Review, 1981
- Computational algorithms for product form queueing networksCommunications of the ACM, 1980
- Mean-Value Analysis of Closed Multichain Queuing NetworksJournal of the ACM, 1980
- Approximate Methods for Analyzing Queueing Network Models of Computing SystemsACM Computing Surveys, 1978
- Product Form and Local Balance in Queueing NetworksJournal of the ACM, 1977
- Queuing Networks with Multiple Closed Chains: Theory and Computational AlgorithmsIBM Journal of Research and Development, 1975
- Open, Closed, and Mixed Networks of Queues with Different Classes of CustomersJournal of the ACM, 1975
- Jobshop-Like Queueing SystemsManagement Science, 1963
- A Proof for the Queuing Formula: L = λWOperations Research, 1961