Advertisement

A finite-source M/G/1 retrial queue with outgoing calls

  • Velika I. Dragieva
  • Tuan Phung-DucEmail author
S.I.: Queueing Theory and Network Applications II
  • 8 Downloads

Abstract

In this paper we deal with a single-server, finite-source retrial queue where the server not only accepts incoming calls but after some exponentially distributed idle time makes outgoing calls. The service times of incoming and outgoing calls follow two distinct arbitrary distributions. The outgoing calls are directed not to the customers in the system but outside it, which implies that the model can be considered as a model with vacations or with customers of two types. Along with the standard retrial queue where all customers are allowed to join the orbit we consider also the corresponding queue with restriction on the orbit size. We derive formulas for computing the stationary system state distribution and investigate the influence of the system input parameters on the main macro characteristics of the system performance.

Keywords

Finite queues Retrials Outgoing calls Restriction on the orbit size 

Notes

Acknowledgements

T. Phung-Duc was supported in part by JSPS KAKENHI Grant Number 18K18006.

References

  1. Aguir, S., Karaesmen, E., Aksin, O., & Chauvet, F. (2004). The impact of retrials on call center performance. OR Spectrum, 26, 353–376.CrossRefGoogle Scholar
  2. Amador, J. (2010). On the distribution of the successful and blocked events in retrial queues with finite number of sources. Proceedings of the 5th international conference on Queueing theory and network applications (pp. 15–22).Google Scholar
  3. Artalejo, J., & Gómez-Corral, A. (2007). Waiting time analysis of the M/G/1 queue with finite retrial group. Naval Research Logistics, 54(5), 524–529.  https://doi.org/10.1002/nav.20227.CrossRefGoogle Scholar
  4. Artalejo, J., & Gómez-Corral, A. (2008). Retrial queueing systems: A computational approach. Berlin: Springer.CrossRefGoogle Scholar
  5. Artalejo, J., & Phung-Duc, T. (2012). Markovian retrial queues with two way communication. Journal of Industrial and Management Optimization, 8, 781–806.CrossRefGoogle Scholar
  6. Artalejo, J., & Phung-Duc, T. (2013). Single server retrial queues with two way communication. Applied Mathematical Modeling, 37, 1811–1822.CrossRefGoogle Scholar
  7. Balazsfalvi, G., & Sztrik, J. (2008). A tool for modeling distributed protocols. PIK, 31(1), 39–44.Google Scholar
  8. Biro, J., Berchez, T., Korosi, A., Heszberger, Z., & Sztrik, J. (2013). Discriminatory processor sharing from optimization point of view. In ASMTA (pp. 67–80).Google Scholar
  9. Choi, B., Choi, K., & Lee, Y. (1995). M/G/1 retrial queueing systems with two types of calls and finite capacity. Queueing Systems, 19, 215–229.CrossRefGoogle Scholar
  10. Choi, B., Shin, Y. W., & Ahn, W. C. (1992). Retrial queues with collision arising from unslotted CSMA/CD protocol. Queueing Systems, 11(4), 335–356.CrossRefGoogle Scholar
  11. Cooper, R. (1981). Introduction to queueing theory (2nd ed.). London: Edward Arnold.Google Scholar
  12. Deslauriers, A., L’Ecuyer, P., Pichitlamken, J., Ingolfsson, A., & Avramidis, A. (2007). Markov chain models of a telephone call center with call blending. Computers and Operations Research, 34, 1616–1645.CrossRefGoogle Scholar
  13. Dragieva, V., & Phung-Duc, T. (2016). Two-way communication M/M/1 retrial queue with server-orbit interaction. In Proceedings of the 11th international conference on Queueing theory and network applications, (ACM Digital Library).  https://doi.org/10.1145/3016032.3016049.
  14. Dragieva, V., & Phung-Duc, T. (2017). Two-way communication M/M/1//N retrial queue. In Proceedings of 24th international conference on analytical & stochastic modelling techniques & applications (ASMTA 2017), LNCS 10378 (pp. 81–94).Google Scholar
  15. Dragieva, V. (2013). A finite source retrial queue: number of retrials. Communications in Statistics - Theory and Methods, 42(5), 812–829.CrossRefGoogle Scholar
  16. Dragieva, V. (2016). Steady state analysis of the M/G/1//N queue with orbit of blocked customers. Annals of Operations Research, 247(1), 121–140.CrossRefGoogle Scholar
  17. Falin, G. (1979). Model of coupled switching in presence of recurrent calls. Engineering Cybernetics Review, 17, 53–59.Google Scholar
  18. Falin, G., & Artalejo, J. (1998). A finite source retrial queue. European Journal of Operational Research, 108, 409–424.CrossRefGoogle Scholar
  19. Falin, G., Artalejo, J., & Martin, M. (1993). On the single server retrial queue with priority customers. Queueing Systems, 14, 439–455.CrossRefGoogle Scholar
  20. Falin, G., & Templeton, J. (1997). Retrial queues. London: Chapman and Hall.CrossRefGoogle Scholar
  21. Fiems, D., & Phung-Duc, T. (2019). Light-traffic analysis of random access systems without collisions. Annals of Operations Research, 277(2), 311–327.  https://doi.org/10.1007/s10479-017-2636-7.CrossRefGoogle Scholar
  22. Gómez-Corral, A., & Phung-Duc, T. (2016). Retrial queues and related models. Annals of Operations Research, 247(1), 1–2.CrossRefGoogle Scholar
  23. Jain, R. (1991). The art of computer systems performance analysis. New York: Wiley.Google Scholar
  24. Jaiswal, N. (1969). Priority queues. New York: Academic press.Google Scholar
  25. Kim, J., & Kim, B. (2016). A survey of retrial queueing systems. Annals of Operations Research, 247(1), 3–36.CrossRefGoogle Scholar
  26. Kuki, A., Sztrik, J., Toth, A., Berches, T. (2018). A contribution to modeling two-way communication with retrial queueing systems. In A. Dudin, A. Nazarov, A. Moiseev (Eds.), Information technologies and mathematical modelling. Queueing Theory and applications, ITMM 2018, communications in computer and information science, (Vol. 912, pp. 236–247).  https://doi.org/10.1007/978-3-319-97595-5_17.
  27. Nazarov, A., Sztrik, J., & Kvach, A. (2018). Asymptotic sojourn time analysis of finite-source M/M/1 retrial queueing system with two-way communication. In A. Dudin, A. Nazarov, & A. Moiseev (Eds.), Information technologies and mathematical modelling. Queueing theory and applications, ITMM 2018, communications in computer and information science (Vol. 912, pp. 172–183).  https://doi.org/10.1007/978-3-319-97595-5_17.
  28. Nazarov, A., Sztrik, J., Kvach, A. (2017). Some features of a finite-source M/GI/1 retrial queueing system with collisions of customers. In Proceedings of 20th international conference, DCCN (pp. 186–200).Google Scholar
  29. Ohmura, H., & Takahashi, Y. (1985). An analysis of repeated call model with a finite number of sources. Electronics and Communications in Japan, 68, 112–121.CrossRefGoogle Scholar
  30. Sakurai, H., & Phung-Duc, T. (2015). Two-way communication retrial queues with multiple types of outgoing calls. Top, 23, 466–492.CrossRefGoogle Scholar
  31. Tran-Gia, P., & Mandjes, M. (1997). Modeling of customer retrial phenomenon in cellular mobile networks. IEEE Journal on Selected Areas in Communications, 15, 1406–1414.CrossRefGoogle Scholar
  32. Van Do, T., Wochner, P., Berches, T., & Sztrik, J. (2014). A new finite-source queueing model for mobile cellular networks applying spectrum renting. Asia-Pacific Journal of Operational Research, 31, 14400004.CrossRefGoogle Scholar
  33. Wang, J., Wang, F., Sztrick, J., & Kuki, A. (2017). Finite source retrial queue with two phase service. International Journal of Operational Research, 3(4), 421–440.CrossRefGoogle Scholar
  34. Wang, J., Zhao, L., & Zhang, F. (2011). Analysis of the finite source retrial queues with server breakdowns and repairs. Journal of Industrial and Management Optimization, 7(3), 655–676.CrossRefGoogle Scholar
  35. Zhang, F., & Wang, J. (2013). Performance analysis of the retrial queues with finite number of sources and service interruption. Journal of the Korean Statistical Society, 42, 117–131.CrossRefGoogle Scholar

Copyright information

© Springer Science+Business Media, LLC, part of Springer Nature 2019

Authors and Affiliations

  1. 1.University of ForestrySofiaBulgaria
  2. 2.University of TsukubaTsukubaJapan

Personalised recommendations