Abstract
In this paper, a single server retrial queue with general retrial time and collisions of customers with modified M-vacations is studied. The primary calls arrive according to Poisson process with rate λ. If the server is free, the arriving customer/the customer from orbit gets served completely and leaves the system. If the server is busy, arriving customer collides with the customer in service resulting in both being shifted to the orbit. After the collision the server becomes idle. If the orbit is empty the server takes at most M vacations until at least one customer is recorded in the orbit when the server returns from a vacation. Whenever the orbit is empty the server leaves for a vacation of random length V. If no customers appear in the orbit when the server returns from vacation he again leaves for another vacation with the same length. This pattern continues until he returns from a vacation to find at least one customer recorded in the orbit or he has already taken M vacations. If the orbit is empty by the end of the Mth vacation, the server remains idle for customers in the system. The time between two successive retrials from the orbit is assumed to be general with arbitrary distribution R(t). By applying the supplementary variables method, the probability generating function of number of customers in the orbit is derived. Some special cases are also discussed. A numerical illustration is also presented.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Artalejo JR (1997) Analysis an M/G/1 queue with constant repeated attempts and server vacations. Comput Oper Res 24:493–504
Artalejo JR (1999a) Accessible bibliography on retrial queues. Math Comput Model 30:1–6
Artalejo JR (1999b) A classified bibliography of research on retrial queues: progress in 1990–1999. TOP 7:187–211
Artalejo JR, Gomez-coral A (2008) Retrial queueing systems: a computational approach. Springer, Heidelberg
Arumuganathan R, Judeth Malliga T, Rathinasamy A (2008) Study sate analysis of non-Markovian bulk queuing system with N-policy and different types of vacations. Int J Mod Math 3(1):47–66
Choi BD, Chang Y (1999) Single server retrial queues with priority calls. Math Comput Model 30:7–32
Choi BD, Park KK (1990) The M/G/1 retrial queue with Bernoulli schedule. Queueing Syst 7:219–227
Choi BD, Shin YW, Ahn WC (1992) Retrial queues with collision arising from unslotted CSMA/DA protocol. Queueing Syst 11:335–356
Choi BD, Choi KB, Lee YW (1995) M/G/1 retrial queueing system with two types of calls and finite capacity. Queueing Syst 19:215–229
Cox DR (1965) The analyses of non-Markovian stochastic processes by the inclusion of supplementary variables. Math Proc Camb Philos Soc 51:433–441
Doshi BT (1985) An M/G/1 queue with variable vacation. In: Proceedings: international conference on performance modeling, Sophia Antipolis, France
Doshi BT (1986) Queueing systems with vacations—a survey. Queueing Syst 1:29–66
Falin GI, Sukharev Y (1985) On single-line queues with double connections. All-Union Institute for Scientific and Technical Information, Moscow (in Russian)
Falin GI, Templetion JGC (1997) Retrial queues. Chopman and Hall, London
Gao S, Yao Y (2013) An Mx/G/1 queue with randomized working vacations and at most J vacations. Int J Comput Math. doi:10.1080/00207160.2013.790964
Jonin GL (1982) Determination of probabilistic characteristic of single-line queues with double connections and repeated calls. In: Models of systems of distribution of information and its analysis, Mascow
Keilson J, Servi LD (1986) Oscillating random walk models for G1/G/1 vacation systems with Bernoulli schedules. J Appl Probab 23:709–802
Krishna kumar B, Vijayakumar A, Arivudainambi D (2002) An M/G/1 retrial queueing system with truss-phase service and pre-emptive resume. Anal Oper Res 113:61–79
Krishna kumar B, Vijayalakshmi G, Krishnamoorthy A, Sadia Basha S (2010) A single server feedback retrial queue with collisions. Comput Oper Res 37(7):1247–1255
Krishna Reddy GV, Anitha R (1999) Non-Morkovian bulk service queue with different vacation policies. Inf Manag Sci 10(14):1–17
Krishnakumar B, Vijayakumar A, Arivudainambi D (2002) The M/G/1 retrial queueing with feedback and starting failures. Appl Math Model 26:1057–1076
Kulkarni VG, Liang HM (1997) Retrial queues revisited. In: Dshalow J-H (ed) Frontiers in queueing: models and applications in science and engineering. CRC Press Inc, Boca Raton, FL pp 19–34
Li H, Yang T (1995) A single server retrial queue with server vacations and a finite number of input sources. Eur J Oper Res 85:149–160
Pakes AG (1969) Some conditions for ergodicity and recurrence of Markov chains. Operations Research 17(6):1058–1061
Takagi H (1991) Vacation and priority systems, part I, queueing analysis: a foundation of performance evaluation, vol 1. North-Holland, Amsterdam
Wu J, Liu Z, Peng Y (2011) A discrete-time Geo/G/1 retrial queue with pre emptive resume and collisions. Appl Math Model 35:837–847
Yang T, Templeton JGC (1987) A survey on retrial queues. Queueing Syst 2:201–233
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Jailaxmi, V., Arumuganathan, R. & Senthil Kumar, M. Performance analysis of an M/G/1 retrial queue with general retrial time, modified M-vacations and collision. Oper Res Int J 17, 649–667 (2017). https://doi.org/10.1007/s12351-016-0248-7
Received:
Revised:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s12351-016-0248-7