Analysis of the symmetric join the shortest orbit queue

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 distribution by using compensation method.