Skip to main content

Simulation of Finite-Source Retrial Queues with Two-Way Communications to the Orbit

  • Conference paper
  • First Online:

Part of the book series: Communications in Computer and Information Science ((CCIS,volume 1109))

Abstract

In this paper we investigate a single-server two-way communication system by the help of retrial queuing systems with finite source. From the finite source incoming primary calls enter into the system according to an exponential distribution. If the server is idle then the service of incoming customer starts immediately. Alternatively, if an incoming customer discovers the server in busy state it is directed towards the orbit, where after some exponentially distributed time retries to reach the server again. As soon as the server becomes idle it can generate an outgoing call to the customers in the orbit after an exponentially distributed time. In case of two-way communication after the service of an outgoing call it returns to the source. In this work we concentrate on emphasizing a phenomena of outgoing call on the mean waiting time of incoming customers. The novelty of this paper is to carry out a sensitivity analysis comparing various distributions of service time of primary customers on the performance measures like utilization of the server or mean waiting time. By the use of simulation several graphical results and comparison of the applied systems are illustrated.

The research was financed by the Higher Education Institutional Excellence Programme of the Ministry of Human Capacities in Hungary, within the framework of the 20428-3/2018/FEKUTSTRAT thematic programme of the University of Debrecen.

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

Buying options

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

Learn about institutional subscriptions

References

  1. Aguir, S., Karaesmen, F., Akşin, O.Z., Chauvet, F.: The impact of retrials on call center performance. OR Spectr. 26(3), 353–376 (2004)

    Article  MathSciNet  Google Scholar 

  2. Aksin, Z., Armony, M., Mehrotra, V.: The modern call center: a multi-disciplinary perspective on operations management research. Prod. Oper. Manag. 16(6), 665–688 (2007)

    Article  Google Scholar 

  3. Artalejo, J.R., Phung-Duc, T.: Markovian retrial queues with two way communication. J. Ind. Manag. Optim. 8(4), 781–806 (2012)

    Article  MathSciNet  Google Scholar 

  4. Artalejo, J., Corral, A.G.: Retrial Queueing Systems: A Computational Approach. Springer, Heidelberg (2008). https://doi.org/10.1007/978-3-540-78725-9

    Book  MATH  Google Scholar 

  5. Artalejo, J., Phung-Duc, T.: Single server retrial queues with two way communication. Appl. Math. Modell. 37(4), 1811–1822 (2013)

    Article  MathSciNet  Google Scholar 

  6. Brown, L., et al.: Statistical analysis of a telephone call center: a queueing-science perspective. J. Am. Stat. Assoc. 100(469), 36–50 (2005)

    Article  MathSciNet  Google Scholar 

  7. Dimitriou, I.: A retrial queue to model a two-relay cooperative wireless system with simultaneous packet reception. In: Wittevrongel, S., Phung-Duc, T. (eds.) ASMTA 2016. LNCS, vol. 9845, pp. 123–139. Springer, Cham (2016). https://doi.org/10.1007/978-3-319-43904-4_9

    Chapter  MATH  Google Scholar 

  8. Dragieva, V., Phung-Duc, T.: 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, p. 11. ACM (2016)

    Google Scholar 

  9. Dragieva, V., Phung-Duc, T.: Two-way communication M/M/1//N retrial queue. In: Thomas, N., Forshaw, M. (eds.) ASMTA 2017. LNCS, vol. 10378, pp. 81–94. Springer, Cham (2017). https://doi.org/10.1007/978-3-319-61428-1_6

    Chapter  MATH  Google Scholar 

  10. Falin, G., Artalejo, J.: A finite source retrial queue. Eur. J. Oper. Res. 108, 409–424 (1998)

    Article  Google Scholar 

  11. Fiems, D., Phung-Duc, T.: Light-traffic analysis of random access systems without collisions. Ann. Oper. Res. 277(2), 1–17 (2017). https://doi.org/10.1007/s10479-017-2636-7

    Article  MathSciNet  Google Scholar 

  12. Fishwick, P.A.: Simpack: getting started with simulation programming in C and C++. In: WSC 1992 Proceedings of the 24th Conference on Winter simulation, pp. 154–162. ACM (1992)

    Google Scholar 

  13. Gans, N., Koole, G., Mandelbaum, A.: Telephone call centers: tutorial, review, and research prospects. Manuf. Serv. Oper. Manag. 5(2), 79–141 (2003)

    Article  Google Scholar 

  14. Gómez-Corral, A., Phung-Duc, T.: Retrial queues and related models. Ann. Oper. Res. 247(1), 1–2 (2016). https://doi.org/10.1007/s10479-016-2305-2

    Article  MathSciNet  MATH  Google Scholar 

  15. Kim, J., Kim, B.: A survey of retrial queueing systems. Ann. Oper. Res. 247(1), 3–36 (2016). https://doi.org/10.1007/s10479-015-2038-7

    Article  MathSciNet  MATH  Google Scholar 

  16. Kuki, A., Sztrik, J., Tóth, Á., Bérczes, T.: A contribution to modeling two-way communication with retrial queueing systems. In: Dudin, A., Nazarov, A., Moiseev, A. (eds.) ITMM/WRQ -2018. CCIS, vol. 912, pp. 236–247. Springer, Cham (2018). https://doi.org/10.1007/978-3-319-97595-5_19

    Chapter  Google Scholar 

  17. Nazarov, A., Phung-Duc, T., Paul, S.: Heavy outgoing call asymptotics for MMPP/M/1/1 retrial queue with two-way communication. In: Dudin, A., Nazarov, A., Kirpichnikov, A. (eds.) ITMM 2017. CCIS, vol. 800, pp. 28–41. Springer, Cham (2017). https://doi.org/10.1007/978-3-319-68069-9_3

    Chapter  Google Scholar 

  18. Nazarov, A.A., Paul, S., Gudkova, I., et al.: Asymptotic analysis of Markovian retrial queue with two-way communication under low rate of retrials condition. In: Proceedings 31st European Conference on Modelling and Simulation (2017)

    Google Scholar 

  19. Phung-Duc, T., Rogiest, W.: Two way communication retrial queues with balanced call blending. In: Al-Begain, K., Fiems, D., Vincent, J.-M. (eds.) ASMTA 2012. LNCS, vol. 7314, pp. 16–31. Springer, Heidelberg (2012). https://doi.org/10.1007/978-3-642-30782-9_2

    Chapter  Google Scholar 

  20. Pustova, S.: Investigation of call centers as retrial queuing systems. Cybern. Syst. Anal. 46(3), 494–499 (2010)

    Article  MathSciNet  Google Scholar 

  21. Sakurai, H., Phung-Duc, T.: Two-way communication retrial queues with multiple types of outgoing calls. Top 23(2), 466–492 (2015). https://doi.org/10.1007/s11750-014-0349-5

    Article  MathSciNet  MATH  Google Scholar 

  22. Wolf, T.: System and method for improving call center communications, uS Patent App. 15/604,068. Accessed 30 Nov 2017

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to János Sztrik .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2019 Springer Nature Switzerland AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Sztrik, J., Tóth, Á., Pintér, Á., Bács, Z. (2019). Simulation of Finite-Source Retrial Queues with Two-Way Communications to the Orbit. In: Dudin, A., Nazarov, A., Moiseev, A. (eds) Information Technologies and Mathematical Modelling. Queueing Theory and Applications. ITMM 2019. Communications in Computer and Information Science, vol 1109. Springer, Cham. https://doi.org/10.1007/978-3-030-33388-1_22

Download citation

  • DOI: https://doi.org/10.1007/978-3-030-33388-1_22

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-030-33387-4

  • Online ISBN: 978-3-030-33388-1

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics