The composite bound method for computing throughput bounds in multiple class environments
- 1 March 1986
- journal article
- Published by Elsevier in Performance Evaluation
- Vol. 6 (1) , 1-9
- https://doi.org/10.1016/0166-5316(86)90002-7
Abstract
No abstract availableThis publication has 8 references indexed in Scilit:
- Throughput bounds for closed queueing networksPerformance Evaluation, 1984
- Performance bound hierarchies for queueing networksACM Transactions on Computer Systems, 1983
- Balanced job bound analysis of queueing networksCommunications of the ACM, 1982
- Mean-Value Analysis of Closed Multichain Queuing NetworksJournal of the ACM, 1980
- The Operational Analysis of Queueing Network ModelsACM Computing Surveys, 1978
- 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
- A Proof for the Queuing Formula: L = λWOperations Research, 1961