An M/G/1 retrial G-queue with non-exhaustive random vacations and an unreliable server

  • Authors:
  • Jinbiao Wu;Xiaoling Yin

  • Affiliations:
  • Department of Mathematics, Central South University, Changsha 410075, Hunan, PR China and Department of Information Science, Central South University, Changsha 410083, Hunan, PR China;Department of Statistics, Sun Yat-sen University, Guangzhou 510275, Guangdong, PR China

  • Venue:
  • Computers & Mathematics with Applications
  • Year:
  • 2011

Quantified Score

Hi-index 0.09

Visualization

Abstract

This paper deals with an M/G/1 retrial queue with negative customers and non-exhaustive random vacations subject to the server breakdowns and repairs. Arrivals of both positive customers and negative customers are two independent Poisson processes. A breakdown at the busy server is represented by the arrival of a negative customer which causes the customer being in service to be lost. The server takes a vacation of random length after an exponential time when the server is up. We develop a new method to discuss the stable condition by finding absorb distribution and using the stable condition of a classical M/G/1 queue. By applying the supplementary variable method, we obtain the steady-state solutions for both queueing measures and reliability quantities. Moreover, we investigate the stochastic decomposition law. We also analyse the busy period of the system. Some special cases of interest are discussed and some known results have been derived. Finally, an application to cellular mobile networks is provided and the effects of various parameters on the system performance are analysed numerically.