Performance Analysis of Load Balancing Policies with Memory

by   Tim Hellemans, et al.

Joining the shortest or least loaded queue among d randomly selected queues are two fundamental load balancing policies. Under both policies the dispatcher does not maintain any information on the queue length or load of the servers. In this paper we analyze the performance of these policies when the dispatcher has some memory available to store the ids of some of the idle servers. We consider methods where the dispatcher discovers idle servers as well as methods where idle servers inform the dispatcher about their state. We focus on large-scale systems and our analysis uses the cavity method. The main insight provided is that the performance measures obtained via the cavity method for a load balancing policy with memory reduce to the performance measures for the same policy without memory provided that the arrival rate is properly scaled. Thus, we can study the performance of load balancers with memory in the same manner as load balancers without memory. In particular this entails closed form solutions for joining the shortest or least loaded queue among d randomly selected queues with memory in case of exponential job sizes. We present simulation results that support our belief that the approximation obtained by the cavity method becomes exact as the number of servers tends to infinity.


page 1

page 2

page 3

page 4


Performance of Load Balancers with Bounded Maximum Queue Length in case of Non-Exponential Job Sizes

In large-scale distributed systems, balancing the load in an efficient w...

Network Load Balancing Methods: Experimental Comparisons and Improvement

Load balancing algorithms play critical roles in systems where the workl...

A Note on Load Balancing in Many-Server Heavy-Traffic Regime

In this note, we apply Stein's method to analyze the performance of gene...

Infinite Servers Queue Systems Busy Period Time Length Distribution and Parameters Study through Computational Simulation

A FORTRAN program to simulate the operation of infinite servers queues i...

Load balancing policies with server-side cancellation of replicas

Popular dispatching policies such as the join shortest queue (JSQ), join...

Asymptotically Optimal Load Balancing Topologies

We consider a system of N servers inter-connected by some underlying gra...

Optimal Weighted Load Balancing in TCAMs

Traffic splitting is a required functionality in networks, for example f...

Please sign up or login with your details

Forgot password? Click here to reset