Combining queueing networks and web usage mining techniques for web performance analysis
Proceedings of the 2005 ACM symposium on Applied computing
JMT: performance engineering tools for system modeling
ACM SIGMETRICS Performance Evaluation Review
A new framework supporting the bottleneck analysis of multiclass queueing networks
Proceedings of the 3rd International Conference on Performance Evaluation Methodologies and Tools
User-friendly approach to capacity planning studies with Java modelling tools
Proceedings of the 2nd International Conference on Simulation Tools and Techniques
A unified framework for the bottleneck analysis of multiclass queueing networks
Performance Evaluation
Quantitative system evaluation with Java modeling tools
Proceedings of the 2nd ACM/SPEC International Conference on Performance engineering
Mining models of composite web services for performance analysis
DASFAA'06 Proceedings of the 11th international conference on Database Systems for Advanced Applications
Closed Queueing Networks Under Congestion: Nonbottleneck Independence and Bottleneck Convergence
Mathematics of Operations Research
| Hi-index | 0.00 |
It is known that the resources that limit the overall performance of the system are the congested ones, referred to as bottlenecks. From the knowledge of the bottleneck stations with a limited computational effort it is possible to derive asymptotic values of several performance indices. While identifying the bottleneck stations under a single-class workload is a well-established practice, no simple methodology for multiclass models exists. In this paper we present new algorithms for identifying the bottlenecks in multiclass queueing networks with constant-rate servers. We show how the application of assessed techniques, such as the ones related to the convex polytopes, can provide insights on the performance of a queueing network. The application of our techniques to the asymptotic analysis of closed product-form networks is also investigated.