Skip to main content
SpringerLink
Log in

TheM/G/1 retrial queue with the server subject to starting failures

  • Articles
  • Published:
Queueing Systems Aims and scope Submit manuscript

Abstract

In this paper, we study a retrial queueing model with the server subject to starting failures. We first present the necessary and sufficient condition for the system to be stable and derive analytical results for the queue length distribution as well as some performance measures of the system in steady state. We show that the general stochastic decomposition law forM/G/1 vacation models also holds for the present system. Finally, we demonstrate that a few well known queueing models are special cases of the present model and discuss various interpretations of the stochastic decomposition law when applied to each of these special cases.

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

Reference

  1. P.J. Burke, Proof of a conjecture on the interarrivai time distribution in anM/M/1 queue with feedback, IEEE Trans. Commun. 24 (1976) 175–178.

    Google Scholar 

  2. B.D. Choi, and W.C. Ahn, Retrial queues with collision arising from unslotted CSMA/CD protocol, Queueing Syst. 11 (1992) 335–356.

    Google Scholar 

  3. E. Çinlar,Introduction to Stochastic Processes (Prentice-Hall, Englewood Cliffs, 1975).

    Google Scholar 

  4. R.B. Cooper, Queues served in cyclic order: waiting times, Bell Syst. Tech. J. 49 (1970) 399–413.

    Google Scholar 

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

    Google Scholar 

  6. B.T. Doshi, A note on stochastic decomposition in aGI/G/1 queue with vacations or set-up times, J. Appl. Prob. 22 (1985) 419–428.

    Google Scholar 

  7. B.T. Doshi, Queueing systems with vacations—A survey, Queueing Syst. 1 (1986) 29–66.

    Google Scholar 

  8. G. Falin, Retrial queues, Queueing Syst. 7 (1990) 127–168.

    Google Scholar 

  9. S.W. Fuhrmann, A note on theM/G/1 queue with server vacations, Oper. Res. 32 (1984) 1368–1373.

    Google Scholar 

  10. S.W. Fuhrmann and R.B. Cooper, Stochastic decomposition in theM/G/l queue with generalized vacations, Oper. Res. 33 (1985) 1117–1129.

    Google Scholar 

  11. D.P. Heyman, Optimal operating policies forM/G/l queueing systems, Oper. Res. 16 (1968) 362–382.

    Google Scholar 

  12. J. Keilson, J. Cozzolino and H. Young, A service system with unfilled requests repeated, Oper. Res. 16 (1968) 1126–1137.

    Google Scholar 

  13. L. Kleinrock, Analysis of a time-shared processor, Nav. Res. Log. Quart. 11 (1964) 59–73.

    Google Scholar 

  14. L. Kleinrock, Time-shared systems: a theoretical treatment, J. ACM 14 (1967) 242–261.

    Google Scholar 

  15. L. Kleinrock,Queueing Systems, Vol. I:Theory (Wiley, New York, 1975).

    Google Scholar 

  16. V.G. Kulkarni and B.D. Choi, Retrial queue with server subject to breakdowns and repairs, Queueing Syst. 7 (1990) 191–208.

    Google Scholar 

  17. A.J. Lemoine, Limit theorems for generalized single server queue, Adv. Appl. Prob. 6 (1974) 159–174.

    Google Scholar 

  18. A.J. Lemoine, Limit theorems for generalized single server queue: the exceptional system, SIAM J. Appl. Math. 28 (1975) 596–606.

    Google Scholar 

  19. H. Levy and L. Kleinrock, A queue with starter and a queue with vacations: delay analysis by decomposition, Oper. Res 34 (1986) 426–436.

    Google Scholar 

  20. Y. Levy and U. Yechiali, Utilization of idle time in anM/G/l queueing system, Manag. Sci. 22 (1975) 202–211.

    Google Scholar 

  21. D. Le Minh, Analysis of the exceptional queueing system by the use of regenerative processes and analytical methods, Math. Oper. Res. 5 (1980) 147–159.

    Google Scholar 

  22. M.F. Neuts and M.F. Ramalhoto, A service model in which the server is required to search for customers, J. Appl. Prob. 21 (1984) 157–166.

    Google Scholar 

  23. A.G. Pakes, Some conditions for ergodicity and recurrence of Markov chains, Oper. Res. 17 (1969) 1058–1061.

    Google Scholar 

  24. M. Scholl and L. Kleinrock, On the M/G/l queue with rest period and certain service-independent queueing disciplines, Oper. Res. 31 (1983) 705–719.

    Google Scholar 

  25. P.D. Welch, On a generalizedM/G/1 queueing process in which the first customer of each busy period receives exceptional service, Oper. Res. 12 (1964) 736–752.

    Google Scholar 

  26. T. Yang and J.G.C. Templeton, A survey on retrial queues, Queueing Syst. 2 (1987) 201–233.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Industrial Engineering, Technical University of Nova Scotia, B3J 2X4, Halifax, Nova Scotia, Canada

    Tao Yang

  2. Department of Mathematics, Mount Saint Vincent University, B3M 2J6, Halifax, Nova Scotia, Canada

    Hui Li

Authors
  1. Tao Yang
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Hui Li
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

Partially supported by the Natural Sciences and Engineering Research Council of Canada, grant OGP0046415.

Partially supported by internal research grant of Mount Saint Vincent University.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Yang, T., Li, H. TheM/G/1 retrial queue with the server subject to starting failures. Queueing Syst 16, 83–96 (1994). https://doi.org/10.1007/BF01158950

Download citation

  • Received:

  • Revised:

  • Issue Date:

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

Keywords

Search

Navigation