ArXivCSExplorer
β˜†β˜†BookmarksπŸ†RSSHow to UseFAQ
Built with and by Teycir Ben Soltaneβ€’
How to Useβ€’FAQβ€’GitHubβ€’arXiv.orgβ€’
Share:

20 results for β€œActive Queue Management”

CS papers only

Hybrid search: Keyword + semantic, ranked by combined score.β“˜

Want pure semantic search? Try claim verification β†’

cs.NIEmpiricalRecentOct 17, 2026

A mechanism for TCP-aware Active Queue Management in packet-forwarding devices

Swarnarup Bhunia, Somit Gond, Vayun Goel, Sreelakshmi Manjunath +1 more

This paper proposes a mechanism to detect network congestion and estimate the optimal packet-dropping threshold for a threshold-based queue policy in Internet routers.

View β†’
cs.DCEmpiricalRecentOct 13, 2026

Quota-Based Aging for Prediction-Guided Scheduling in LLM Serving

Hanzhi Zhang, Anxuan Che, Hang Qi, Qiyue Li +1 more

One clear sentence describing what this paper does

View β†’
cs.NIEmpiricalRecentJul 24, 2026

CAPS: Fine-Tuning CCA Timing

Raphael Zailer, Isaac Keslassy

This paper proposes CAPS, a scheduling layer for data centers that separates rate computation and packet scheduling, reducing queue occupancy by up to 10x without throughput loss.

View β†’
cs.PFcs.DCcs.OSEmpiricalRecentJun 22, 2026

LMS-AR: LMS Prediction-based Adaptive Regulator for Memory Bandwidth in Multicore Systems

Sudarshan Srinivasan, Deepak Gangadharan, Dip Goswami

This paper proposes LMS-AR, a memory bandwidth regulation mechanism for multi-core systems using a Linux kernel module with adaptive filtering for prediction and regulation.

View β†’
cs.NIEmpiricalRecentJun 11, 2026

ARTSN: Exact and Adaptive Self-triggered Traffic Scheduling for ARTS Networks

Ruide Cao, Shuangping Zhan, Jiashuo Lin, Yan Liu +3 more

This paper proposes ARTSN, a scheduling paradigm for autonomous real-time systems using time-sensitive networking, addressing volatility and absence challenges of self-triggered traffic.

View β†’
cs.DSTheoreticalRecentOct 19, 2026

Capacitated Line Aggregation with Maximum Delay

Runtian Ren, Shengcai Liu

This paper studies capacitated line aggregation with per-batch maximum delay and presents several algorithms with competitive ratios.

View β†’
cs.NIEmpiricalRecentJun 24, 2026

Lyapunov Optimization based Queue-aware Traffic Shaping for 5G-TSN in Industrial Environments

Kouros Zanbouri, Md Noor-A-Rahim, Cormac J Sreenan, Dirk Pesch

A cross-layer rate control algorithm is proposed to prevent bufferbloat and ensure low-latency operation in Private 5G networks.

View β†’
cs.ITmath.PRTheoreticalRecentOct 9, 2026

Fundamental Limits of Covert queueing under Busy-Period Observations

Anumula Venkata Sai Sree Sahithi, Arti Yardi, Jithin Ravi

This paper studies the maximum number of jobs a queueing system can serve covertly without being detected.

View β†’
cs.NIcs.DCcs.OSEmpiricalRecentJun 15, 2026

Single-Connection Mixed-Criticality Transport with CATS: Bounded Guarantees, Three Structural Limits, and a QUIC Escape

Syed Muhammad Aqdas Rizvi

CATS (Conductor-driven Asymmetric Transport Scheme) provides a sender-side, receiver-transparent transport-layer priority scheme over TCP to ensure deterministic non-starvation and single-flow fairnes…

View β†’
cs.DSTheoreticalRecentJul 17, 2026

Revisiting Real-Time Interval and Throughput Maximization

Allan Borodin, Changdao He, Nadim Mottu

The paper extends results for interval scheduling to the more general throughput problem in the real-time model with constant competitive ratios for specific weight functions and advance notice.

View β†’
cs.CRRecentMay 21, 2026

PACT: Reducing Alert Fatigue in Low-Prevalence SOC Streams with Triggered Active Learning

Samuel Ndichu, Tao Ban, Seiichi Ozawa, Takeshi Takahashi +1 more

PACT is a Pareto-aware active learning controller that significantly reduces the false-positive investigation burden in low-prevalence security alert streams without sacrificing recall.

View β†’
cs.NIcs.DCcs.LGEmpiricalRecentJul 28, 2026

Incast-Free MoE Rate-Based Scheduling

Evyatar Cohen, Jose Yallouz, Alexander Shpiner, Mark Silberstein +2 more

This paper proposes a proactive fair scheduling framework to prevent fabric oversubscription and eliminate incast in Mixture of Experts (MoE) architectures, demonstrating consistent link utilization a…

View β†’
cs.LGeess.SPEmpiricalRecentJun 29, 2026

Hybrid Active-Online Learning Framework for Label-Efficient Concept Drift Adaptation in Optical Network Failure Detection

Yousuf Moiz Ali, Jaroslaw E. Prilepsky, JoΓ£o Pedro, Sasipim Srivallapanondh +3 more

A hybrid active-online learning framework is proposed for label-efficient concept drift adaptation in optical network failure detection, achieving high accuracy and AUC scores with minimal samples and…

View β†’
math.PRcs.LGeess.SYTheoreticalRecentJun 16, 2026

Finite-Time Queue Peak Laws in Stochastic Networks: Logarithmic Scaling After Geometric Thresholds

Hao Liang, Cheng Tang, Yunzong Xu

This paper studies finite-horizon queue peaks in generalized switches and provides new bounds and insights.

View β†’
cs.DCEmpiricalRecentJun 10, 2026

Fair Comparison of Scheduling Algorithms on Heterogeneous Edge Clusters: A Continuous Adaptive Benchmark

Zihang Wang, Boris Sedlak, Juan Luis Herrera, Schahram Dustdar

The paper presents a benchmark platform for evaluating controllers for continuous multi-mode scheduling in edge-cloud continua.

View β†’