Bound hierarchies for multiple-class queuing networks
Journal of the ACM (JACM) - The MIT Press scientific computation series
Accuracy, speed, and convergence of approximate mean value analysis
Performance Evaluation
A Note on the Computational Cost of the Linearizer Algorithm for Queueing Networks
IEEE Transactions on Computers
Open, Closed, and Mixed Networks of Queues with Different Classes of Customers
Journal of the ACM (JACM)
Mean-Value Analysis of Closed Multichain Queuing Networks
Journal of the ACM (JACM)
Performance bound hierarchies for queueing networks
ACM Transactions on Computer Systems (TOCS)
Linearizer: a heuristic algorithm for queueing network models of computing systems
Communications of the ACM
Computational algorithms for closed queueing networks with exponential servers
Communications of the ACM
A Unifying Framework for the Approximate Solution of Closed Multiclass Queuing Networks
IEEE Transactions on Computers
Some Extensions to Multiclass Queueing Network Analysis
Proceedings of the Third International Symposium on Modelling and Performance Evaluation of Computer Systems: Performance of Computer Systems
A Unifying Framework for the Approximate Solution of Closed Multiclass Queuing Networks
IEEE Transactions on Computers
SIGMETRICS '06/Performance '06 Proceedings of the joint international conference on Measurement and modeling of computer systems
Predictive modelling of SAP ERP applications: challenges and solutions
Proceedings of the Fourth International ICST Conference on Performance Evaluation Methodologies and Tools
A generalized method of moments for closed queueing networks
Performance Evaluation
Exact analysis of performance models by the Method of Moments
Performance Evaluation
| Hi-index | 14.98 |
Queuing network models of modern computing systems must consider a large number of components (e.g., Web servers, DB servers, application servers, firewall, routers, networks) and hundreds of customers with very different resource requirements. The complexity of such models makes the application of exact solution techniques prohibitively expensive, motivating research on approximate methods. This paper proposes an interpolation-matching framework that allows a unified view of approximate solution techniques for closed product-form queuing networks. Depending upon the interpolating functional form and the matching populations selected, a large versatile family of new approximations can be generated. It is shown that all the known approximation strategies, including Linearizer, are instances of the interpolation-matching framework. Furthermore, a new approximation technique, based on a third-order polynomial, is obtained using the interpolation-matching framework. The new technique is shown to be more accurate than other known methods.