Skip to main content

Scaling Limits of a Tandem Retrial Queue with Common Orbit and Poisson Arrival Process

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

Abstract

In this paper, we consider an asymptotic analysis for the stationary queue length of a tandem queueing system with one orbit, Poisson arrival process of incoming calls and two sequentially connected servers. Under the condition that the average delay time of calls in the orbit is extremely large, we obtain the asymptotic probability distribution of the number of calls there. It turns out that the scaled version of the number of calls in the orbit follow the Gaussian distribution. Then we evaluate the applicability of the asymptotic results by simulation.

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 64.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 84.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. 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 

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

  3. Avrachenkov, K., Yechiali, U.: Retrial networks with finite buffers and their application to internet data traffic. Prob. Eng. Inf. Sci. 22(4), 519–536 (2008)

    Article  MathSciNet  Google Scholar 

  4. Basharin, G.P.: Analysis of queues in computer networks: theory and calculation methods. The science. Ch. ed. phys.-mat. lit. (1989)

    Google Scholar 

  5. Falin, G., Templeton, J.G.: Retrial Queues, vol. 75. CRC Press, Boca Raton (1997)

    Book  Google Scholar 

  6. Kim, C., Dudin, A., Dudin, S., Dudina, O.: Tandem queueing system with impatient customers as a model of call center with interactive voice response. Perf. Eval. 70(6), 440–453 (2013)

    Article  Google Scholar 

  7. Kim, C., Dudin, A., Klimenok, V.: Tandem retrial queueing system with correlated arrival flow and operation of the second station described by a Markov chain. In: Kwiecień, A., Gaj, P., Stera, P. (eds.) CN 2012. CCIS, vol. 291, pp. 370–382. Springer, Heidelberg (2012). https://doi.org/10.1007/978-3-642-31217-5_39

    Chapter  Google Scholar 

  8. Klimenok, V., Savko, R.: A retrial tandem queue with two types of customers and reservation of channels. In: Dudin, A., Klimenok, V., Tsarenkov, G., Dudin, S. (eds.) BWWQT 2013. CCIS, vol. 356, pp. 105–114. Springer, Heidelberg (2013). https://doi.org/10.1007/978-3-642-35980-4_12

    Chapter  MATH  Google Scholar 

  9. 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. Prob. 1–48 (2021). https://doi.org/10.1007/s11009-020-09842-6

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

  11. Meester, L.E., Shanthikumar, J.G.: Concavity of the throughput of tandem queueing systems with finite buffer storage space. Adv. Appl. Prob. 22(3), 764–767 (1990)

    Article  MathSciNet  Google Scholar 

  12. Nazarov, A.A., Moiseeva, S.P.: The method of asymptotic analysis in queuing theory. Publishing house of Scientific and technical literature (2006)

    Google Scholar 

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

    MATH  Google Scholar 

  14. Vishnevsky, V.M., Larionov, A.A., Semenova, O.V.: Performance evaluation of the high-speed wireless tandem network using centimeter and millimeter-wave channels. Probl. Upravlen. 4, 50–56 (2013)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2021 Springer Nature Switzerland AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Nazarov, A., Paul, S., Phung-Duc, T., Morozova, M. (2021). 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) Distributed Computer and Communication Networks: Control, Computation, Communications. DCCN 2021. Lecture Notes in Computer Science(), vol 13144. Springer, Cham. https://doi.org/10.1007/978-3-030-92507-9_20

Download citation

  • DOI: https://doi.org/10.1007/978-3-030-92507-9_20

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-030-92506-2

  • Online ISBN: 978-3-030-92507-9

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics