101 · Question #705
An application has a mix of both and short and long lived connections. Which algorithm would provide and event distribution of all connections across the pool?
The correct answer is B. Least connections. Least connections dynamically routes new connections to the pool member with the fewest active connections, making it ideal for workloads that mix short and long-lived connections.
Question
An application has a mix of both and short and long lived connections. Which algorithm would provide and event distribution of all connections across the pool?
Options
- APriority group activate
- BLeast connections
- CStatic ration
- DRound robin
How the community answered
(29 responses)- A7% (2)
- B86% (25)
- C3% (1)
- D3% (1)
Why each option
Least connections dynamically routes new connections to the pool member with the fewest active connections, making it ideal for workloads that mix short and long-lived connections.
Priority group activate is a failover mechanism that routes traffic to lower-priority groups only when higher-priority members fail, not a distribution algorithm for even load spreading.
The least connections algorithm tracks real-time active connection counts per pool member and sends each new connection to the member with the lowest count. This prevents long-lived connections from accumulating on a single server, achieving even distribution regardless of connection duration.
Static ratio assigns fixed weight ratios to pool members and does not adapt to actual connection counts or duration, so it cannot compensate for long-lived connection imbalances.
Round robin distributes requests sequentially without regard to active connection state, causing servers handling long-lived connections to become overloaded compared to others.
Concept tested: BIG-IP LTM load balancing algorithm selection
Source: https://techdocs.f5.com/kb/en-us/products/big-ip_ltm/manuals/product/ltm-concepts-11-5-0/5.html
Topics
Community Discussion
No community discussion yet for this question.