Operational Research

, Volume 12, Issue 2, pp 189–207

An explicit solution for a tandem queue with retrials and losses

Original Paper

Abstract

We consider a retrial tandem queueing system with two servers whose service times follow two exponential distributions. There are two types of customers: type one and type two. Customers of type one arrive at the first server according to a Poisson process. An arriving customer of type one that finds the first server busy joins an orbit and retries to enter the server after some time. We assume that the arrival rate of customers from the orbit is a linear function of the number of retrial customers. After being served at the first server, a customer of type one moves to the second server. Customers of type two directly arrive at the second server according to another Poisson process. Customers of both types one and two are lost if the second server is busy upon arrival. For this model, we derive explicit expressions of the joint stationary distribution between the number of customers in the orbit and the states of the servers. We prove that the stationary distribution is computed by a numerically stable algorithm. Numerical examples are provided to show the influence of parameters on the performance of the system.

Keywords

Tandem queue Retrial queue Hypergeometric function Linear retrial rate Call centers 

Mathematics Subject Classification (2000)

68M20 90B22 60K25 

References

  1. Aida M, Takano C, Murata M, Imase M (2008) A study of control plane stability with retry traffic: comparison of hard- and soft-state protocols. IEICE Trans Commun E91-B:437–445CrossRefGoogle Scholar
  2. Artalejo JR, Gomez-Corral A (1997) Steady state solution of a single-server queue with linear repeated requests. J Appl Prob 34:223–233CrossRefGoogle Scholar
  3. Artalejo JR, Gomez-Corral A, Neuts MF (2001) Analysis of multiserver queues with constant retrial rate. Eur J Oper Res 135:123–135CrossRefGoogle Scholar
  4. Avrachenkov K, Yechiali U (2008) Retrial networks with finite buffers and their application to internet data traffic. Prob Eng Inform Sci 22:519–536CrossRefGoogle Scholar
  5. Avrachenkov K, Yechiali U (2010) On tandem blocking queues with a common retrial queue. Comput Oper Res 37:1174–1180CrossRefGoogle Scholar
  6. Choi BD, Shin YW, Ahn WC (1992) Retrial queues with collision arising from unslotted CSMA/CD protocol. Queueing Syst 11:335–356CrossRefGoogle Scholar
  7. Cuyt A, Petersen VB, Verdonk B, Waadeland H, Jones WB (2008) Handbook of continued fractions for special functions. Springer, BerlinGoogle Scholar
  8. Falin GI, Templeton JGC (1997) Retrial queues. Chapman & Hall, LondonGoogle Scholar
  9. Gomez-Corral A (2002a) A tandem queue with blocking and Markovian arrival process. Queueing Syst 41:343–370CrossRefGoogle Scholar
  10. Gomez-Corral A (2002b) A matrix-geometric approximation for tandem queues with blocking and repeated attempts. Oper Res Lett 30:360–374CrossRefGoogle Scholar
  11. Hanschke T (1987) Explicit formulas for the characteristics of the M/M/2/2 queue with repeated attempts. J Appl Prob 24:486–494CrossRefGoogle Scholar
  12. Kim CS, Klimenok V, Tsarenkov G, Breuer L, Dudin A (2007) The BMAP/G/1 \(\rightarrow \cdot\) /PH/1/M tandem queue with feedback and losses. Perform Eval 64:802–818CrossRefGoogle Scholar
  13. Kim JW, Park SC (2010) Outsourcing strategy in two-stage call centers. Comput Oper Res 37:790–805CrossRefGoogle Scholar
  14. Kim CS, Park SH, Dudin A, Klimenok V, Tsarenkov G (2010a) Investigation of the BMAP/G/1 \(\rightarrow\cdot\) /PH/1/M tandem queue with retrials and losses. Appl Math Model 34:2926–2940CrossRefGoogle Scholar
  15. Kim CS, Klimenok V, Taramin O (2010b) A tandem retrial queueing system with two Markovian flows and reservation of channels. Comput Oper Res 37:1238–1246CrossRefGoogle Scholar
  16. Klimenok V, Breuer L, Tsarenkov G, Dudin A (2005) The BMAP/G/1/N \(\rightarrow\cdot\) /PH/1/M tandem queue with losses. Perform Eval 61:17–40CrossRefGoogle Scholar
  17. Latouche G, Neuts MF (1980) Efficient algorithmic solutions to exponential tandem queues with blocking. SIAM J Algebr Discrete Methods 1:93–106CrossRefGoogle Scholar
  18. Lian Z, Zhao N (2010) Departure processes and busy periods of a tandem network. Oper Res Int J. doi:10.1007/s12351-010-0076-0
  19. Moutzoukis E, Langaris C (2001) Two queues in a tandem with retrial customers. Prob Eng Inform Sci 15:311–325CrossRefGoogle Scholar
  20. Taramin O (2009) A tandem queue with two Markovian inputs and retrial customers. Comput Model New Technol 13:38–47Google Scholar

Copyright information

© Springer-Verlag 2011

Authors and Affiliations

  1. 1.Graduate School of InformaticsKyoto UniversityYoshida-HonmachiJapan

Personalised recommendations