|
|||||
|
|
An M/M/C retrial queueing system with Bernoulli vacations |
|
| Authors: | B. Krishna Kumar R. Rukmani V. Thangaraj |
| Affiliation: | 1. Department of Mathematics, College of Engineering, Anna University, Chennai, 600 025, India 2. Department of Mathematics, Pachaiyappa's College, Chennai, 600030, India 3. Ramanujan Institute for Advanced Study in Mathematics, University of Madras, Chennai,600 005, India |
| Abstract: | 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. |
| Keywords: | Retrial queue Bernoulli vacation matrix-geometric methods busy period vain retrial ideal retrial |
| 本文献已被 维普 万方数据 SpringerLink 等数据库收录！ | |