An M/M/C retrial queueing system with Bernoulli vacations
B. Krishna Kumar , R. Rukmani , V. Thangaraj
Journal of Systems Science and Systems Engineering ›› 2009, Vol. 18 ›› Issue (2) : 222 -243.
An M/M/C retrial queueing system with Bernoulli vacations
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.
Retrial queue / Bernoulli vacation / matrix-geometric methods / busy period / vain retrial / ideal retrial
| [1] |
|
| [2] |
|
| [3] |
|
| [4] |
|
| [5] |
|
| [6] |
|
| [7] |
Artajelo, J.R. & Lopez-Herrero, M.J. (2003). On the M/M/m queue with removable servers, In: Srinivasan, S.K., Vijayakumar, A. (eds.), Stochastic Point Processes, pp. 124–144. Narosa Publishing House |
| [8] |
|
| [9] |
|
| [10] |
|
| [11] |
|
| [12] |
|
| [13] |
|
| [14] |
|
| [15] |
|
| [16] |
|
| [17] |
|
| [18] |
|
| [19] |
|
| [20] |
|
| [21] |
|
| [22] |
|
| [23] |
|
| [24] |
|
| [25] |
|
| [26] |
|
| [27] |
|
| [28] |
|
| [29] |
|
| [30] |
|
| [31] |
|
| [32] |
|
| [33] |
|
| [34] |
|
| [35] |
|
| [36] |
|
/
| 〈 |
|
〉 |