4.7 Article

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

期刊

COMPUTERS & MATHEMATICS WITH APPLICATIONS
卷 62, 期 5, 页码 2314-2329

出版社

PERGAMON-ELSEVIER SCIENCE LTD
DOI: 10.1016/j.camwa.2011.07.018

关键词

Retrial queues; G-queues; Random vacations; Stability condition; Markov chain; Reliability

资金

  1. Postdoctoral Foundation of Central South University

向作者/读者索取更多资源

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. (C) 2011 Elsevier Ltd. All rights reserved.

作者

我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。

评论

主要评分

4.7
评分不足

次要评分

新颖性
-
重要性
-
科学严谨性
-
评价这篇论文

推荐

暂无数据
暂无数据