Load Balancing Under Strict Compatibility Constraints

by   Daan Rutten, et al.

We study large-scale systems operating under the JSQ(d) policy in the presence of stringent task-server compatibility constraints. Consider a system with N identical single-server queues and M(N) task types, where each server is able to process only a small subset of possible task types. Each arriving task selects d≥ 2 random servers compatible to its type, and joins the shortest queue among them. The compatibility constraint is naturally captured by a fixed bipartite graph G_N between the servers and the task types. When G_N is complete bipartite, the meanfield approximation is proven to be accurate. However, such dense compatibility graphs are infeasible due to their overwhelming implementation cost and prohibitive storage capacity requirement at the servers. Our goal in this paper is to characterize the class of sparse compatibility graphs for which the meanfield approximation remains valid. To achieve this, first, we introduce a novel graph expansion-based notion, called proportional sparsity, and establish that systems with proportionally sparse compatibility graphs match the performance of a fully flexible system, asymptotically in the large-system limit. Furthermore, for any c(N) satisfying Nc(N)/M(N)ln(N)→∞ and c(N)→∞, as N→∞, we show that proportionally sparse random compatibility graphs can be designed, so that the degree of each server is at most c(N). This reduces the server-degree almost by a factor N/ln(N), compared to the complete bipartite compatibility graph, while maintaining the same asymptotic performance. Extensive simulation experiments are conducted to corroborate the theoretical results.



There are no comments yet.


page 1

page 2

page 3

page 4


Optimal Load Balancing in Bipartite Graphs

Applications in cloud platforms motivate the study of efficient load bal...

Performance Evaluation of Stochastic Bipartite Matching Models

We consider a stochastic bipartite matching model consisting of multi-cl...

Parallel Load Balancing on Constrained Client-Server Topologies

We study parallel Load Balancing protocols for a client-server distribut...

Optimal Hyper-Scalable Load Balancing with a Strict Queue Limit

Load balancing plays a critical role in efficiently dispatching jobs in ...

Asymptotically Optimal Load Balancing Topologies

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

Asymptotic enumeration of digraphs and bipartite graphs by degree sequence

We provide asymptotic formulae for the numbers of bipartite graphs with ...

Load Balancing in Large-Scale Systems with Multiple Dispatchers

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

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