A Simple Derivation of the MVA and LBANC Algorithms from the Convolution Algorithm

Authors:
S. S. Lam
Affiliations:
Department of Computer Sciences, University of Texas
Venue:
IEEE Transactions on Computers
Year:
1983

Citing 8
Cited 3

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)
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
Queuing networks with multiple closed chains: theory and computational algorithms

IBM Journal of Research and Development
Parametric analysis of queuing networks

IBM Journal of Research and Development

The general form linearizer algorithms: A new family of approximate mean value analysis algorithms

Performance Evaluation
A generalized method of moments for closed queueing networks

Performance Evaluation
Efficient parallelization of the Method of Moments for queueing networks using multi-modular algebra

Proceedings of the 5th International ICST Conference on Performance Evaluation Methodologies and Tools

Quantified Score

Hi-index	14.98

Visualization

Abstract

The convolution algorithm, the mean value analysis (MVA) algorithm, and the LBANC algorithm are major algorithms for the solution of closed product-form queueing networks. For fixed-rate service centers, the efficiency of each algorithm is greatly improved by a recursive solution. We show that the recursive relations in all three algorithms are closely related so that each one can be easily derived from any of the others.