A tree-structured mean value analysis algorithm

Authors:
K. P. Hoyme;S. C. Bruell;P. V. Afshari;R. Y. Kain
Affiliations:
Honeywell Systems and Research Center, Minneapolis, MN;Department of Computer Science, University of Iowa, Iowa City, IA;Hewlett-Packard Research Labs, Palo Alto, CA;Department of Electrical Engineering, University of Minnesota, Minneapolis, MN
Venue:
ACM Transactions on Computer Systems (TOCS)
Year:
1986

Citing 7
Cited 5

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)
Dynamic Scaling and Growth Behavior of Queuing Network Normalization Constants

Journal of the ACM (JACM)
A tree convolution algorithm for the solution of queueing networks

Communications of the ACM
Computational algorithms for product form queueing networks

Communications of the ACM
Computational algorithms for closed queueing networks with exponential servers

Communications of the ACM
The approximate solution of large queueing network models

The approximate solution of large queueing network models

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
The mathematics of product form queuing networks

ACM Computing Surveys (CSUR)
Product Form Queueing Networks

Performance Evaluation: Origins and Directions
The general form linearizer algorithms: A new family of approximate mean value analysis algorithms

Performance Evaluation
Queueing networks

SFM'07 Proceedings of the 7th international conference on Formal methods for performance evaluation

Quantified Score

Hi-index	0.00

Visualization

Abstract

In a recent paper, Lam and Lien described an algorithm called tree-convolution that can reduce the space and computation time required for evaluating sparse multiclass, product-form queueing networks. In this paper, we develop an exact algorithm based on mean value analysis (MVA) that is the counterpart of the tree-convolution algorithm. The order of reduction in storage and computation achieved by our new Tree-MVA algorithm compared to the standard MVA algorithm is the same order of reduction obtained by the tree-convolution algorithm over that of the standard convolution algorithm. Our Tree-MVA algorithm preserves the inherent simplicity of MVA based algorithms.