An M/M/C retrial queueing system with Bernoulli vacations
An M/M/C retrial queueing system with Bernoulli vacations
复制标题
DOI：
10.1007/s11518-009-5106-1
复制
发表时间：
2009-05
影响因子：
1.2
通讯作者：
B. Kumar;R. Rukmani;V. Thangaraj
中科院分区：
文献类型：
--
作者：
B. Kumar;R. Rukmani;V. Thangaraj
本文研究了一种具有伯努利休假调度服务的稳态马尔可夫多服务器重审排队系统。使用矩阵几何方法，可以获得各种有趣且重要的系统性能度量。此外，还提供了理想重审和无效重审等概率描述符。最后，提供了大量的数值说明，以表明获得该排队系统解决方案的方法的量化性质。
In this paper, a steady-state Markovian multi-server retrial queueing system with Bernoulli vacation scheduling service is studied. Using matrix-geometric approach, various interesting and important system performance measures are obtained. Further, the probability descriptors like ideal retrial and vain retrial are provided. Finally, extensive numerical illustrations are presented to indicate the quantifying nature of the approach to obtain solutions to this queueing system.