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)
Corrigendum: “Computational algorithms for state dependent queuing networks”
ACM Transactions on Computer Systems (TOCS)
A tree convolution algorithm for the solution of queueing networks
Communications of the ACM
Linearizer: a heuristic algorithm for queueing network models of computing systems
Communications of the ACM
Analyzing queueing networks with simultaneous resource possession
Communications of the ACM
Computer Performance Modeling Handbook
Computer Performance Modeling Handbook
A Validated Distributed System Performance Model
Performance '83 Proceedings of the 9th International Symposium on Computer Performance Modelling, Measurement and Evaluation
A Reduction Technique for Evaluating Queueing Networks with Serialization Delays
Performance '83 Proceedings of the 9th International Symposium on Computer Performance Modelling, Measurement and Evaluation
Performance '84 Proceedings of the Tenth International Symposium on Computer Performance Modelling, Measurement and Evaluation
Workload representations in queueing models of computer systems
SIGMETRICS '83 Proceedings of the 1983 ACM SIGMETRICS conference on Measurement and modeling of computer systems
SCAT: A heuristic algorithm for queueing network models of computing systems
SIGMETRICS '81 Proceedings of the 1981 ACM SIGMETRICS conference on Measurement and modeling of computer systems
The solution of separable queueing network models using mean value analysis
SIGMETRICS '81 Proceedings of the 1981 ACM SIGMETRICS conference on Measurement and modeling of computer systems
On the convolution algorithm for separable queuing networks
SIGMETRICS '76 Proceedings of the 1976 ACM SIGMETRICS conference on Computer performance modeling measurement and evaluation
Improved lineariser methods for queueing networks with queue dependent centres
SIGMETRICS '84 Proceedings of the 1984 ACM SIGMETRICS conference on Measurement and modeling of computer systems
An Approximate Analytical Method for General Queueing Networks
IEEE Transactions on Software Engineering
Parametric analysis of queuing networks
IBM Journal of Research and Development
PAM-a noniterative approximate solution method for closed multichain queueing networks
SIGMETRICS '88 Proceedings of the 1988 ACM SIGMETRICS conference on Measurement and modeling of computer systems
A Note on the Computational Cost of the Linearizer Algorithm for Queueing Networks
IEEE Transactions on Computers
Task Response Time for Real-Time Distributed Systems with Resource Contentions
IEEE Transactions on Software Engineering
Performance Analysis of Client-Server Storage Systems
IEEE Transactions on Computers
The mathematics of product form queuing networks
ACM Computing Surveys (CSUR)
Bounding errors introduced by clustering of customers in closed product-form queuing networks
Journal of the ACM (JACM)
Solution properties and convergence of an approximate mean value analysis algorithm
ACM SIGMETRICS Performance Evaluation Review
Experiments with Improved Approximate Mean Value Analysis Algorithms
TOOLS '98 Proceedings of the 10th International Conference on Computer Performance Evaluation: Modelling Techniques and Tools
Relating layered queueing networks and process algebra models
Proceedings of the first joint WOSP/SIPEW international conference on Performance engineering
| Hi-index | 14.99 |
The past few years have witnessed an increasing number of large distributed computer system implementations based on local area networks. In these systems a number of resources (CPU's, file servers, disks, etc.) are shared among jobs originating at different sites. Evaluating the performance of such large systems typically requires the solution of a queueing network model with a large number of closed chains, which precludes the use of exact solution techniques. Therefore, it is important to develop accurate and cost-effective methods for the approximate analysis of closed queueing networks with many chains. In this paper, we present an approach based on the clustering of chains and service centers. The method is applicable to queueing networks with single server fixed rate, infimite server and multiple server service centers. We present the results obtained when the method is used to solve large queueing network models. Extensive comparison of this method to existing approximation techniques indicates that the approach has better accuracy/cost characteristics.