Skip to main content
SpringerLink
Log in

A simple method for computing state probabilities of theM/G/1 andGI/M/1 finite waiting space queues

  • Published:
Mathematical Methods of Operations Research Aims and scope Submit manuscript

Abstract

This paper presents a simple method for computing steady state probabilities at arbitrary and departure epochs of theM/G/1/K queue. The method is recursive and works efficiently for all service time distributions. The only input required for exact evaluation of state probabilities is the Laplace transform of the probability density function of service time. Results for theGI/M/1/K −1 queue have also been obtained from those ofM/G/1/K queue.

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

  • Baiocchi A (1992) Asymptotic behaviour of the loss probability of theM/G/1/K andGI/M/1/K queues. Queueing Systems 10:235–248

    Google Scholar 

  • Chaudhry ML, Gupta UC, Agarwal M (1991) On exact computational analysis of distributions of numbers in systems forM/G/1/N + 1 andGI/M/1/N + 1 queues using roots. Computers and Operations Research 8:679–694

    Google Scholar 

  • Chaudhry ML (1993) QROOT software package, A & A Publications, 395. Carrie Crescent, Kingston, Ontario, K1G 3M1, Canada

  • Cohen JW (1982) The single server queue, 2nd edition. North-Holland, New York

    Google Scholar 

  • Cooper RB (1981) Introduction to queueing theory, 2nd edition. North-Holland, New York

    Google Scholar 

  • Franken P, König D, Arndt U, Schmidt V (1982) Queues and point processes. Wiley, Berlin

    Google Scholar 

  • Gross D, Harris CM (1985) Fundamentals of queueing theory, 2nd edition. Wiley, New York

    Google Scholar 

  • Gupta UC, Srinivasa Rao TSS (1994) A recursive method to compute the steady state probabilities of the machine interference model: (M/G/1)K. Computers & Operations Research 21:597–605

    Google Scholar 

  • Hokstad P (1975) A supplementary variable technique applied to theM/G/1 queue. Scand J Statist 2:95–98

    Google Scholar 

  • Keilson J (1966) The ergodic queue length distribution of queueing systems with finite capacity. J Royal Statistical Society Series B 28:190–201

    Google Scholar 

  • Lavenberg SS (1983) Computer performance modelling handbook. Academic Press, New York

    Google Scholar 

  • Neuts MF (1981) Matrix-geometric solutions in stochastic models — an algorithmic approach. The Johns Hopkins University Press, Baltimore, Md

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Mathematics, Indian Institute of Technology, 721302, Kharagpur, India

    T. S. S. Srinivasa Rao & U. C. Gupta

Authors
  1. T. S. S. Srinivasa Rao
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. U. C. Gupta
    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

Srinivasa Rao, T.S.S., Gupta, U.C. A simple method for computing state probabilities of theM/G/1 andGI/M/1 finite waiting space queues. Mathematical Methods of Operations Research 43, 97–106 (1996). https://doi.org/10.1007/BF01303436

Download citation

  • Received:

  • Revised:

  • Issue Date:

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

Key words

Search

Navigation