KnapsackLB: Enabling Performance-Aware Layer-4 Load Balancing

The layer-4 load balancer (LB) is one of the key building blocks of online services. In this paper, we empower such LBs to adapt to different and dynamic performance of backend instances (DIPs). Our system, KnapsackLB, is generic (can work with variety of LBs), does not require agents on DIPs, LBs or clients, and scales to large numbers of DIPs. KnapsackLB uses judicious active probes to learn a mapping from LB weights to the response latency of each DIP, and then applies Integer Linear Programming (ILP) to calculate LB weights that optimize latency, using an iterative method to scale the computation to large numbers of DIPs. Using testbed experiments and simulations, we show that KnapsackLB load balances traffic according to DIP performance and cuts average latency by up to 45% compared to existing designs.

Authors

Institutions

Publication Details

Journal
Proceedings of the ACM on Networking
Published
2025-03-05
DOI
https://doi.org/10.1145/3709377
Citations
1
Primary Topic
Interconnection Networks and Systems
Type
article
Field-Weighted Citation Impact
1.49
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

KnapsackLB: Enabling Performance-Aware Layer-4 Load Balancing

Srinivas Narayana, Rohan Gandhi
1 citations
Proceedings of the ACM on Networking
Interconnection Networks and Systems
1.49
article

KnapsackLB: Enabling Performance-Aware Layer-4 Load Balancing

Srinivas Narayana, Rohan Gandhi
article en
1 citations

Abstract

The layer-4 load balancer (LB) is one of the key building blocks of online services. In this paper, we empower such LBs to adapt to different and dynamic performance of backend instances (DIPs). Our system, KnapsackLB, is generic (can work with variety of LBs), does not require agents on DIPs, LBs or clients, and scales to large numbers of DIPs. KnapsackLB uses judicious active probes to learn a mapping from LB weights to the response latency of each DIP, and then applies Integer Linear Programming (ILP) to calculate LB weights that optimize latency, using an iterative method to scale the computation to large numbers of DIPs. Using testbed experiments and simulations, we show that KnapsackLB load balances traffic according to DIP performance and cuts average latency by up to 45% compared to existing designs.

Proceedings of the ACM on NetworkingVol. 3(CoNEXT1)
Rutgers, The State University of New Jersey (US), Microsoft Research (India) (IN)
Openalex Percentile: Top 20%
Interconnection Networks and Systems
1.49
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.