Performance analysis of an M/G/1 retrial queue with general retrial time, modified M-vacations and collision

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.

[1]  Yutaka Takahashi,et al.  Queueing analysis: A foundation of performance evaluation, volume 1: Vacation and priority systems, Part 1: by H. Takagi. Elsevier Science Publishers, Amsterdam, The Netherlands, April 1991. ISBN: 0-444-88910-8 , 1993 .

[2]  Jesús R. Artalejo,et al.  Retrial Queueing Systems: A Computational Approach , 2008 .

[3]  Julian Keilson,et al.  Oscillating random walk models for GI/G/1 vacation systems with Bernoulli schedules , 1986, Journal of Applied Probability.

[4]  Shan Gao,et al.  An MX/G/1 queue with randomized working vacations and at most J vacations , 2014, Int. J. Comput. Math..

[5]  Tao Yang,et al.  A single-server retrial queue with server vacations and a finite number of input sources , 1995 .

[6]  R. Anitha,et al.  Non-markovian bulk service queue with different vacation policies , 1999 .

[7]  James G. C. Templeton,et al.  A survey on retrial queues , 1989 .

[8]  Vidyadhar G. Kulkarni,et al.  Retrial queues revisited , 1998 .

[9]  Zaiming Liu,et al.  A discrete-time Geo/G/1 retrial queue with preemptive resume and collisions , 2011 .

[10]  D. Cox The analysis of non-Markovian stochastic processes by the inclusion of supplementary variables , 1955, Mathematical Proceedings of the Cambridge Philosophical Society.

[11]  Jesus R. Artalejo,et al.  Analysis of an M/G/1 queue with constant repeated attempts and server vacations , 1997, Comput. Oper. Res..

[12]  B. Krishna Kumar,et al.  An M/G/1 Retrial Queueing System with Two-Phase Service and Preemptive Resume , 2002, Ann. Oper. Res..

[13]  Bong Dae Choi,et al.  Single server retrial queues with priority calls , 1999 .

[14]  Jesús R. Artalejo,et al.  A classified bibliography of research on retrial queues: Progress in 1990–1999 , 1999 .

[15]  A. Krishnamoorthy,et al.  A single server feedback retrial queue with collisions , 2010, Comput. Oper. Res..

[16]  Jesús R. Artalejo,et al.  Accessible bibliography on retrial queues , 1999 .

[17]  Yang Woo Shin,et al.  Retrial queues with collision arising from unslottedCSMA/CD protocol , 1992, Queueing Syst. Theory Appl..

[18]  B. Krishna Kumar,et al.  The M/G/1 retrial queue with feedback and starting failures , 2002 .

[19]  Bong D. Choi,et al.  The M/G/1 retrial queue with bernoulli schedule , 1990, Queueing Syst. Theory Appl..

[20]  B. T. Doshi,et al.  Queueing systems with vacations — A survey , 1986, Queueing Syst. Theory Appl..

[21]  T. DoshiB. Queueing systems with vacationsa survey , 1986 .

[22]  Bong Dae Choi,et al.  M/G/1 retrial queueing systems with two types of calls and finite capacity , 1995, Queueing Syst. Theory Appl..

[23]  A. G. Pakes,et al.  Some Conditions for Ergodicity and Recurrence of Markov Chains , 1969, Oper. Res..