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

by   Ioannis Dimitriou, et al.

We introduce the generalized join the shortest queue model with retrials and two infinite capacity orbit queues. Three independent Poisson streams of jobs, namely a smart, and two 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 smart stream are routed to the shortest orbit queue, and in case of a tie, they choose an orbit randomly. Blocked jobs from the 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 that the system is stable. More precisely, we investigate the conditions under which the tail asymptotic of the minimum orbit queue length is exactly geometric. Moreover, we apply a heuristic asymptotic approach to obtain approximations of the steady-state joint orbit queue-length distribution. Useful numerical examples are presented, and shown that the results obtained through the asymptotic analysis and the heuristic approach agreed.



There are no comments yet.


page 1

page 2

page 3

page 4


Analysis of the Symmetric Join the Shortest Orbit Queue

This work introduces the join the shortest queue policy in the retrial s...

Sensitivity of Mean-Field Fluctuations in Erlang loss models with randomized routing

In this paper, we study a large system of N servers each with capacity t...

Job Dispatching Policies for Queueing Systems with Unknown Service Rates

In multi-server queueing systems where there is no central queue holding...

The M/G/1 retrial queue with event-dependent arrivals

We introduce a novel single-server queue with general retrial times and ...

Product Forms for FCFS Queueing Models with Arbitrary Server-Job Compatibilities: An Overview

In recent years a number of models involving different compatibilities b...

Asymptotic analysis of the sojourn time of a batch in an M^[X]/M/1 Processor Sharing Queue

In this paper, we exploit results obtained in an earlier study for the L...
This week in AI

Get the week's most popular data science and artificial intelligence research sent straight to your inbox every Saturday.