PulseExploreJournal ClubDebatesTrendingResearchersJournals
Instagram
HomeExploreJournal ClubTrending
Synapse
⌘+K
Synapse
April 23, 2026PeerJ Computer Science0 citationsOpen Access

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

View Full Paper
YGYa GaoZWZhenling Wang

Key Points

  • The aim is to develop an active queue management system that accommodates diverse congestion control algorithms efficiently.
  • Developed Niche, a lightweight and contention-aware AQM for programmable switches.
  • Utilized local buffer-backlog statistics for dynamic flow classification and isolation.
  • Conducted experimental validation on programmable switches under multi-CCA scenarios.
  • Reduced total buffer occupancy by 50%.
  • Stabilized the Jains’ Fairness Index at 0.98.
  • Lowered end-to-end latency for latency-sensitive flows by an order of magnitude.

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.

Ask AI
Helpful
Bookmark
Share
View Full Paper

Cite This Study

Gao et al. (2026) studied this question.

synapsesocial.com/papers/69e9b77885696592c86eb4dahttps://doi.org/10.7717/peerj-cs.3840
Ask AI
Helpful
Bookmark
Share
View Full Paper