The present investigation deals with the performance prediction of finite Markovian retrial queues with unreliable server. The arrivals of the customers follow geometric distribution while the service pattern follows exponential distribution. The customers are served in two stages i.e. first essential service (FES) which is compulsory for all the arriving customers and second optional service (...

This work introduces the join shortest queue policy in retrial setting. We consider a Markovian single server system with two infinite capacity orbits. An arriving job finding busy, it is forwarded to least loaded orbit. Otherwise, an orbit randomly. Orbiting jobs of either type retry access independently. investigate stability condition, stationary tail decay rate, and obtain equilibrium distr...