Bound hierarchies for multiple-class queuing networks
Journal of the ACM (JACM) - The MIT Press scientific computation series
Mean-Value Analysis of Closed Multichain Queuing Networks
Journal of the ACM (JACM)
The Operational Analysis of Queueing Network Models
ACM Computing Surveys (CSUR)
Performance bound hierarchies for queueing networks
ACM Transactions on Computer Systems (TOCS)
Balanced job bound analysis of queueing networks
Communications of the ACM
Computational algorithms for closed queueing networks with exponential servers
Communications of the ACM
Performance Bounds Based upon Throughput Curve Properties
Performance '83 Proceedings of the 9th International Symposium on Computer Performance Modelling, Measurement and Evaluation
Convolutional bound hierarchies
SIGMETRICS '84 Proceedings of the 1984 ACM SIGMETRICS conference on Measurement and modeling of computer systems
Acknowledgement: An improved balanced job bound analysis of closed queueing networks
Operations Research Letters
| Hi-index | 14.98 |
The use of queueing network models to analyze the performance of computer systems is widespread. Typically the analysis requires certain assumptions to be made. Even under such assumptions, the exact analysis of these models for the performance measures could be quite time consuming, especially when various alternate configurations of the system are to be evaluated. In some situations, bounds on the performance may often be adequate. This issue of obtaining reasonable bounds has hence been the subject of some discussion and a number of bounding techniques have been proposed over the past few years. In this paper we present a bounding technique for networks with a single class of customers that appears to be more effective than techniques previously reported.