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

被引:0
作者
V. Jailaxmi
R. Arumuganathan
M. Senthil Kumar
机构
[1] PSG Institute of Technology and Applied Research,Department of Mathematics
[2] PSG College of Technology,Department of Mathematics
[3] PSG College of Technology,Department of Applied Mathematics and Computational Sciences
来源
Operational Research | 2017年 / 17卷
关键词
General retrial time; Collision; Modified M-vacations; Retrial queue; Supplementary variable method;
D O I
暂无
中图分类号
学科分类号
摘要
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.
引用
收藏
页码:649 / 667
页数:18
相关论文
共 42 条
  • [1] Artalejo JR(1997)Analysis an M/G/1 queue with constant repeated attempts and server vacations Comput Oper Res 24 493-504
  • [2] Artalejo JR(1999)Accessible bibliography on retrial queues Math Comput Model 30 1-6
  • [3] Artalejo JR(1999)A classified bibliography of research on retrial queues: progress in 1990–1999 TOP 7 187-211
  • [4] Arumuganathan R(2008)Study sate analysis of non-Markovian bulk queuing system with N-policy and different types of vacations Int J Mod Math 3 47-66
  • [5] Judeth Malliga T(1999)Single server retrial queues with priority calls Math Comput Model 30 7-32
  • [6] Rathinasamy A(1990)The M/G/1 retrial queue with Bernoulli schedule Queueing Syst 7 219-227
  • [7] Choi BD(1992)Retrial queues with collision arising from unslotted CSMA/DA protocol Queueing Syst 11 335-356
  • [8] Chang Y(1995)M/G/1 retrial queueing system with two types of calls and finite capacity Queueing Syst 19 215-229
  • [9] Choi BD(1965)The analyses of non-Markovian stochastic processes by the inclusion of supplementary variables Math Proc Camb Philos Soc 51 433-441
  • [10] Park KK(1986)Queueing systems with vacations—a survey Queueing Syst 1 29-66