Skip to main content

On a retrial queueing model with single/batch service and search of customers from the orbit


A single server retrial queueing system, where customers arrive according to a batch Poisson process and are served either in single or as a batch, is considered here. An arriving batch, finding the server busy, enters an orbit. Otherwise, one customer, a few customers, or all customers from the arriving batch, depending on if the batch size exceeds a threshold value or not, enter service immediately, while the rest join the orbit. Customers from the orbit try to reach the server subsequently with the inter-retrial times, exponentially distributed. Additionally, at each service completion epoch, one of the two types of search mechanisms say, type I and type II search, to bring the orbital customers to service, is switched on—type I search when the orbit size is less than the threshold value and type II search otherwise. This means that, while the server is idle, a competition takes place among primary customers, customers who come by retrial and by one of the two types of search as the case may be. A type I search selects a single customer whereas a type II search takes a batch of customers from the orbit. In the case of primary customers and those who come by type II search, maximum size of the batch taken into service is restricted to a pre-assigned value. Both single and batch service are assumed to be arbitrarily distributed with different distributions, which are independent of each other. Steady state analysis is performed. Some important system descriptors are computed algorithmically and numerical illustrations are provided.

This is a preview of subscription content, access via your institution.


  1. Amador J, Artalejo JR (2009) The \(M/G/1\) retrial queue: new descriptors of the customer’s behavior. J Comput Appl Math 223:15–26

    Article  Google Scholar 

  2. Artalejo JR (1999) Accessible bibliography on retrial queues. Math Comput Model 30:1–6

    Article  Google Scholar 

  3. Artalejo JR (1999) A classified bibliography of research on retrial queues: progress in 1990–1999. TOP 7:187–211

    Article  Google Scholar 

  4. Artalejo JR, Joshua VC, Krishnamoorthy A (2002) An M/G/1 retrial queue with orbital search by the server. In: Artalejo JR, Krishnamoorthy A (eds) Advances in stochastic modelling. Notable Publications, New Jersey, pp 41–54

  5. Artalejo JR, Gomez-Corral A (2008) Retrial queueing systems—a computational approach. Springer, Berlin

    Book  Google Scholar 

  6. Artalejo JR (2010) Accessible bibliography on retrial queues: progress in 2000–2009. Math Comput Model 51:1071–1081

    Article  Google Scholar 

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

    Article  Google Scholar 

  8. Artalejo JR, Phung-Duc T (2013) Sigle server retrial queues with two way communication. Appl Math Model 37(4):1811–1822

    Article  Google Scholar 

  9. Deepak TG, Dudin AN, Joshua VC, Krishnamoorthy A (2013) On an \(M^{(X)}/G/1\) retrial system with two types of search of customers from the orbit. Stoch Anal Appl 31(1):92–107

    Article  Google Scholar 

  10. Dudin AN, Krishnamoorthy A, Joshua VC, Tsarenkov GV (2004) Analysis of the \(BMAP/G/1\) retrial system with search of customers from the orbit. Eur J Oper Res 157:169–179

    Article  Google Scholar 

  11. Falin GI (1990) A survey of retrial queues. Queueing Syst 7:127–167

    Article  Google Scholar 

  12. Falin GI, Templeton JGC (1997) Retrial queues. Chapman and Hall, London

    Book  Google Scholar 

  13. Fayolle G (1986) A simple telephone exchange with delayed feedbacks. In: Boxma OJ, Cochen JW, Tijms HC (eds) Teletraffic analysis and computer performance evaluation. Elsevier, Amsterdam, pp 245–253

  14. Kulkarni VG, Liang HM (1997) Retrial queues revisited. In: Dshalalow JH (ed) Frontiers in queueing: models and applications in science and engineering. CRC Press, Boca Raton, pp 19–34

  15. Neuts MF, Ramalhoto MF (1984) A service model in which the server is required to search for customers. J Appl Probab 21:157–166

    Article  Google Scholar 

  16. Pakes AG (1969) Some conditions for ergodicity and recurrence of Markov chains. Oper Res 17:1058–1061

    Article  Google Scholar 

  17. Phung-Duc T, Rogiest W, Takahashi Y, Bruneel H (2014) Retrial queues with balanced call blending: analysis of single-server and multiserver model. Published online first in Annals of Operations Research

  18. Sennott LI, Humblet PA, Tweedie RL (1983) Mean drift and the non-ergodicity of Markov chains. Oper Res 31(4):783–788

    Article  Google Scholar 

  19. Takagi H (1991) Queueing analysis-vacation and priority systems- part1. Elsevier, Amsterdam

  20. Yang T, Templeton JGC (1987) A survey on retrial queues. Queueing Syst 2:201–233

    Article  Google Scholar 

Download references


The author thanks the anonymous referees for their constructive comments and suggestions that assured significant improvement in the content and presentation of this paper.

Author information



Corresponding author

Correspondence to T. G. Deepak.

Rights and permissions

Reprints and Permissions

About this article

Verify currency and authenticity via CrossMark

Cite this article

Deepak, T.G. On a retrial queueing model with single/batch service and search of customers from the orbit. TOP 23, 493–520 (2015).

Download citation


  • Retrial queue
  • Orbital customers
  • Search on the orbit
  • Batch service

Mathematics Subject Classification

  • 60K25
  • 90B22