Early Backpressure Detection for High-Throughput Distributed Systems: A Latency Gradient Based Approach Using Dual EWMA and Queue Occupancy

This paper presents a lightweight, zero-allocation backpressure detection algorithm for high-throughput distributed message pipelines. It combines two signals: a latency gradient computed via dual EWMA (short-term and long-term exponentially weighted moving averages), and ring buffer occupancy. Unlike traditional queue-occupancy-only detectors, which react late, the latency gradient flags degradation before the queue fills — as validated experimentally, detecting congestion ~200ms before full queue saturation. The design draws from TCP congestion control (Vegas, gradient-based load management) adapted for application-level queues. It runs in constant O(1) time per event, with ~500ns overhead measured via JMH microbenchmarks, and includes hysteresis to prevent state flapping plus an AIMD-based advisory rate control. Full reference implementation and evaluation harness available on GitHub.

Authors

Publication Details

Journal
Zenodo (CERN European Organization for Nuclear Research)
Published
2026-08-13
DOI
https://doi.org/10.5281/zenodo.21915941
Primary Topic
Network Traffic and Congestion Control
Type
preprint
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
preprint

Early Backpressure Detection for High-Throughput Distributed Systems: A Latency Gradient Based Approach Using Dual EWMA and Queue Occupancy

Chirag Arora
Zenodo (CERN European Organization for Nuclear Research)
Network Traffic and Congestion Control
preprint

Early Backpressure Detection for High-Throughput Distributed Systems: A Latency Gradient Based Approach Using Dual EWMA and Queue Occupancy

Chirag Arora
preprint en

Abstract

This paper presents a lightweight, zero-allocation backpressure detection algorithm for high-throughput distributed message pipelines. It combines two signals: a latency gradient computed via dual EWMA (short-term and long-term exponentially weighted moving averages), and ring buffer occupancy. Unlike traditional queue-occupancy-only detectors, which react late, the latency gradient flags degradation before the queue fills — as validated experimentally, detecting congestion ~200ms before full queue saturation. The design draws from TCP congestion control (Vegas, gradient-based load management) adapted for application-level queues. It runs in constant O(1) time per event, with ~500ns overhead measured via JMH microbenchmarks, and includes hysteresis to prevent state flapping plus an AIMD-based advisory rate control. Full reference implementation and evaluation harness available on GitHub.

Zenodo (CERN European Organization for Nuclear Research)
Network Traffic and Congestion Control
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.