KV Event Replay — Dynamo vs vLLM

Overview

Both Dynamo and vLLM publish KV cache events (block stored, block removed, etc.) over a fire-and-forget transport (ZMQ PUB/SUB). Because PUB/SUB is lossy, both systems need a mechanism for consumers to detect missed messages and recover. This document compares the two approaches.

The Problem

A KV event consumer (router, cache coordinator) subscribes to a live stream of block events from workers. Events carry monotonically increasing sequence numbers. When the consumer detects a gap in the sequence (e.g., received seq 42 then seq 45), it needs to recover the missed events or it will have a stale, incorrect view of the worker’s KV cache state.

Architecture Comparison

How Each System Works

vLLM: Buffer-Only Replay

vLLM’s ZmqEventPublisher (in vllm/distributed/kv_events.py) runs two ZMQ sockets in a background thread:

1. PUB socket (default tcp://*:5557): Streams KVEventBatch messages tagged with a monotonic sequence number.
2. ROUTER socket (optional, e.g., tcp://*:5558): Handles replay requests from consumers.

The publisher keeps a deque of the last buffer_steps (default 10,000) serialized batches. When a consumer detects a gap, it sends the missing start sequence number to the ROUTER socket. The publisher linearly scans the buffer and streams back all batches from that sequence onward, ending with a sentinel (seq=-1, payload=empty).

Trade-offs:

• Lightweight — no additional state beyond the buffer itself; easy to reason about and deploy.
• If the gap is older than the buffer window, the consumer must rebuild state through other means (e.g., restart and re-discover).
• No built-in initial state sync — a consumer that connects after events have already been published starts with an empty view.
• Linear scan on every replay request (no indexing into the buffer).
• Consumer handles dedup by checking replay_seq > last_seq.

Dynamo: Buffer + Indexer with Tree Dump Fallback

Dynamo’s LocalKvIndexer (in lib/kv-router/src/indexer/local.rs) wraps a KvIndexer (backed by a RadixTree) with a circular event buffer:

LocalKvIndexer
├── indexer: KvIndexer          // Current state and snapshot source (RadixTree)
├── event_buffer: VecDeque      // Circular buffer for fast replay
└── max_buffer_size: usize

When the router queries a worker, the local indexer can return six response variants:

The snapshot fallback makes an evicted replay range recoverable while the worker-local indexer is available. A successful tree dump transactionally replaces that worker rank in the router’s index. It is not a transport delivery guarantee: both the live stream and the query can fail, and router state can remain temporarily degraded.

Gap Detection

Both systems detect gaps the same way: the consumer tracks the last sequence/event ID it processed and compares it against the next one received.

vLLM (from examples/online_serving/kv_events_subscriber.py):

1
if last_seq >= 0 and seq > last_seq + 1:
2
    missed = seq - last_seq - 1
3
    replay.send((last_seq + 1).to_bytes(8, "big"))
4
    # ... receive and process replayed events

Dynamo (from lib/llm/src/kv_router/indexer/recovery/worker_query_state.rs): The router tracks an admission cursor per worker and data-parallel rank. Discovering and activating a source with a recovery target starts an initial full recovery immediately; live events arriving during recovery are admitted or buffered according to the rank state. A later gap buffers the live event and requests events from the next expected ID (start_event_id=Some(expected), end_event_id=None), preserving the existing rank and cursor.

The worker selects the recovery response when handling the query: retained history produces Events; expired or unavailable history requires TreeDump. Buffered events update the existing index, while a successful tree dump transactionally replaces the rank. The client does not preselect snapshot recovery for an ordinary gap.

After applying the response, the router sorts and deduplicates its local pending events, discards those covered by the response watermark, and admits the remaining suffix in order. Missing IDs, including events evicted from the bounded pending buffer, produce a structured warning; the router continues through the gaps and finishes recovery without another catch-up RPC. This can leave stale or missing advisory cache hints. The cursor advances only after successful queue admission, and source fencing and clear ordering still apply.

Snapshot construction failures preserve existing state and cursor after bounded retries. Other query failures retain degraded live-event processing; admission failures fence the rank. A later independent live-stream gap or source change can trigger another recovery.

When to Use Which

vLLM’s built-in replay is a good fit when:

• You are running vLLM standalone and want basic gap recovery without additional infrastructure.
• Your consumer is long-lived and rarely disconnects — transient gaps are the main concern.
• You are building a custom external router or cache coordinator and want to consume KV events directly from vLLM without wrapping it in another framework.

Dynamo’s local indexer is a good fit when:

• You need snapshot-based recovery, including initial state sync for newly joined routers or consumers that were offline for extended periods.
• You are running multiple router replicas that may start at different times and should independently rebuild cache state from workers.
• You want dedup and recovery handled by the infrastructure rather than implementing it in each consumer.

The two approaches share the same core idea — a FIFO ring buffer for catching up on small, transient gaps. Dynamo adds a RadixTree underneath, which enables a current-state snapshot fallback at the cost of additional memory and complexity. vLLM keeps replay history in the buffer, which is sufficient when consumers are stable and gaps remain inside the retained window.

For deployments using Dynamo’s KV-aware routing, the local indexer is used automatically. For standalone vLLM deployments where you want to build your own event consumer, vLLM’s replay buffer provides a lightweight starting point.

See Also

• KV Router Index Data Structures: RadixTree, ConcurrentRadixTree, and PositionalIndexer internals
• Router Guide: Deployment topologies and worker-set configuration
• Configuration and Tuning: Router flags and tuning details
• Router Design: Architecture details and event transport modes