Utility maximizing load balancing policies

12/16/2021
by   Diego Goldsztajn, et al.
0

Consider a service system where incoming tasks are instantaneously dispatched to one out of many heterogeneous server pools. Associated with each server pool is a concave utility function which depends on the class of the server pool and its current occupancy. We derive an upper bound for the mean normalized aggregate utility in stationarity and introduce two load balancing policies that achieve this upper bound in a large-scale regime. Furthermore, the transient and stationary behavior of these asymptotically optimal load balancing policies is characterized on the scale of the number of server pools, in the same large-scale regime.

READ FULL TEXT
research
09/06/2018

Scalable Load Balancing Algorithms in Networked Systems

A fundamental challenge in large-scale networked systems viz., data cent...
research
06/01/2023

Optimal Rate-Matrix Pruning For Large-Scale Heterogeneous Systems

We present an analysis of large-scale load balancing systems, where the ...
research
10/29/2020

Self-Learning Threshold-Based Load Balancing

We consider a large-scale service system where incoming tasks have to be...
research
07/06/2018

Faster Data-access in Large-scale Systems: Network-scale Latency Analysis under General Service-time Distributions

In cloud storage systems with a large number of servers, files are typic...
research
12/18/2020

Learning and balancing time-varying loads in large-scale systems

Consider a system of n parallel server pools where tasks arrive as a tim...
research
03/04/2020

LSQ: Load Balancing in Large-Scale Heterogeneous Systems with Multiple Dispatchers

Nowadays, the efficiency and even the feasibility of traditional load-ba...
research
06/04/2017

Load Balancing in Large-Scale Systems with Multiple Dispatchers

Load balancing algorithms play a crucial role in delivering robust appli...

Please sign up or login with your details

Forgot password? Click here to reset