The Operational Analysis of Queueing Network Models

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 mean response tunes--are defined, and operatmnal relationships among them are derwed Following this, the concept of job flow balance is introduced and used to study asymptotic throughputs and response tunes. The concepts of state transition balance, one-step behavior, and homogeneity are then used to relate the proportions of time that each system state is occupied to the parameters of job demand and to dewce charactenstms Efficmnt methods for computing basic performance quantities are also described. Finally the concept of decomposition is used to stmphfy analyses by replacing subsystems with equivalent devices. All concepts are illustrated liberally with examples

[1]  J. R. Jackson Networks of Waiting Lines , 1957 .

[2]  A. L. Scherr,et al.  AN ANALYSIS OF TIME-SHARED COMPUTER SYSTEMS , 1965 .

[3]  W. J. Gordon,et al.  Closed Queuing Systems with Exponential Servers , 1967, Oper. Res..

[4]  A.J.C. Wilson An analysis of time-shared computer systems by A. L. Scherr , 1968 .

[5]  Jeffrey Buzen,et al.  Analysis of system bottlenecks using a queueing network model , 1971, SIGOPS Workshop on System Performance Evaluation.

[6]  Peter J. Denning,et al.  A Note on Paging Drum Efficiency , 1972, CSUR.

[7]  Peter J. Denning,et al.  Operating Systems Theory , 1973 .

[8]  Jeffrey P. Buzen,et al.  Computational algorithms for closed queueing networks with exponential servers , 1973, Commun. ACM.

[9]  P. H. Hughes,et al.  A structural approach to computer performance analysis , 1973, AFIPS National Computer Conference.

[10]  S. S. Lavenberg,et al.  Work Rates in Closed Queuing Networks with General Independent Servers , 1974, Oper. Res..

[11]  Alexandre Brandwajn,et al.  Equivalence and decomposition methods with application to a model of a time-sharing virtual memory system , 1974, Symposium on Operating Systems.

[12]  K. Mani Chandy,et al.  Parametric Analysis of Queuing Networks , 1975, IBM J. Res. Dev..

[13]  Hisashi Kobayashi,et al.  Queuing Networks with Multiple Closed Chains: Theory and Computational Algorithms , 1975, IBM J. Res. Dev..

[14]  P.J. Denning,et al.  Multiprogrammed memory management , 1975, Proceedings of the IEEE.

[15]  Pierre-Jacques Courtois,et al.  Decomposability, instabilities, and saturation in multiprogramming systems , 1975, CACM.

[16]  J.C. Browne,et al.  Hierarchical techniques for the development of realistic models of complex computer systems , 1975, Proceedings of the IEEE.

[17]  R.R. Muntz,et al.  Analytic modeling of interactive systems , 1975, Proceedings of the IEEE.

[18]  K. Mani Chandy,et al.  Approximate Analysis of General Queuing Networks , 1975, IBM J. Res. Dev..

[19]  K. Mani Chandy,et al.  Open, Closed, and Mixed Networks of Queues with Different Classes of Customers , 1975, JACM.

[20]  K. Mani Chandy,et al.  Solution of Queuing Problems by a Recursive Technique , 1975, IBM J. Res. Dev..

[21]  Annie W. Shum Queueing Models for Computer Systems with General Service Time Distributions , 1976, Outstanding Dissertations in the Computer Sciences.

[22]  Thomas Giammo Validation of a computer performance model of the exponential queuing network family , 1976, SIGMETRICS '76.

[23]  A. C. Williams,et al.  A generating function approach to queueing network analysis of multiprogrammed computers , 1976, Networks.

[24]  Lester Lipsky,et al.  Applications of a Queueing Network Model for a Computer System , 1977, CSUR.

[25]  Peter J. Denning,et al.  Operational Analysis of Queueing Networks , 1977, Performance.

[26]  Herb Schwetman,et al.  Customer Classes and Closed Network Models-A Solution Technique , 1977, IFIP Congress.

[27]  K. Mani Chandy,et al.  Memory management and response time , 1977, CACM.

[28]  Jeffrey P. Buzen,et al.  A Method for Obtaining Approximate Solutions to Closed Queueing Networks with General Service Times , 1977, Performance.

[29]  Edward Delano Lazowska Characterizing service time and response time distributions in queueing network models of computer systems. , 1977 .

[30]  Alexandre Brandwajn,et al.  A Study of a Page-on-Demand System , 1977, Inf. Process. Lett..

[31]  Deborah A. Sheetz,et al.  BEST/1 - Design of a tool for computer system capacity planning , 1899, AFIPS National Computer Conference.

[32]  Herb Schwetman Hybrid simulation models of computer systems , 1978, CACM.

[33]  Clifford A. Rose,et al.  A Measurement Procedure for Queueing Network Models of Computer Systems , 1978, CSUR.

[34]  K. Mani Chandy,et al.  Approximate Methods for Analyzing Queueing Network Models of Computing Systems , 1978, CSUR.

[35]  J. W. Wong,et al.  Distribution of End-to-End Delay in Message-Switched Networks , 1978, Comput. Networks.

[36]  James Paul Bouhana Operational aspects of centralized queueing networks. , 1978 .