The generalized join the shortest orbit queue system: Stability, exact tail asymptotics and stationary approximations
Ioannis Dimitriou

TL;DR
This paper analyzes a complex queueing system with multiple job streams, orbit queues, and retrials, providing stability conditions, exact tail asymptotics, and approximate stationary distributions relevant for wireless networks.
Contribution
It introduces a generalized join the shortest orbit queue model with retrials, deriving stability conditions, exact tail asymptotics, and heuristic approximations for the stationary distribution.
Findings
Tail asymptotics are exactly geometric under certain conditions.
Heuristic methods provide accurate approximations of the joint orbit queue distribution.
Numerical examples confirm the consistency of asymptotic and heuristic results.
Abstract
We introduce the \textit{generalized join the shortest queue model with retrials} and two infinite capacity orbit queues. Three independent Poisson streams of jobs, namely a \textit{smart}, and two \textit{dedicated} streams, flow into a single server system, which can hold at most one job. Arriving jobs that find the server occupied are routed to the orbits as follows: Blocked jobs from the \textit{smart} stream are routed to the shortest orbit queue, and in case of a tie, they choose an orbit randomly. Blocked jobs from the \textit{dedicated} streams are routed directly to their orbits. Orbiting jobs retry to connect with the server at different retrial rates, i.e., heterogeneous orbit queues. Applications of such a system are found in the modelling of wireless cooperative networks. We are interested in the asymptotic behaviour of the stationary distribution of this model, provided…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
