The Operational Analysis of Queueing Network Models

@article{Denning1978TheOA,
  title={The Operational Analysis of Queueing Network Models},
  author={Peter J. Denning and Jeffrey P. Buzen},
  journal={ACM Comput. Surv.},
  year={1978},
  volume={10},
  pages={225-261}
}
Queueing network models have proved to be cost effectwe tools for analyzing modern computer systems. This tutorial paper presents the basic results using the operational approach, a framework which allows the analyst to test whether each assumption is met in a given system. The early sections describe the nature of queueing network models and their apphcations for calculating and predicting performance quantitms The basic performance quantities--such as utilizations, mean queue lengths, and… 

Robustness of queuing network formulas

It is shown that the main system performance measures are surpnsmgly insensitive to violations of the HST assumption, which further explains the robustness of analyacal models for predicting performance of queuing networks.

Operational analysis of queueing phenomena

With operational analysis, it is shown that many of the results known from sto-chastic analysis of queueing systems are more general (and more robust) than has been believed.

Computer system models: An introduction

This approach, as presented in Denning and Buzen, provides an intuitive basis for analyzing system performance and constructing system models and the emphasis is on gaining an understanding of system models which reenforces intuition, not on mathematical formulae.

Operational Analysis and Basic Queueing Models

This chapter focuses on using queueing theory for performance evaluation of computer systems, showing in a step-by-step fashion how to build a queueing model of a distributed software system and use it to predict the performance of the system for different workload and configuration scenarios.

Exact analysis of performance models by the Method of Moments

  • G. Casale
  • Computer Science
    Perform. Evaluation
  • 2011

Implementing the Mean Value Algorithm for the Solution of Queueing Network Models

A computer program is described which uses the MVA algorithm to solve almost all known versions of closed queueing networks which have 'product form' solutions.

Queueing Networks Analysis with the qnetworks Toolbox

Queueing Networks (QNs) are a widely used performance modeling notation, which has been successfully applied to many kind of systems. Despite the wealth of scientific literature on the solution of QN

Using Operational Analysis in Simulation: A Queueing Network Example

A systematic approach to the gathering of output and calculation of performance measures for quantitative system-performance analysis is demonstrated and errors in assumptions revealed by the output may be measured and used to determine correction terms.

Computing Missing Service Demand Parameters for Performance Models

A black-box approach for computing unknown service demand parameters in queuing network models is discussed and a unique closed form solution is given for the case of a single missing parameter and a process for obtaining a feasible solution for multiple missing parameters is discussed.
...

References

SHOWING 1-10 OF 50 REFERENCES

Operational Analysis of Queueing Networks

In typical validations of computer performance models, analysist interpret the ptja) of queueing networks as time-proportions during which a given network state n is observed. They parameterize

Applications of a Queueing Network Model for a Computer System

A case study of a modeling project for a specific IBM 360/65J computer system is presented and some practical applications of the resulting central server model are described.

Analysis of system bottlenecks using a queueing network model

A surprising result is that optimal performance is not attained when queue lengths and processor utilization percentages are equal, but rather when the fastest processor has the longest expected queue and is in effect creating a system bottleneck.

Approximate Methods for Analyzing Queueing Network Models of Computing Systems

It is the contention of this paper that queueing network models with credible assumptions can be solved approximately to provide credible performance estimates at low cost.

Equivalence and decomposition methods with application to a model of a time-sharing virtual memory system

  • A. Brandwajn
  • Computer Science, Mathematics
    Symposium on Operating Systems
  • 1974
Queueing network models have been applied to the analysis and the prediction of computer system performance and the results obtained appear to match well measurements done on real systems.

A Measurement Procedure for Queueing Network Models of Computer Systems

This tutorial paper describes a procedure for obtaining input parameter values and output performance measures for a popular class of queuemg network models and discusses detail examples of model validations and performance predictions to illustrate the measurement procedures and the class of models.

Closed Queuing Systems with Exponential Servers

It is found that the distribution of customers in the closed queuing system is regulated by the stage or stages with the slowest effective service rate, which means that closed systems are shown to be stochastically equivalent to open systems in which the number of customers cannot exceed N.

AN ANALYSIS OF TIME-SHARED COMPUTER SYSTEMS

Some of the aspects of the operation of time-shared, interactive computer systems are analyzed and a continuous-time Markov process model is derived to predict the performance of a broad class of systems.

Work Rates in Closed Queuing Networks with General Independent Servers

Closed queuing networks are composed of interconnected service stages serving a fixed number of customers and work rates are shown to depend continuously on the service-time distributions.

Open, Closed, and Mixed Networks of Queues with Different Classes of Customers

Many of the network results of Jackson on arrival and service rate dependencies, of Posner and Bernholtz on different classes of customers, and of Chandy on different types of service centers are combined and extended in this paper.