Skip to main content

Mathematical Model of the Tandem Retrial Queue M | GI | 1 | M | 1 with a Common Orbit

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

Abstract

This paper considers a retrial tandem queue with single orbit, Poisson arrivals of incoming calls and without intermediate buffer. The first server provides services for incoming calls for an arbitrary random time, while the second server does for an exponentially distributed random time. Blocked customers at either the first server or the second server join the orbit and stay there for an exponentially distributed time before retrying to enter the first server again. Under an asymptotic condition when the mean of retrial intervals is extremely large, we derive a diffusion limit, which is further utilized to obtain an approximation to the number of customers in the orbit in stationary regime.

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. Falin, G., Templeton, J.G.: Retrial Queues, vol. 75. CRC Press, Boca Raton (1997)

    Book  Google Scholar 

  2. Artalejo, J.R., Gómez-Corral, A.: Retrial Queueing Systems. Springer, Heidelberg (2008). https://doi.org/10.1007/978-3-540-78725-9

    Book  MATH  Google Scholar 

  3. Yang, T., Templeton, J.: A survey on retrial queues. Queueing Syst. 2, 203–233 (1987)

    Article  MathSciNet  Google Scholar 

  4. Falin, G.: A survey of retrial queues. Queueing Syst. 7, 127–168 (1987)

    Article  MathSciNet  Google Scholar 

  5. Phung-Duc, T.: Retrial queueing models: a survey on theory and applications. In: Stochastic Operations Research in Business and Industry. Springer (2007)

    Google Scholar 

  6. Kumar, B.K., Sankar, R., Krishnan, R.N., Rukmani, R.: Performance analysis of multi-processor two-stage tandem call center retrial queues with non-reliable processors. Methodol. Comput. Appl. Probab. 24, 1–48 (2021)

    MathSciNet  MATH  Google Scholar 

  7. Vishnevsky, V.M., Larionov, A.A., Semyonova, O.V.: Evaluating the performance of a high-speed wireless tandem network using centimeter and millimeter-wave radio channels in road safety management systems. Manage. Probl. (4) (2013)

    Google Scholar 

  8. Kuznetsov, N.A., Myasnikov, D.V., Semenikhin, K.V.: Optimal control of data transmission in a mobile two-agent robotic system. J. Commun. Technol. Electron. 61(12), 1456–1465 (2016). https://doi.org/10.1134/S1064226916120159

    Article  Google Scholar 

  9. Moutzoukis, E., Langaris, C.: Two queues in tandem with retrial customers. Probab. Eng. Inf. Sci. 15(3), 311–325 (2001)

    Article  MathSciNet  Google Scholar 

  10. Avrachenkov, K., Yechiali, U.: On tandem blocking queues with a common retrial queue. Comput. Oper. Res. 37(7), 1174–1180 (2010)

    Article  MathSciNet  Google Scholar 

  11. Phung-Duc, T.: An explicit solution for a tandem queue with retrials and losses. Oper. Res. Int. J. 12(2), 189–207 (2012)

    Article  Google Scholar 

  12. Kim, C.S., Park, S.H., Dudin, A., Klimenok, V., Tsarenkov, G.: Investigation of the bmap/g/1\(\rightarrow \cdot \)/ph/1/m tandem queue with retrials and losses. Appl. Math. Model. 34(10), 2926–2940 (2010)

    Article  MathSciNet  Google Scholar 

  13. Nazarov, A., Paul, S., Phung-Duc, T., Morozova, M.: Scaling limits of a tandem retrial queue with common orbit and poisson arrival process. In: Vishnevskiy, V.M., Samouylov, K.E., Kozyrev, D.V. (eds.) DCCN 2021. LNCS, vol. 13144, pp. 240–250. Springer, Cham (2021). https://doi.org/10.1007/978-3-030-92507-9_20

    Chapter  Google Scholar 

  14. Nazarov, A., Paul, S., Phung-Duc, T., Morozova, M.: Analysis of tandem retrial queue with common orbit and poisson arrival process. In: Ballarini, P., Castel, H., Dimitriou, I., Iacono, M., Phung-Duc, T., Walraevens, J. (eds.) EPEW/ASMTA -2021. LNCS, vol. 13104, pp. 441–456. Springer, Cham (2021). https://doi.org/10.1007/978-3-030-91825-5_27

    Chapter  Google Scholar 

  15. Pourbabai, B.: Tandem behavior of a telecommunication system with finite buffers and repeated calls. Queueing Syst. 6, 89–108 (1990)

    Article  MathSciNet  Google Scholar 

  16. Takahara, G.: Fixed point approximations for retrial networks. Probab. Eng. Inf. Sci. 10, 243–259 (1996)

    Article  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Svetlana Paul .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2022 Springer Nature Switzerland AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Paul, S., Nazarov, A., Phung-Duc, T., Morozova, M. (2022). Mathematical Model of the Tandem Retrial Queue M | GI | 1 | M | 1 with a Common Orbit. In: Dudin, A., Nazarov, A., Moiseev, A. (eds) Information Technologies and Mathematical Modelling. Queueing Theory and Applications. ITMM 2021. Communications in Computer and Information Science, vol 1605. Springer, Cham. https://doi.org/10.1007/978-3-031-09331-9_11

Download citation

  • DOI: https://doi.org/10.1007/978-3-031-09331-9_11

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-031-09330-2

  • Online ISBN: 978-3-031-09331-9

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics