Computational Performance of a Single Server State Dependent Queue
R. Sakthi1, V. Vidhya2
1R. Sakthi, Department Humanities and Science, Rajalakshmi Engineering College, Chennai, India.
2V. Vidhya, School of Advanced Sciences, VIT-Chennai, India.
Manuscript received on 05 July 2019 | Revised Manuscript received on 09 July 2019 | Manuscript published on 30 August 2019 | PP: 597-700 | Volume-8 Issue-10, August 2019 | Retrieval Number: J88090881019/2019©BEIESP | DOI: 10.35940/ijitee.J8809.0881019
Open Access | Ethics and Policies | Cite | Mendeley | Indexing and Abstracting
© The Authors. Blue Eyes Intelligence Engineering and Sciences Publication (BEIESP). This is an open access article under the CC-BY-NC-ND license (http://creativecommons.org/licenses/by-nc-nd/4.0/)
Abstract: In this article we consider a single server state dependent queuing system with the service rate varying according to types of customers like normal, tagged and heavy tailed. We develop a state dependent queuing model in which the service rate depends on customer type arrive to the system with quasi-birth-death environment structure and using matrix geometric method we develop the system performance measures. Also, we use these performance measures by utilizing the maximum potential of server and perform sensitivity analysis with numerical illustrations.
Keywords: Quasi-birth-death process, state dependent, stationary probability, tagged customer. AMS Subject Classification: 60K25, 90B22, 68M20.
Scope of the Article: Classification