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)
Approximate Methods for Analyzing Queueing Network Models of Computing Systems
ACM Computing Surveys (CSUR)
Computational algorithms for state-dependent queueing 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
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
Workload representations in queueing models of computer systems
SIGMETRICS '83 Proceedings of the 1983 ACM SIGMETRICS conference on Measurement and modeling of computer systems
SIGCOMM '84 Proceedings of the ACM SIGCOMM symposium on Communications architectures and protocols: tutorials & symposium
Modeling and analysis of flow controlled packet switching networks
SIGCOMM '81 Proceedings of the seventh symposium on Data communications
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)
Two-phase locking performance and its thrashing behavior
ACM Transactions on Database Systems (TODS)
Multiclass queueing networks with population constrainted subnetworks
SIGMETRICS '85 Proceedings of the 1985 ACM SIGMETRICS conference on Measurement and modeling of computer systems
Performance Analysis of Database Systems
Performance Evaluation: Origins and Directions
Speeding up computer system simulations using hierarchical modeling
ACM SIGMETRICS Performance Evaluation Review
End to end delays in a catenet environment
ACM SIGMETRICS Performance Evaluation Review
| Hi-index | 0.00 |
Queueing Network Models - QNM's with population size constraints and delayed blocked customers occur due to MultiProgramming Level - MPL constraints in computer systems and window flow-control mechanisms in Computer Communication Networks - CCN's. The computational cost of existing algorithms is unacceptable for large numbers of chains and high population sizes. A fast approximate solution technique based on load concealment is presented to solve such QNM's. The solution procedure is non-iterative in the case of fixed rate Poisson arrivals, while iteration is required in the case of quasi-random arrivals. Each iteration requires the solution of a single chain network of queues comprised of stations visited by each chain. We then present an algorithm to detect saturated chains and determine their maximum throughput. A fast solution algorithm due to Reiser for closed chains is also extended to the case of quasi-random arrivals. The accuracy of the proposed solution techniques is compared to previous techniques by applying it to a test case, reported in the literature, and a set of randomly generated examples.