Analysis of repairable M[X]/(G1,G2)/1 - feedback retrial G-queue with balking and starting failures under at most J vacations
In this paper, we discuss the steady state analysis of a batch arrival feedback retrial queue with two types of service and negative customers. Any arriving batch of positive customers finds the server is free, one of the customers from the batch enters into the service area and the rest of them join into the orbit. The negative customer, arriving during the service time of a positive customer, will remove the positive customer in-service and the interrupted positive customer either enters into the orbit or leaves the system. If the orbit is empty at the service completion of each type of service, the server takes at most J vacations until at least one customer is received in the orbit when the server returns from a vacation. The busy server may breakdown at any instant and the service channel will fail for a short interval of time. The steady state probability generating function for the system size is obtained by using the supplementary variable method. Numerical illustrations are discussed to see the effect of system parameters.
Rajadurai, P.; Saravanarajan, M. C.; and Chandrasekaran, V. M.
Analysis of repairable M[X]/(G1,G2)/1 - feedback retrial G-queue with balking and starting failures under at most J vacations,
Applications and Applied Mathematics: An International Journal (AAM), Vol. 10,
2, Article 4.
Available at: https://digitalcommons.pvamu.edu/aam/vol10/iss2/4
Computer Sciences Commons, Numerical Analysis and Computation Commons, Statistics and Probability Commons