Analysis of the Symmetric Join the Shortest Orbit Queue

05/06/2020
by   Ioannis Dimitriou, et al.
0

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.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
04/16/2021

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

We introduce the generalized join the shortest queue model with retrials...
research
10/17/2018

Load balancing with heterogeneous schedulers

Load balancing is a common approach in web server farms or inventory rou...
research
03/05/2022

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

We introduce a novel single-server queue with general retrial times and ...
research
03/01/2019

Stabilizing a Queue Subject to Action-Dependent Server Performance

We consider a discrete-time system comprising an unbounded queue that lo...
research
05/10/2023

Fast Distributed Inference Serving for Large Language Models

Large language models (LLMs) power a new generation of interactive AI ap...
research
09/17/2021

Scheduling in Parallel Finite Buffer Systems: Optimal Decisions under Delayed Feedback

Scheduling decisions in parallel queuing systems arise as a fundamental ...
research
12/07/2016

An Infinite Dimensional Model for a Many Server Priority Queue

We consider a Markovian many server queueing system in which customers a...

Please sign up or login with your details

Forgot password? Click here to reset