Doubly Exponential Solution for Randomized Load Balancing Models with General Service Times

08/23/2010
by   Quan-Lin Li, et al.
0

In this paper, we provide a novel and simple approach to study the supermarket model with general service times. This approach is based on the supplementary variable method used in analyzing stochastic models extensively. We organize an infinite-size system of integral-differential equations by means of the density dependent jump Markov process, and obtain a close-form solution: doubly exponential structure, for the fixed point satisfying the system of nonlinear equations, which is always a key in the study of supermarket models. The fixed point is decomposited into two groups of information under a product form: the arrival information and the service information. based on this, we indicate two important observations: the fixed point for the supermarket model is different from the tail of stationary queue length distribution for the ordinary M/G/1 queue, and the doubly exponential solution to the fixed point can extensively exist even if the service time distribution is heavy-tailed. Furthermore, we analyze the exponential convergence of the current location of the supermarket model to its fixed point, and study the Lipschitz condition in the Kurtz Theorem under general service times. Based on these analysis, one can gain a new understanding how workload probing can help in load balancing jobs with general service times such as heavy-tailed service.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
02/16/2022

Large-System Insensitivity of Zero-Waiting Load Balancing Algorithms

This paper studies the sensitivity (or insensitivity) of a class of load...
research
08/30/2017

Insensitivity of the mean-field Limit of Loss Systems Under Power-of-d Routing

In this paper, we study large multi-server loss models under power-of-d ...
research
09/10/2019

Mobility can drastically improve the heavy traffic performance from 1/(1-rho) to -log(1-rho)

We study a model of wireless networks where users move at speed s, which...
research
04/20/2023

Poly-Exp Bounds in Tandem Queues

When the arrival processes are Poisson, queueing networks are well-under...
research
06/21/2022

M/G/1-FIFO Queue with Uniform Service Times

An exact formula for the equilibrium M/U/1 waiting time density is now e...
research
02/03/2022

Can machines solve general queueing systems?

In this paper, we analyze how well a machine can solve a general problem...
research
04/27/2021

Queues with Updating Information: Finding the Amplitude of Oscillations

Many service systems provide customers with information about the system...

Please sign up or login with your details

Forgot password? Click here to reset