CVE-2026-98857
NoneCVSS
—
EPSS
0.2%
Published
Oct 18, 2026
CISA due date
—
Cloudanix analysis
A flaw in Linux load-balancing code lets an attacker keep adding entries to internal tables until the system runs out of memory and stops handling traffic properly.
- Exploitation
- Remote Unauthenticated
- Attacker needs
- None
- Complexity
- Low
- Impact
- Denial Of Service
- Component
- OS kernel
- Class
- Denial of service
- Remediation
- Upgrade
- Effort
- Medium
- Patch risk
- Low
What it actually does
Unbounded growth of LBLCR and LBLC IPVS cache tables when new destination addresses are presented, because max_size only triggers post-exceedance reclamation by the periodic collector and does not prevent attacker-controlled continued use of entries.
Why it matters to the business
Load-balanced services using these schedulers can experience memory exhaustion and degraded performance or denial of service when exposed to traffic with many unique destinations, increasing operational risk for high-availability environments.
How an attack unfolds
An attacker generates traffic flows that each target a previously unseen destination address, causing ip_vs_lblcr_new and ip_vs_lblc_new to allocate new cache entries without limit; the periodic collector cannot keep pace, leading to uncontrolled table growth and eventual resource exhaustion.
How to fix it
Apply the kernel patch that enforces rejection of new cache entries once either table reaches max_size * 3 / 2, allowing the periodic collector to reclaim entries while preserving fallback scheduling.
How to confirm the fix worked
Confirm the patched kernel rejects cache creation attempts once the threshold is reached and that existing entries continue to be collected; monitor table sizes under synthetic load that previously triggered unbounded growth.
Typical attack path
- Identify an IPVS-enabled service using LBLCR or LBLC scheduler
- Generate high-volume traffic with many unique destination addresses
- Observe cache table growth beyond max_size without reclamation keeping pace
- Continue traffic to maintain entries and exhaust memory
How to detect it
Inspect kernel logs and IPVS statistics for rapid growth in lblcr or lblc cache entry counts; correlate with traffic patterns containing many distinct destination addresses; look for memory pressure warnings on systems running the affected IPVS schedulers.
What your security team should do
- Prioritize patching Linux kernel IPVS instances using LBLCR or LBLC schedulers within the next maintenance window
- Review IPVS configuration for use of these schedulers and consider migrating to bounded alternatives if patching is delayed
- Monitor memory usage of ip_vs cache tables in production load balancers
The record
In the Linux kernel, the following vulnerability has been resolved: ipvs: bound LBLCR and LBLC cache growth ip_vs_lblcr_new() and ip_vs_lblc_new() create cache entries for every previously unseen destination address. The table max_size only tells the periodic collector to reclaim entries after the cache has already exceeded the limit. It does not reclaim entries that the attacker continues to use. Reject new cache entries once either table reaches max_size * 3 / 2. The extra headroom lets the periodic collector catch up while the existing scheduler fallback continues to use the selected destination when cache creation fails. New traffic therefore stays serviceable without growing the tables further.
Affected packages
| Ecosystem | Package | Introduced | Fixed |
|---|