Flow-CoDel: per-flow active queue management for balanced delay and drops in bufferbloat mitigation

Network congestion control remains a critical challenge in modern networking, where traditional Active Queue Management (AQM) algorithms often struggle to balance low latency, fairness, and packet drops. The Controlled Delay (CoDel) algorithm was introduced to address bufferbloat but still faces limitations in dynamic traffic conditions, including unfair drop distribution and excessive packet loss during congestion. This paper presents Flow-CoDel, an enhanced version of CoDel that introduces coordinated per-flow packet drops to optimize congestion response. Through systematic evaluation, our algorithm demonstrates 31% lower average delay at near-congestion (ρ = 0.9) compared to standard CoDel, along with a drastic reduction in packet drops. Additionally, it ensures fairer packet drops across competing flows. These results suggest that Flow-CoDel offers a promising alternative for scenarios requiring consistent latency and efficient drop policies, such as real-time streaming and VoIP.

Authors

Institutions

Publication Details

Journal
Discover Networks
Published
2025-12-08
DOI
https://doi.org/10.1007/s44354-025-00012-z
Primary Topic
Network Traffic and Congestion Control
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Flow-CoDel: per-flow active queue management for balanced delay and drops in bufferbloat mitigation

Seyed Mahmoud Ashrafi, Ali Ghiasian
Discover Networks
Network Traffic and Congestion Control
article

Flow-CoDel: per-flow active queue management for balanced delay and drops in bufferbloat mitigation

Seyed Mahmoud Ashrafi, Ali Ghiasian
article en

Abstract

Network congestion control remains a critical challenge in modern networking, where traditional Active Queue Management (AQM) algorithms often struggle to balance low latency, fairness, and packet drops. The Controlled Delay (CoDel) algorithm was introduced to address bufferbloat but still faces limitations in dynamic traffic conditions, including unfair drop distribution and excessive packet loss during congestion. This paper presents Flow-CoDel, an enhanced version of CoDel that introduces coordinated per-flow packet drops to optimize congestion response. Through systematic evaluation, our algorithm demonstrates 31% lower average delay at near-congestion (ρ = 0.9) compared to standard CoDel, along with a drastic reduction in packet drops. Additionally, it ensures fairer packet drops across competing flows. These results suggest that Flow-CoDel offers a promising alternative for scenarios requiring consistent latency and efficient drop policies, such as real-time streaming and VoIP.

Discover NetworksVol. 1(1)
Shahrekord University (IR)
Openalex Percentile: Top 56%
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.