← All Problemssystem-designmedium~30 min

Cache Avalanche via Synchronized Uniform TTL Expirations

Product catalog caching 500,000 inventory items at 03:00 AM using a rigid static 24-hour TTL.

Scope, Requirements & Constraints

Product catalog caching 500,000 inventory items at 03:00 AM using a rigid static 24-hour TTL. Failure cascade dynamic: 100k QPS → TTL Expiration → Cache Miss Herd → Origin Slam → 💥 DB Meltdown.

Core Functional Requirements

✓Operational Invariant: "Always inject randomized jitter into cache TTLs to decorrelate expiration boundaries and prevent avalanches."
✓Production Hardening: Add randomized jitter to every cache expiration time: TTL = Base_TTL + UniformRandom(-Jitter , +Jitter) (e.g. 86400s ± 7200s). This spreads expirations uniformly across several hou
✓Prevent cascading failure by isolating downstream degradation at the ingress boundary.

Scale & Latency Constraints

—Incident Scenario Baseline: Product catalog caching 500,000 inventory items at 03:00 AM using a rigid static 24-hour TTL.
—Failure Cascade Path: 100k QPS → TTL Expiration → Cache Miss Herd → Origin Slam → 💥 DB Meltdown
—Sub-millisecond rejection / shed latency for overloaded requests

Reference Architecture & System Blueprint

Add randomized jitter to every cache expiration time: TTL = Base_TTL + UniformRandom(-Jitter , +Jitter) (e.g. 86400s ± 7200s). This spreads expirations uniformly across several hours. Invariant: "Always inject randomized jitter into cache TTLs to decorrelate expiration boundaries and prevent avalanches."

System Architecture Blueprint

Production Topology

Cache Avalanche via Synchronized Uniform TTL Expirations Architecture Blueprint

Architecture Flow NarrativeIngress → Bounded Admission Controller → Adaptive Concurrency / Queue Gate → Protected Worker Engine; Overload Shed Path → HTTP 429 / Circuit Fallback (<0.1ms).

Hardened Implementation Steps

1Ingress Boundary Defense: Add randomized jitter to every cache expiration time: TTL = Base_TTL + UniformRandom(-Jitter , +Jitter) (e.g. 86400s ± 7200s). This spreads expiration
2Failure Containment: Eliminate unconstrained buffering and propagate physical backpressure.
3Invariant Enforcement: Always inject randomized jitter into cache TTLs to decorrelate expiration boundaries and prevent avalanches.

Production Code Contrast & Implementation

java

// HARDENED: Singleflight mutex coalescing with probabilistic early refresh
public byte[] getProduct(String key) {
    // XFetch algorithm evaluates early background refresh before TTL expiration
    if (shouldProbabilisticEarlyRefresh(key, beta, delta)) {
        backgroundPool.submit(() -> refreshCacheKey(key));
    }
    // Singleflight ensures exactly ONE upstream DB fetch executes per in-flight key
    return singleflightGroup.execute(key, () -> database.queryProduct(key));
}

Key Decisions & Trade-Off Analysis

Architectural comparison of naive unconstrained allocations versus production-hardened mechanical sympathy.

Architectural Decisions & Trade-Offs

⚖Ingress Admission: Naive unconstrained buffering causes queue bloat and GC exhaustion. Mitigation: Bounded ingress gate with fast non-blocking shedding.
⚖Resource Strategy: Static capacity allocations collapse under brownouts. Mitigation: Dynamic adaptive limits scaling to real-time physical bounds.
⚖Outage Impact: Cascading lock convoys and memory saturation. Mitigation: Isolated failure domains keep P99 latency flat and protected.

Alternatives Evaluated

→Naive Approach: At exactly 03:00 AM the following morning, all 500,000 keys expire at the identical second. Normal traffic instantly drops from a 99.8% cache hit rate
→Production-Hardened Pattern: Add randomized jitter to every cache expiration time: TTL = Base_TTL + UniformRandom(-Jitter , +Jitter) (e.g. 86400s ± 7200s). This spreads expiration

Scale Bottlenecks & Operational Hazards

Operational Hazards & Mitigations

⚠Cascading Failure: At exactly 03:00 AM the following morning, all 500,000 keys expire at the identical second. Normal traffic instantly drops from a 99.8% cache hit rate to 0%, slamming the database with hundreds of thousands of queries simultaneously.
⚠Breakdown Chain: 100k QPS → TTL Expiration → Cache Miss Herd → Origin Slam → 💥 DB Meltdown
⚠Shedding Failure: Without fast rejection at the boundary, queued dead work triggers multi-second GC pauses, CPU thrashing, and cascading 504 Gateway Timeouts.

Changed Constraints & System Extension

How does the system enforce physical resource boundaries under sudden downstream latency brownouts?

Extension Implementation Steps

1Track real-time latency gradients and inflight concurrency.
2Reject excess traffic at the ingress boundary within <0.1ms.
3Monitor P99 latency and verify autonomous recovery when downstream pressure subsides.

Follow-Up Trade-Offs

⚖Architectural Invariant: "Always inject randomized jitter into cache TTLs to decorrelate expiration boundaries and prevent avalanches."
⚖Physical Resource Boundary: Dynamic admission control ensures worker threads never buffer dead requests during downstream brownouts.

Interactive Assessment & Knowledge Check

Test your understanding of the architecture decisions, data patterns, and trade-offs used in Cache Avalanche via Synchronized Uniform TTL Expirations.

Interactive Practice Quiz•Question 1 of 3

intermediate

Single-Thread Execution Bottleneck

Why does Redis execute single-threaded command processing faster than traditional multi-threaded locked data structures?