Skip to main content
SpringerLink
Log in

Multi-class queueing models for performance analysis of computer systems

  • Queueing Models For Performance Analysis Of Computer And Communication Systems
  • Published:
Sadhana Aims and scope Submit manuscript

Abstract

Queueing models, networks of queues in particular, have been found especially useful for estimating the performance of computer systems. Networks of queues with multiple customer classes provide a flexible framework for modelling computer systems, where a rich set of analytical results and techniques are available. When because of the complexity of the system being modelled the analytical results cannot be applied directly, they often point to fairly accurate approximation schemes. In this paper, we present a brief survey of some of the important results and techniques from the theory of multi-class queueing networks. We also present a case study to illustrate how these results and techniques are used in a real-life situation where many of the modelling constraints are violated.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  • Baskett F, Chandy K M, Muntz R R, Palacios-Gomez F 1975 Open, closed and mixed networks of queues with different classes of customers.J. Assoc. Comput. Mach. 22: 248–260

    MATH  MathSciNet  Google Scholar 

  • Becker S T, Rege K M, Sengupta B 1984 A modelling methodology for sizing a computer based system in a netted environment.Proceedings Assoc. Comput. Mach. Sigmetrics Conference

  • Brill P H, Posner M J M 1977 Level crossings in point processes applied to queues: Single server case.Oper. Res. 25: 662–674

    MATH  MathSciNet  Google Scholar 

  • Buzen J P 1973 Computational algorithms for closed queueing networks with exponential servers.Commun. Assoc. Comput. Mach. 16: 527–531

    MATH  MathSciNet  Google Scholar 

  • Chandy K M, Herzag U, Woo L 1975 Parametric analysis of queueing networks.IBM J. Res. Dev. 19: 36–42

    MATH  Google Scholar 

  • Conway R W, Maxwell W L, Miller L W 1967Theory of scheduling (Reading, Mass: Addison-Wesley)

    MATH  Google Scholar 

  • Gordon W J, Newell G F 1967 Closed queueing systems with exponential servers.Oper. Res. 15: 254–265

    Article  MATH  Google Scholar 

  • Jackson J R 1963 Jobshop-like queueing systems.Manage. Sci. 10: 131–142

    Google Scholar 

  • Kleinrock L 1975Queueing systems (New York: John Wiley) Vol. 1

    MATH  Google Scholar 

  • Kleinrock L 1976Queueing systems (New York: John Wiley) Vol. 2

    MATH  Google Scholar 

  • Lavenberg S S 1988 A perspective on queueing models of computer performance, inQueueing theory and its applications-Liber Amicorum for J W Cohen: CWI Monograph 7 (Amsterdam: North-Holland)

    Google Scholar 

  • Ott T J 1984 The sojourn time distribution in the M/G/1 queue with processor sharing.J. Appl. Probab. 21: 360–378

    Article  MATH  MathSciNet  Google Scholar 

  • Rege K M 1988 Approximate analysis of serial manufacturing lines with buffer control.Inf. Decision Technol. 14: 31–43

    MATH  Google Scholar 

  • Reiser M, Kobayashi H 1975 Queueing networks with multiple closed chains: Theory and computational algorithms.IBM J. Res. Dev. 19: 283–294

    Article  MATH  MathSciNet  Google Scholar 

  • Reiser M, Lavenberg S S 1980 Mean-value analysis of closed multi-class queueing networks.J. Assoc. Comput. Mach. 27: 313–322

    MATH  MathSciNet  Google Scholar 

  • Towsley D F 1980 Queueing models with state-dependent routing.J. Assoc. Comput. Mach. 27: 323–337

    MATH  MathSciNet  Google Scholar 

  • Wolff R M 1970SIAM J. Appl. Math. 19: 566–574

    Article  MATH  MathSciNet  Google Scholar 

  • Yashkov S F 1983 A derivation of response time distribution for the M/G/1 processor sharing queue.Prob. Control Inf. Theory 12: 133–148

    MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Centre for Development of Advanced Computing, Poona University Campus, Ganeshkhind Road, 411 007, Pune, India

    Kiran M Rege

Authors
  1. Kiran M Rege
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Cite this article

Rege, K.M. Multi-class queueing models for performance analysis of computer systems. Sadhana 15, 355–363 (1990). https://doi.org/10.1007/BF02811331

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF02811331

Keywords

Search

Navigation