Skip to main content

Retrial Queue with Search of Interrupted Customers from the Finite Orbit

  • Conference paper
  • First Online:
Information Technologies and Mathematical Modelling. Queueing Theory and Applications (ITMM 2018, WRQ 2018)

Abstract

In this paper we consider a single server retrial queue with two orbits of which the first orbit is occupied by primary customers who on arrival find the server busy or interrupted. The other orbit has finite capacity and consists of customers whose service get interrupted due to server breakdown. Interrupted customers are picked up with probability p by the server at the epoch at which he/she becomes free either by the successful completion of a service or by completion of repair. Also there arises a competition between primary customers, retrial customers from the first and the second orbit to access the server. Failed retrials result in the customers returning to the respective orbits. The primary customers arrive according to a Markovian arrival process (MAP), the interruption occur according to a Poisson process. Fixing of interruption takes a random duration having phase type distribution. The service time follows phase type distribution. Stability condition of the system is established. Steady-state system size distribution is obtained. Performance characteristics of the system are evaluated.

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

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

References

  1. Aissani, A.: Unreliable queueing with repeatede orders. Micro. and Reli. 33 (1993)

    Google Scholar 

  2. Aissani, A., Artalejo, J.R.: On the single server retrial queue subject to breakdowns. Que. Syst. 30 (1998)

    Google Scholar 

  3. Artalejo, J.R., Gomez-Corral, A.: Retrial Queueing Systems: A Computational Approach. Springer, Berlin (2008)

    Book  Google Scholar 

  4. Artalejo, J.R.: Accessible bibliography of research on retrial queues. Math. Comput. Model. 30, 1–6 (1999)

    Article  Google Scholar 

  5. Artalejo, J.R.: A classified bibliography of research on retrial queues. Progress 1990–1999 Top 7, 187–211 (1999)

    Google Scholar 

  6. Artalejo, J.R., Joshua, V.C, Krishnamoorthy, A.: An M/G/1 retrial queue with orbital search by server. In: Adv. in Stoch. Model, pp. 41–54. Notable Publications, New Jersey (2002)

    Google Scholar 

  7. Artalejo, J.R., Phung, T.D.: Single server retrial queues with two way communication. Appl. Mathe. Model. 37, 1811–1822 (2013)

    Article  MathSciNet  Google Scholar 

  8. Artalejo, J.R.: New results in retrial queueing systems with breakdown of the servers. Stati. Neerl. 48(I), 23–36 (1994)

    Google Scholar 

  9. Artalejo, J.R., Gomez-Corral, A.: Steady state solution of a single-server queue with linear repeated requests. J. Appl. Prob. 34, 223–233 (1997)

    Article  MathSciNet  Google Scholar 

  10. Chakravarthy, S.R., Krishnamoorthy, A., Joshua, V.C.: Analysis of a multi-server retrial queue with search of customers from the orbit. Perf. Eval. 63(8), 776–798 (2006)

    Article  Google Scholar 

  11. Choi, B.D., Kulkarni, B.D.: Feedback retrial queueing systems. In: Queueing and Related Models. Ox. Scie. Publi. (1992)

    Google Scholar 

  12. White, H.C., Christie, L.S.: Queueing with preemptive priorities or with breakdown. Oper. Res. 6, 79–95 (1958)

    Article  Google Scholar 

  13. Dudin, A.N., Krishnamoorthy, A., Joshua, V.C., Tsarenkov, G.: Analysis of BMAP/G/1 retrial system with search of customers from the orbit. Eur. J. Oper. Res. 157, 169–179 (2004)

    Google Scholar 

  14. Falin, G.I.: A survey of Retrial queues. Q. Syst. 7(2), 127–167 (1990)

    Article  MathSciNet  Google Scholar 

  15. Falin, G.I., Templeton, J.G.C.: Retrial Queues. Chapman and Hall, London (1997)

    Book  Google Scholar 

  16. Fiems, D., Bruneel, H.: Queueing systems with different types of server interruptions. Eur. J. Oper. Res. 188, 838–845 (2008)

    Article  Google Scholar 

  17. Gaver, D.: A waiting line with interrupted service including priority. J. Roy. Stat. Soc. B24, 90 (1962)

    MATH  Google Scholar 

  18. Krishnamoorthy, A., Deepak, T.G., Joshua, V.C.: An M/G/1 retrial queue with non persistent customers and orbital search. Stoch. Anal. Appl. 23, 975–997 (2005)

    Article  MathSciNet  Google Scholar 

  19. Krishnamoorthy, A., Ushakumari, P.V.: Reliability of a k-out-of -n system with repair and retrial of failed units. Top 7, 293–304 (1999)

    Article  MathSciNet  Google Scholar 

  20. Krishnamoorthy, A., Pramod, P.K., Deepak, T.G.: On a queue with interruptions and repeat or resumption of service. No. Lin. Anal. (2009)

    Google Scholar 

  21. Latouche, G., Ramaswami, V.: Introduction to Matrix analytic Methods in Stochastic Modelling. Amer. Stat. Asso, Siam (1999)

    Book  Google Scholar 

  22. Li, T., Zhang, L.: An M/G/1 Retrial G-queue with general retrial times and working breakdowns. Math. Comput. Appl. 22(1), 15 (2017)

    MathSciNet  Google Scholar 

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

    Google Scholar 

  24. Neuts, M.F.: Probability distributions of phase type. In: Liber Amicorum Prof. Emeritus H. Florin, Department of Mathematics, University of Louvain, pp. 173–206 (1975)

    Google Scholar 

  25. Neuts, M.F.: Matrix-Geometric Solutions in Stochastic Models - An Algorithmic Approach. The Johns Hopkins University Press, Baltimore and London (1981)

    MATH  Google Scholar 

  26. Neuts, M.F.: Markov chains with applications in queueing theory which have a matrix- geometric invariant probability vector. Adv. Appl. prob. 10, 185–212 (1978)

    Article  MathSciNet  Google Scholar 

  27. Sengupta, B.: A queue with service interruptions in an alternating random environment. Oper. Res. 38, 308–318 (1989)

    Google Scholar 

  28. Jacob, V., Chakravarthy, S.R., Krishnamoorthy, A.: On a customer induced interruption in a service systems. J. Stoch. Anal. Appl. 30, 1–13 (2012)

    Google Scholar 

  29. Wang, J., Cao, J., Li, Q.: Reliability analysis of the retrial queue with server breakdowns and repairs. Que. Syst. 38, 363–380 (2001)

    Article  MathSciNet  Google Scholar 

  30. Yang, T., Templeton, J.G.: A survey on retrial queues. Que. Sys. 2, 201–233 (1987)

    Article  MathSciNet  Google Scholar 

Download references

Acknowledgments

The work of the third author is supported by the Maulana Azad National fellowship \([F1-17.1/2015-16/MANF-2015-17-KER-65493]\) of University Grants commission, India.

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Varghese C. Joshua .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2018 Springer Nature Switzerland AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Babu, D., Krishnamoorthy, A., Joshua, V.C. (2018). Retrial Queue with Search of Interrupted Customers from the Finite Orbit. In: Dudin, A., Nazarov, A., Moiseev, A. (eds) Information Technologies and Mathematical Modelling. Queueing Theory and Applications. ITMM WRQ 2018 2018. Communications in Computer and Information Science, vol 912. Springer, Cham. https://doi.org/10.1007/978-3-319-97595-5_28

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-97595-5_28

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-97594-8

  • Online ISBN: 978-3-319-97595-5

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics