Skip to main content
Springer Nature Link
Log in

The m/g/1 retrial queue with nonpersistent customers

  • Invited Paper
  • Published:
Queueing Systems Aims and scope Submit manuscript

Abstract

We consider anM/G/1 retrial queue in which blocked customers may leave the system forever without service. Basic equations concerning the system in steady state are established in terms of generating functions. An indirect method (the method of moments) is applied to solve the basic equations and expressions for related factorial moments, steady-state probabilities and other system performance measures are derived in terms of server utilization. A numerical algorithm is then developed for the calculation of the server utilization and some numerical results are presented.

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

Access this article

Log in via an institution

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

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

  1. Q.H. Choo and B. Conolly, New results in the theory of repeated orders queueing systems, J. Appl. Probab. 16 (1979) 631.

    Google Scholar 

  2. D.R. Cox and H.D. Miller,The Theory of Stochastic Processes (Methuen, London, 1965).

    Google Scholar 

  3. G.I. Falin, A single-line system with secondary orders, Eng. Cybernet. Rev. 17, 2 (1979) 76.

    Google Scholar 

  4. G.I. Falin, Single-line repeated orders queueing systems, Optimization 17, 5 (1986) 649.

    Google Scholar 

  5. B.S. Greenberg,M/G/1 queueing systems with returning customers, Working Paper 87/88-3-1, Department of Management Science and Information Systems, University of Texas at Austin (1987).

    Google Scholar 

  6. J.J. Hunter,Mathematical Techniques of Applied Probability, vol. 1 (Academic Press, 1983).

  7. G.L. Jonin and Y.Y. Sedol, Investigation of telephone systems in the case of repeated calls, Latvian Math. Yearbook 7 (1970) 71.

    Google Scholar 

  8. J. Keilson, J. Cossolino and H. Young, A service system with unfilled requests repeated, Oper. Res. 16 (1968) 1126.

    Google Scholar 

  9. J. Lubacz and J. Roberts, A new approach to the single server repeated attempt system with balking,Proc. 3rd Int. Seminar on Teletraffic Theory, Moscow (1984) p. 290.

  10. T. Yang and J.G.C. Templeton, A survey on retrial queues, Queueing Systems 2 (1987) 201.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Industrial Engineering, University of Toronto, M5S IA4, Toronto, Canada

    T. Yang, M. J. M. Posner & J. G. C. Templeton

Authors
  1. T. Yang
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. M. J. M. Posner
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. J. G. C. Templeton
    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

Yang, T., Posner, M.J.M. & Templeton, J.G.C. The m/g/1 retrial queue with nonpersistent customers. Queueing Syst 7, 209–218 (1990). https://doi.org/10.1007/BF01158475

Download citation

  • Received:

  • Revised:

  • Issue Date:

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

Keywords