The solution of separable queueing network models using mean value analysis

Authors:
John Zahorjan;Eugene Wong
Affiliations:
Department of Computer Science, University of Washington, Seattle, Washington;Department of Computer Science, University of Washington, Seattle, Washington
Venue:
SIGMETRICS '81 Proceedings of the 1981 ACM SIGMETRICS conference on Measurement and modeling of computer systems
Year:
1981

Citing 8
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)
The Distribution of Queuing Network States at Input and Output Instants

Journal of the ACM (JACM)
The Operational Analysis of Queueing Network Models

ACM Computing Surveys (CSUR)
Computational algorithms for product form queueing networks

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

Communications of the ACM
On the convolution algorithm for separable queuing networks

SIGMETRICS '76 Proceedings of the 1976 ACM SIGMETRICS conference on Computer performance modeling measurement and evaluation
On single and multiple job class queueing network models of computer systems.

On single and multiple job class queueing network models of computer systems.

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
Nonexponential networks of queues: a maximum entropy analysis

SIGMETRICS '85 Proceedings of the 1985 ACM SIGMETRICS conference on Measurement and modeling of computer systems
Computational algorithms for state-dependent queueing networks

ACM Transactions on Computer Systems (TOCS)
The MVA priority approximation

ACM Transactions on Computer Systems (TOCS)

Quantified Score

Hi-index	0.00

Visualization

Abstract

Because it is more intuitively understandable than the previously existing convolution algorithms, Mean Value Analysis (MVA) has gained great popularity as an exact solution technique for separable queueing networks. However, the derivations of MVA presented to date apply only to closed queueing network models. Additionally, the problem of the storage requirement of MVA has not been dealt with satisfactorily. In this paper we address both these problems, presenting MVA solutions for open and mixed load independent networks, and a storage maintenance technique that we postulate is the minimum possible of any “reasonable” MVA technique.