Quantitative system performance: computer system analysis using queueing network models
Quantitative system performance: computer system analysis using queueing network models
Computational geometry: an introduction
Computational geometry: an introduction
Combinatorial optimization: algorithms and complexity
Combinatorial optimization: algorithms and complexity
Asymptotic analysis of multiclass closed queueing networks: common bottleneck
Performance Evaluation
Asymptotic analysis of multiclass closed queueing networks: multiple bottlenecks
Performance Evaluation
Multiclass queueing networks with population constrainted subnetworks
SIGMETRICS '85 Proceedings of the 1985 ACM SIGMETRICS conference on Measurement and modeling of computer systems
Open, Closed, and Mixed Networks of Queues with Different Classes of Customers
Journal of the ACM (JACM)
Computer Performance Modeling Handbook
Computer Performance Modeling Handbook
A Survey of Bottleneck Analysis in Closed Networks of Queues
Performance Evaluation of Computer and Communication Systems, Joint Tutorial Papers of Performance '93 and Sigmetrics '93
Bottlenecks Identification in Multiclass Queueing Networks Using Convex Polytopes
MASCOTS '04 Proceedings of the The IEEE Computer Society's 12th Annual International Symposium on Modeling, Analysis, and Simulation of Computer and Telecommunications Systems
Queueing Networks and Markov Chains
Queueing Networks and Markov Chains
Analytic modeling of multitier Internet applications
ACM Transactions on the Web (TWEB)
Approximate Solution of Multiclass Queuing Networks with Region Constraints
MASCOTS '07 Proceedings of the 2007 15th International Symposium on Modeling, Analysis, and Simulation of Computer and Telecommunication Systems
A unified framework for the bottleneck analysis of multiclass queueing networks
Performance Evaluation
| Hi-index | 0.00 |
In this paper, we introduce a new framework supporting the bottleneck analysis of closed, multiclass BCMP queueing networks with large population sizes. First, we provide a sufficient and necessary condition establishing the existence of a single bottleneck. Then, we derive the new framework proposing efficient algorithms for the identification of queueing networks bottlenecks by means of linear programming. Our analysis reduces the computational requirements of existing techniques and, under general assumptions, it is able to handle load-dependent stations. Theoretical and practical insights on the asymptotic behavior of multiclass networks are investigated as application of the proposed framework.