Bound hierarchies for multiple-class queuing networks
- 2 January 1986
- journal article
- Published by Association for Computing Machinery (ACM) in Journal of the ACM
- Vol. 33 (1), 179-206
- https://doi.org/10.1145/4904.4992
Abstract
No abstract availableKeywords
This publication has 16 references indexed in Scilit:
- The composite bound method for computing throughput bounds in multiple class environmentsPerformance Evaluation, 1986
- Throughput bounds for closed queueing networksPerformance Evaluation, 1984
- Performance bound hierarchies for queueing networksACM Transactions on Computer Systems, 1983
- A Characterization of Product-Form Queuing NetworksJournal of the ACM, 1983
- Approximations for large scale closed queueing networksPerformance Evaluation, 1983
- LinearizerCommunications of the ACM, 1982
- Computational algorithms for product form queueing networksCommunications of the ACM, 1980
- Guest Editor's Overview… Queuing Network Models of Computer System PerformanceACM Computing Surveys, 1978
- Open, Closed, and Mixed Networks of Queues with Different Classes of CustomersJournal of the ACM, 1975
- A Proof for the Queuing Formula: L = λWOperations Research, 1961