Performance Evaluation
Bound hierarchies for multiple-class queuing networks
Journal of the ACM (JACM) - The MIT Press scientific computation series
A Clustering Approximation Technique for Queueing Network Models with a Large Number of Chains
IEEE Transactions on Computers
Two classes of performance bounds for closed queueing networks
Performance Evaluation
Models and algorithms for the design of store-and-forward communication networks
Models and algorithms for the design of store-and-forward communication networks
Accuracy, speed, and convergence of approximate mean value analysis
Performance Evaluation
A tree-structured mean value analysis algorithm
ACM Transactions on Computer Systems (TOCS)
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)
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
Balanced job bound analysis of queueing networks
Communications of the ACM
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
Modeling and analysis of flow controlled packet switching networks
SIGCOMM '81 Proceedings of the seventh symposium on Data communications
Pamma Noniterative Approximate Solution Method for Closed MultichainQueueing Networks
Pamma Noniterative Approximate Solution Method for Closed MultichainQueueing Networks
Modeling, Analysis, and Optimal Routing of Flow-controlled CommunicationNetworks
Modeling, Analysis, and Optimal Routing of Flow-controlled CommunicationNetworks
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
| Hi-index | 0.00 |
Approximate MVA algorithms for separable queueing networks are based upon an iterative solution of a set of modified MVA formulas. Although each iteration has a computational time requirement of O(MK2) or less, many iterations are typically needed for convergence to a solution. (M denotes the number of queues and K the number of closed chains or customer classes.) We present some faster approximate solution algorithms that are noniterative. They are suitable for the analysis and design of communication networks which may require tens to hundreds, perhaps thousands, of closed chains to model flow-controlled virtual channels. Three PAM algorithms of increasing accuracy are presented. Two of them have time and space requirements of O(MK). The third algorithm has a time requirement of O(MK2) and a space requirement of O(MK).