An analysis of an approximation algorithm for queueing networks
Performance Evaluation
A Clustering Approximation Technique for Queueing Network Models with a Large Number of Chains
IEEE Transactions on Computers
Accuracy, speed, and convergence of approximate mean value analysis
Performance Evaluation
PAM-a noniterative approximate solution method for closed multichain queueing networks
SIGMETRICS '88 Proceedings of the 1988 ACM SIGMETRICS conference on Measurement and modeling of computer systems
A Note on the Computational Cost of the Linearizer Algorithm for Queueing Networks
IEEE Transactions on Computers
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)
The Distribution of Queuing Network States at Input and Output Instants
Journal of the ACM (JACM)
Linearizer: a heuristic algorithm for queueing network models of computing systems
Communications of the ACM
Xaba: Exact, Approximate, and Asymptotic Solvers for Multi-class Closed Queueing Networks
TOOLS '00 Proceedings of the 11th International Conference on Computer Performance Evaluation: Modelling Techniques and Tools
| Hi-index | 0.00 |
Approximate Mean Value Analysis (MVA) is a popular technique for analyzing queueing networks because of the efficiency and accuracy that it affords. In this paper, we present a new software package, called the Improved Approximate Mean Value Analysis Library (IAMVAL), which can be easily integrated into existing commercial and research queueing network analysis packages. The IAMVAL packages includes two new approximate MVA algorithms, the Queue Line (QL) algorithm and the Fraction Line (FL) algorithm, for analyzing multiple class separable queueing networks. The QL algorithm is always more accurate than, and yet has approximately the same computational efficiency as, the Bard-Schweitzer Proportional Estimation (PE) algorithm, which is currently the most widely used approximate MVA algorithm. The FL algorithm has the same computational cost and, in noncongested separable queueing networks where queue lengths are quite small, yields more accurate solutions than both the QL and PE algorithms.