Niche: isolation-oriented competition-aware active queue management on programmable switches

Heterogeneous application environments necessitate the coexistence of diverse Congestion Control Algorithms (CCAs). However, traditional active queue management (AQM) schemes are typically agnostic to specific CCAs and treat heterogeneous traffic flows uniformly, thereby overlooking the diverse buffering requirements of these CCAs. Consequently, bandwidth allocation does not explicitly consider latency and buffer utilization metrics. We present Niche, a lightweight, contention-aware AQM designed for programmable switches. Niche leverages local buffer—backlog statistics to dynamically classify and isolate flows into physical queues without incurring complex measurement overhead. Combined with dynamic bandwidth allocation, Niche not only improves inter-flow fairness but also optimizes comprehensive performance. Experimental validation on programmable switches confirms that in multi-CCA coexistence scenarios, Niche reduces total buffer occupancy by 50% while stabilizing the Jains’ Fairness Index at 0.98. Crucially, it lowers end-to-end latency for latency-sensitive flows like BBR and Vegas by an order of magnitude. Niche approximates the fairness of Fair Queuing (FQ) with limited queue resources, outperforming comparable baselines and demonstrating consistent performance gains as queue availability scales.

Authors

Publication Details

Journal
PeerJ Computer Science
Published
2026-04-21
DOI
https://doi.org/10.7717/peerj-cs.3840
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

Niche: isolation-oriented competition-aware active queue management on programmable switches

Zhenling Wang, Ya Gao
PeerJ Computer Science
Network Traffic and Congestion Control
article

Niche: isolation-oriented competition-aware active queue management on programmable switches

Zhenling Wang, Ya Gao
article en

Abstract

Heterogeneous application environments necessitate the coexistence of diverse Congestion Control Algorithms (CCAs). However, traditional active queue management (AQM) schemes are typically agnostic to specific CCAs and treat heterogeneous traffic flows uniformly, thereby overlooking the diverse buffering requirements of these CCAs. Consequently, bandwidth allocation does not explicitly consider latency and buffer utilization metrics. We present Niche, a lightweight, contention-aware AQM designed for programmable switches. Niche leverages local buffer—backlog statistics to dynamically classify and isolate flows into physical queues without incurring complex measurement overhead. Combined with dynamic bandwidth allocation, Niche not only improves inter-flow fairness but also optimizes comprehensive performance. Experimental validation on programmable switches confirms that in multi-CCA coexistence scenarios, Niche reduces total buffer occupancy by 50% while stabilizing the Jains’ Fairness Index at 0.98. Crucially, it lowers end-to-end latency for latency-sensitive flows like BBR and Vegas by an order of magnitude. Niche approximates the fairness of Fair Queuing (FQ) with limited queue resources, outperforming comparable baselines and demonstrating consistent performance gains as queue availability scales.

PeerJ Computer ScienceVol. 12
Openalex Percentile: Top 16%
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.