least connections
A load-balancing algorithm that sends each new request to the backend currently handling the fewest active connections.
In more detail
It adapts to slow requests and long-lived connections better than round robin. It still only counts connections, not how expensive each one is.
Related terms
- load balancing — Spreading requests or connections across several backend servers so no single one is overloaded and failed ones can be avoided.
- round robin — A way of spreading work by taking turns in a fixed order, giving the next item to the next recipient in the list.
- backend pool — The set of servers a load balancer can send traffic to, each marked eligible or not by health checks.
- power of two random choices — A load balancing method that picks two backends at random and sends the request to the less busy one.
Taught in
- Load Balancing: Algorithms, Health Checks And Layers — Linux Fundamentals & Systems Administration
- Load Balancing And The Failure Modes It Introduces — Scalable System Design & Distributed Architecture