Approximate Methods for Analyzing Queueing Network Models of Computing Systems

The two primary issues in choosing a computing system model are credibility of the model and cost of developing and solving the model Credibility is determined by 1) the experience and biases of the persons using the model, 2) the extent to which the model represents system features, and 3) the accuracy of the solution technique. Queuemg network models are widely used because they have proven effective and are inexpensive to solve. However, most queuemg network models make strong assumptions to assure an exact numerical solution. When such assumptions severely affect credibility, slmulatmn or other approaches are used, in spite of their relatively high cost. 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 This contention is supported by examples of approximate solutions of queueing network models. Two major approaches to approximate solution, aggregation (decompositmn) and diffusion, are discussed

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

[2]  Erol Gelenbe,et al.  On Approximate Computer System Models , 1975, JACM.

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

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

[5]  D. Cox A use of complex probabilities in the theory of stochastic processes , 1955, Mathematical Proceedings of the Cambridge Philosophical Society.

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

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

[8]  Donald F. Towsley,et al.  Product Form and Local Balance in Queueing Networks , 1977, JACM.

[9]  C. H. Sauer,et al.  A Language for Analysis of Queueing Models , 1974 .

[10]  William J. Stewart,et al.  A comparison of numerical techniques in Markov modeling , 1978, CACM.

[11]  K. Mani Chandy,et al.  Approximate Analysis of Central Server Models , 1975, IBM J. Res. Dev..

[12]  Hisashi Kobayashi,et al.  Application of the Diffusion Approximation to Queueing Networks I: Equilibrium Queue Distributions , 1974, JACM.

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

[14]  Simon S. Lam,et al.  Store-and-Forward Buffer Requirements in a Packet Switching Network , 1976, IEEE Trans. Commun..

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

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

[17]  Donald Fred Towsley Local balance models of computer systems. , 1975 .

[18]  K. Mani Chandy,et al.  The impact of distributions and disciplines on multiple processor systems , 1979, CACM.

[19]  H. D. Miller,et al.  The Theory Of Stochastic Processes , 1977, The Mathematical Gazette.

[20]  Peter J. Denning,et al.  An L=S criterion for optimal multiprogramming , 1976, SIGMETRICS '76.

[21]  C. H. Sauer,et al.  Configuration of computing systems: an approach using queueing network models. , 1975 .

[22]  J. W. Wong,et al.  Queueing Network Modeling of Computer Communication Networks , 1978, CSUR.

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

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

[25]  Donald P. Gaver,et al.  Multitype multiprogramming: Probability models and numerical procedures , 1976, SIGMETRICS '76.

[26]  C. H. Sauer,et al.  Sequential stopping rules for the regenerative method of simulation , 1977 .

[27]  Hisashi Kobayashi,et al.  Modeling and analysis , 1978 .

[28]  Martin Reiser,et al.  Interactive Modeling of Computer Systems , 1976, IBM Syst. J..

[29]  Stephen S. Lavenberg,et al.  Introduction to Regenerative Simulation , 1975, IBM J. Res. Dev..

[30]  Peter J. Denning,et al.  The Operational Analysis of Queueing Network Models , 1978, CSUR.

[31]  Hisashi Kobayashi,et al.  Accuracy of the diffusion approximation for some queuing systems , 1974 .

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

[33]  D. Gaver Diffusion approximations and models for certain congestion problems , 1968, Journal of Applied Probability.

[34]  Yonathan Bard The VM/370 Performance Predictor , 1978, CSUR.