Analysis of a Single Server Retrial Queueing System with Finite Capacity, F-Policy, Balking, Reneging and Server Maintenance

Authors

  • R. Jeyachandhiran Department of Mathematics, School of advanced sciences, Vellore Institute of Technology, Vellore-632014, India
  • P. Rajendran Department of Mathematics, School of advanced sciences, Vellore Institute of Technology, Vellore-632014, India https://orcid.org/0000-0003-3694-2190

DOI:

https://doi.org/10.37256/cm.5120243745

Keywords:

retrial queue, F-policy, vacation, discouragement, recursive technique

Abstract

In this paper, we determine a single server retrial queuing system with finite capacity, F-policy, balking, reneging and server maintenance. The arriving customer when notices the server becomes free, then they get service immediately. In case server becomes busy, the customers are move to either orbit or may balk the system. In the orbit, after some random time the customer repeats their attempts for service. The customers are waiting in the orbit for longer time become impatient and leaves the orbit without getting service. Once the number of customers in the orbit reaches its full capacity then the arrival of customer is not allowed to enter into the orbit. The new customer is allowed into the orbit when the F-policy level is reached. If no more customer in the orbit, server will move to the vacation. By using recursive technique, the steady state distributions are obtained and we have developed various performance measures.

Downloads

Published

2024-01-25

How to Cite

1.
Jeyachandhiran R, Rajendran P. Analysis of a Single Server Retrial Queueing System with Finite Capacity, F-Policy, Balking, Reneging and Server Maintenance. Contemp. Math. [Internet]. 2024 Jan. 25 [cited 2024 Feb. 27];5(1):506-18. Available from: https://ojs.wiserpub.com/index.php/CM/article/view/3745