Analysis of M [X] /G k /1 retrial queueing model and standby

0Citations
Citations of this article
1Readers
Mendeley users who have this article in their library.
Get full text

Abstract

A batch arrival retrial queueing model with k optional stages of service is studied. Any arriving batch of customer finds the server free, one of the customers from the batch enters into the first stage of service, and the rest of them join into the orbit. After completion of the ith stage of service, the customer may have the option to choose (i+1)th stage of service with probability θ i or may leave the system with probability qi={1−θi,i=1,2,…k−11,i=k}. Busy server may get to breakdown, and the standby server provides service only during the repair times. At the completion of service, the server remains idle to provide the service. By using the supplementary variable method, steady-state probability generating function for system size, some system performance measures are discussed. Simulation results are given using MATLAB.

Cite

CITATION STYLE

APA

Radha, J., Indhira, K., & Chandrasekaran, V. M. (2019). Analysis of M [X] /G k /1 retrial queueing model and standby. In Trends in Mathematics (pp. 343–352). Springer International Publishing. https://doi.org/10.1007/978-3-030-01120-8_39

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free