Skip to main content

Investigation of a Finite-Source Retrial Queueing System with Two-Way Communication, Catastrophic Breakdown and Impatient Customers Using Simulation

  • Conference paper
  • First Online:
Distributed Computer and Communication Networks: Control, Computation, Communications (DCCN 2022)

Abstract

An M/M/1//N retrial queueing system with two-way communication to the infinite source and impatient customers in the orbit is considered in the paper. There is a finite source in which the primary or regular customers are coming, while requests from the infinite source are the secondary customers. Because of not having waiting queues, the service of an arriving, primary customer begins immediately. Otherwise, in the case of a busy server, the primary customers are forwarded to the orbit waiting an exponentially distributed random time to try to reach the service unit. When the service unit is in an idle state, it may call a customer from the infinite source for service. All requests possess an impatience property resulting in an earlier departure from the system through the orbit if they wait too much for being served. Besides, the service unit is supposed to break down according to several distributions which have a specialty in removing all the customers located in the system. In the case of a faulty state, blocking is applied not allowing the customers into the system until the service unit fully recovers. This work concentrates on examining the effect of those distributions on several performance measures like the distribution of the number of customers in the system, and the probability of a primary customer departing because of catastrophe. The obtained results are graphically realized to show the differences and curiosities among the used parameter settings of the various distributions.

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 69.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 89.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. Ali, A.A., Wei, S.: Modeling of coupled collision and congestion in finite source wireless access systems. In: 2015 IEEE Wireless Communications and Networking Conference (WCNC), pp. 1113–1118. IEEE (2015)

    Google Scholar 

  2. 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 

  3. Chakravarthy, S.R., Subramanian, S.: A stochastic model for automated teller machines subject to catastrophic failures and repairs. SIMULATION 1(1), 75–94 (2018)

    Google Scholar 

  4. Chen, E.J., Kelton, W.D.: A procedure for generating batch-means confidence intervals for simulation: checking independence and normality. SIMULATION 83(10), 683–694 (2007)

    Article  Google Scholar 

  5. 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 

  6. Dragieva, V.I.: Number of retrials in a finite source retrial queue with unreliable server. Asia Pac. J. Oper. Res. 31(2), 1–23 (2014). https://doi.org/10.1142/S0217595914400053

    Article  MathSciNet  MATH  Google Scholar 

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

    Article  MATH  Google Scholar 

  8. Fiems, D., Phung-Duc, T.: Light-traffic analysis of random access systems without collisions. Ann. Oper. Res. 277(2), 311–327 (2019)

    Article  MathSciNet  MATH  Google Scholar 

  9. Fishwick, P.A.: SimPack: getting started with simulation programming in C and C++. In: 1992 Winter Simulation Conference, pp. 154–162 (1992)

    Google Scholar 

  10. Gupta, N.: Article: A view of queue analysis with customer behaviour and priorities. In: IJCA Proceedings on National Workshop-Cum-Conference on Recent Trends in Mathematics and Computing 2011, RTMC(4), May 2012

    Google Scholar 

  11. Gupta, U.C., Kumar, N., Barbhuiya, F.P.: A queueing system with batch renewal input and negative arrivals. In: Joshua, V.C., Varadhan, S.R.S., Vishnevsky, V.M. (eds.) Applied Probability and Stochastic Processes. ISFS, pp. 143–157. Springer, Singapore (2020). https://doi.org/10.1007/978-981-15-5951-8_10

    Chapter  MATH  Google Scholar 

  12. Kim, J., Kim, B.: A survey of retrial queueing systems. Ann. Oper. Res. 247(1), 3–36 (2016)

    Article  MathSciNet  MATH  Google Scholar 

  13. Krishnamoorthy, A., Pramod, P.K., Chakravarthy, S.R.: Queues with interruptions: a survey. TOP 22(1), 290–320 (2014)

    Article  MathSciNet  MATH  Google Scholar 

  14. Kumar, R., Jain, N., Som, B.: Optimization of an \(M/M/1/N\) feedback queue with retention of reneged customers. Oper. Res. Decis. 24, 45–58 (2014). https://doi.org/10.5277/ord140303

    Article  MathSciNet  MATH  Google Scholar 

  15. Lakaour, L., Aïssani, D., Adel-Aissanou, K., Barkaoui, K.: \( M/M/1\) retrial queue with collisions and transmission errors. Methodol. Computi. Appl. Probab. 21(4), 1395–1406 (2018)

    Article  MathSciNet  MATH  Google Scholar 

  16. Panda, G., Goswami, V., Datta Banik, A., Guha, D.: Equilibrium balking strategies in renewal input queue with Bernoulli-schedule controlled vacation and vacation interruption. J. Ind. Manag. Optim. 12, 851–878 (2015). https://doi.org/10.3934/jimo.2016.12.851

    Article  MathSciNet  MATH  Google Scholar 

  17. Peng, Y., Liu, Z., Wu, J.: An \(\rm M/\rm G\rm /1\) retrial G-queue with preemptive resume priority and collisions subject to the server breakdowns and delayed repairs. J. Appl. Math. Comput. 44(1–2), 187–213 (2014). https://doi.org/10.1007/s12190-013-0688-7

  18. Sztrik, J., Tóth, Á., Pintér, Á., Bács, Z.: The simulation of finite-source retrial queueing systems with two-way communication and impatient customers. In: Vishnevskiy, V.M., Samouylov, K.E., Kozyrev, D.V. (eds.) DCCN 2021. LNCS, vol. 13144, pp. 117–127. Springer, Cham (2021). https://doi.org/10.1007/978-3-030-92507-9_11

    Chapter  MATH  Google Scholar 

  19. Takeda, T., Yoshihiro, T.: A distributed scheduling through queue-length exchange in CSMA-based wireless mesh networks. J. Inf. Process. 25, 174–181 (2017)

    Google Scholar 

  20. Tóth, A., Sztrik, J., Pintér, A., Bács, Z.: Reliability analysis of finite-source retrial queuing system with collisions and impatient customers in the orbit using simulation. In: 2021 International Conference on Information and Digital Technologies (IDT), pp. 230–234 (2021). https://doi.org/10.1109/IDT52577.2021.9497567

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Ádám Tóth .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2022 The Author(s), under exclusive license to 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. (2022). Investigation of a Finite-Source Retrial Queueing System with Two-Way Communication, Catastrophic Breakdown and Impatient Customers Using Simulation. In: Vishnevskiy, V.M., Samouylov, K.E., Kozyrev, D.V. (eds) Distributed Computer and Communication Networks: Control, Computation, Communications. DCCN 2022. Lecture Notes in Computer Science, vol 13766 . Springer, Cham. https://doi.org/10.1007/978-3-031-23207-7_18

Download citation

  • DOI: https://doi.org/10.1007/978-3-031-23207-7_18

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-031-23206-0

  • Online ISBN: 978-3-031-23207-7

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics