2000 character limit reached
Analysis of the Symmetric Join the Shortest Orbit Queue (2005.02683v2)
Published 6 May 2020 in math.PR and cs.PF
Abstract: This work introduces the join the shortest queue policy in the retrial setting. We consider a Markovian single server retrial system with two infinite capacity orbits. An arriving job finding the server busy, it is forwarded to the least loaded orbit. Otherwise, it is forwarded to an orbit randomly. Orbiting jobs of either type retry to access the server independently. We investigate the stability condition, the stationary tail decay rate, and obtain the equilibrium distribution by using the compensation method.