Quantitative system performance: computer system analysis using queueing network models
Quantitative system performance: computer system analysis using queueing network models
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)
Approximate Methods for Analyzing Queueing Network Models of Computing Systems
ACM Computing Surveys (CSUR)
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
Computer Performance Modeling Handbook
Computer Performance Modeling Handbook
A Perspective on Iterative Methods for the Approximate Analysis of Closed Queueing Networks
Proceedings of the International Workshop on Computer Performance and Reliability
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
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
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
Efficient approximation for models of multiprogramming with shared domains
SIGMETRICS '84 Proceedings of the 1984 ACM SIGMETRICS conference on Measurement and modeling of computer systems
Analysis of Queueing Network Models with population size constraints and delayed blocked customers
SIGMETRICS '84 Proceedings of the 1984 ACM SIGMETRICS conference on Measurement and modeling of computer systems
Multiple class memory constrained queueing networks
SIGMETRICS '82 Proceedings of the 1982 ACM SIGMETRICS conference on Measurement and modeling of computer systems
Fast approximate solution of multiprogramming models
SIGMETRICS '82 Proceedings of the 1982 ACM SIGMETRICS conference on Measurement and modeling of computer systems
The mathematics of product form queuing networks
ACM Computing Surveys (CSUR)
A new framework supporting the bottleneck analysis of multiclass queueing networks
Proceedings of the 3rd International Conference on Performance Evaluation Methodologies and Tools
SLA-driven planning and optimization of enterprise applications
Proceedings of the first joint WOSP/SIPEW international conference on Performance engineering
A unified framework for the bottleneck analysis of multiclass queueing networks
Performance Evaluation
| Hi-index | 0.00 |
A Multiclass Queueing Network model (MQN) is partitioned into a set of disjoint subnetworks. Population constraints are applied to each subnetwork such that within each subnetwork each population chain is either subject to an individual population constraint, or a group of chains may be subject to a common (shared) population constraint. Such population constraints are necessary in order to model multiprogramming level constraints in mainframe computer systems and window flow control mechanisms in computer communication networks. A computationally efficient approximate solution method is developed for solving MQN's with population constraints. Each subnetwork is reduced to a single approximately flow equivalent composite centre by assuming that the effect of other chains on a given chain can be adequately represented by their average customer populations. The accuracy of the population constraint approximation is compared against previous techniques by applying it to a set of test cases for which simulation solutions have previously been reported. The accuracy of the approximation technique is found to be good and in general is an improvement over previously published concurrency constraint approximations.