Skip to main content
Log in

M/M/c Retrial Queue with Multiclass of Customers

  • Published:
Methodology and Computing in Applied Probability Aims and scope Submit manuscript

Abstract

We consider the M/M/c retrial queues with multiclass of customers. We show that the stationary joint distribution for the number of customers in service facility and orbit converges to those of the ordinary M/M/c with discriminatory random order service (DROS) policy as retrial rate tends to infinity. Approximation formulae for the distributions of the number of customers in service facility, the mean number of customers in orbit and the sojourn time distribution of a customer are presented. The approximations are compared with exact and simulation results.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

References

  • Artalejo JR, Gómez-Corral A (2008) Retrial queueing systems, a computational approach. Springer, Hidelberg.

    Book  MATH  Google Scholar 

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

    Article  MathSciNet  Google Scholar 

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

    Article  MathSciNet  Google Scholar 

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

    Article  MathSciNet  MATH  Google Scholar 

  • Bright L, Taylor PG (1995) Calculating the equilibrium distribution in level dependent quasi-birth-and-death processes. Stoch Model 11: 497–525

    Article  MathSciNet  MATH  Google Scholar 

  • Choi BD, Chang Y (1999) MAP 1,MAP 2/M/c retrial queue with the retrial group of finite capacity and geometric loss. Math Comput Model 30:99–113

    Article  MathSciNet  MATH  Google Scholar 

  • Choi BD, Kim B (2004) Non-ergodicity criteria for denumerable continuous time Markov processes. Oper Res Lett 32:574–580

    Article  MathSciNet  MATH  Google Scholar 

  • Choi BD, Choi, KB, Lee YW (1995) M/G/1 retrial queueing systems with two types of calls and finite capacity. Queueing Syst 19:215–229.

    Article  MathSciNet  MATH  Google Scholar 

  • Cohen JW (1957) Basic problems of telephone traffic theory and the influence of repeated calls. Philips Telecomm Rev 18(2):49–100

    Google Scholar 

  • Falin GI (1988) On a multiclass batch arrival retrial queue. Adv Appl Probab 20:483–487

    Article  MathSciNet  MATH  Google Scholar 

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

    Book  MATH  Google Scholar 

  • Falin GI, Artalejo JR, Martin M (1993) On the single server retrial queue with priority customers. Queueing Syst 14:439–455

    Article  MathSciNet  MATH  Google Scholar 

  • Gharbi N, Dutheillet C, Ioualalen M (2009) Colored stochastic Petri nets for modelling and analysis of multiclass retrial systems. Math Comput Model 49:1436–1448

    Article  MATH  Google Scholar 

  • Grishechkin SA (1992) Multiclass batch arrival retrial queues analyzed as branching process with immigration. Queueing Syst 11:395–418

    Article  MathSciNet  MATH  Google Scholar 

  • Khalil Z, Falin G, Yang T (1992) Some analytical results for congestion in subscriber line modules. Queueing Syst 10:381–402

    Article  MathSciNet  MATH  Google Scholar 

  • Kim B (2011) Stability of a retrial queueing network with different classes of customers and restricted resource pooling. J Ind Manag Optim 7(3):753–765

    Article  MathSciNet  MATH  Google Scholar 

  • Kim J (2009) Queue length distribution in a queue with relative priorities. Bull Kor Math Soc 46:107–116

    Article  MATH  Google Scholar 

  • Kim J, Kim J, Kim B (2011) Analysis of the M/G/1 queue with discriminatory random order service policy. Perform Eval 68:256–270

    Article  Google Scholar 

  • Kulkarni VG (1983) On queueing systems with retrials. J Appl Probab 20:380–389

    Article  MathSciNet  MATH  Google Scholar 

  • Kulkarni VG (1986) Expected waiting times in a multiclass batch arrival retrial queue. J Appl Probab 23:144–154

    Article  MathSciNet  MATH  Google Scholar 

  • Martin M, Artalejo JR (1995) Analysis of an M/G/1 queue with two types of impatient units. Adv Appl Probab 27:840–861.

    Article  MathSciNet  MATH  Google Scholar 

  • Shin YW (2009) Fundamental matrix of transient QBD generator with finite states and level dependent transitions. Asia Pac J Oper Res 26:697–714

    Article  MathSciNet  MATH  Google Scholar 

  • Tweedie RL (1975) Sufficient condition for regularity, recurrence and ergodicity of Markov processes. Math Proc Cambridge Philos Soc 78:125–136

    Article  MathSciNet  MATH  Google Scholar 

  • Wolff RW (1989) Stochastic modeling and the theory of queues. Prentice Hall, New Jersey

    MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Yang Woo Shin.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Shin, Y.W., Moon, D.H. M/M/c Retrial Queue with Multiclass of Customers. Methodol Comput Appl Probab 16, 931–949 (2014). https://doi.org/10.1007/s11009-013-9340-0

Download citation

  • Received:

  • Revised:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11009-013-9340-0

Keywords

AMS 2000 Subject Classifications

Navigation