Two classes of performance bounds for closed queueing networks
- 1 February 1987
- journal article
- Published by Elsevier in Performance Evaluation
- Vol. 7 (1), 3-30
- https://doi.org/10.1016/0166-5316(87)90054-x
Abstract
No abstract availableThis publication has 17 references indexed in Scilit:
- A tree-structured mean value analysis algorithmACM Transactions on Computer Systems, 1986
- The composite bound method for computing throughput bounds in multiple class environmentsPerformance Evaluation, 1986
- Bound hierarchies for multiple-class queuing networksJournal of the ACM, 1986
- Throughput bounds for closed queueing networksPerformance Evaluation, 1984
- Performance bound hierarchies for queueing networksACM Transactions on Computer Systems, 1983
- Queueing network models of packet switching networks part 2: Networks with population size constraintsPerformance Evaluation, 1982
- Dynamic Scaling and Growth Behavior of Queuing Network Normalization ConstantsJournal of the ACM, 1982
- Open, Closed, and Mixed Networks of Queues with Different Classes of CustomersJournal of the ACM, 1975
- Parametric Analysis of Queuing NetworksIBM Journal of Research and Development, 1975
- Computational algorithms for closed queueing networks with exponential serversCommunications of the ACM, 1973