Skip to content
Preprint

DualPI2 Active Queue Management in ns-3: Implementation And Validation

Aug 2026 · 0 citations · 17 references
Computer Science

TL;DR

A comprehensive implementation of the DualPI2 AQM in ns-3, while also mirroring the official Linux Kernel architecture is presented, which equips the research community with a robust tool to evaluate and advance L4S performance across diverse network topologies, ranging from data centers to wireless home and office environments.

Abstract

The demand for ultra-low latency applications necessitates advanced network architectures like the Low Latency, Low Loss, and Scalable Throughput (L4S) standard. A core component of L4S is the DualPI2 Active Queue Management (AQM), which ensures the safe coexistence of scalable and classic traffic. Despite L4S's growing adoption, the ns-3 network simulator lacks a high-fidelity, up-to-date DualPI2 model. This paper presents a comprehensive implementation of the DualPI2 AQM in ns-3, while also mirroring the official Linux Kernel architecture. Our model incorporates representative mechanisms previously absent in simulation, such as credit-based Weighted Round Robin (WRR) scheduling, step-marking, and overload protection. To guarantee simulation accuracy, we validate our implementation against a physical Linux testbed across 25 diverse Bandwidth-Delay Product (BDP) scenarios. Results demonstrate that our ns-3 model replicates real-world behavior, ensuring strict throughput fairness and queue delay isolation. Ultimately, this validated model equips the research community with a robust tool to evaluate and advance L4S performance across diverse network topologies, ranging from data centers to wireless home and office environments.

View source

Similar papers

Book Open access Aug 2026

Simplifying Prioritization and Scheduling with P2CS

Evaluation on representative workloads demonstrates that P2CS achieves performance comparable to in-network mechanisms while significantly reducing complexity and cost, and requires minimal software changes making it readily deployable in today's datacenter infrastructure.

Ali Munir, Xiao-Lin Pang, Junyi Zhang · 0 citations
Preprint Aug 2026

Extending Low Latency Service Across the Internet

This work proposes a deployment strategy that reduces the need to upgrade expensive core routers by using existing networking mechanisms such as BGP communities, SRv6, and priority queues with rate caps, and demonstrates the feasibility of this approach through large scale experiments on the FABRIC testbed.

Harkirat Singh, Fatih Berkay Sarpkaya, Hakan Gulec et al. · 0 citations
Preprint Aug 2026

Scaling 5G-TSN Bridges: Operating Regimes, Scheduling, and Time Synchronisation Under Heterogeneous Industrial Traffic

The nascTime framework on OMNeT++/Simu5G is used to evaluate how many TSN endpoints a single 5G NR cell can bridge before per-flow QoS degrades, showing that sub-3 ms TSN deadlines may require radio-configuration changes such as configured grants or higher numerology.

Mohamed A. M. Seliem, U. Roedig, C. Sreenan et al. · 0 citations
Open access Aug 2026

A Lightweight Qdisc Triggered Controller (QTC) for Congestion Aware Software Defined Networks

Software Defined Networking (SDN) enables centralized and programmable traffic management. However, maintaining service quality under congestion remains a challenging task while using heavy computation or delayed network wide optimization. This paper presents a lightweight Qdisc Triggered Controller (QTC) for congestion aware path switching in SDN. The suggested controller monitors queueing discipline statistics specifically packet drops and qdisc overlimit events. The proposed mechanism is implemented using Ryu controller and evaluated in a Mininet based topology under normal, persistent, transient and sequential bottleneck scenarios. The experimental findings show that QTC maintains near baseline performance under normal network operation and provides substantial improvements under congestion. In the persistent bottleneck scenario, throughput increased from 2.102 Gbit/s with fixed path forwarding to 30.0 Gbit/s with QTC, while ICMP packet loss decreased from 5% to 0%. These results indicate that QTC provides a lightweight rule based solution for responsive congestion aware traffic engineering in SDN.

Mustafa Ayad Anwer, Z. Al-Shammari, Ahmed Sabri Ghazi Behadili · 0 citations
2026

Scalability and Delay Analysis of XR Traffic in Optical Access Networks

The rapid evolution of 5G and emerging 6G networks requires optical access systems to support immersive extended reality (XR) services with stringent quality-of-service (QoS) requirements, like ultra-low latency and high bandwidth. However, conventional dynamic bandwidth allocation (DBA) schemes in passive optical networks (PONs) allocate upstream bandwidth solely based on reported queue occupancy, without considering the unique characteristics of XR traffic. To address these limitations, we propose an XR-aware Predictive (XP)-DBA scheme that integrates XR traffic prediction, deadline-aware scheduling, adaptive grant control, and a cycle-controller to proactively allocate bandwidth, prioritize latency-critical packets, and limit polling-cycle growth. We also derive closed-form analytical expressions to characterize XR-specific stability and delay feasibility in PON systems. We evaluate XP-DBA under standardized and burst-enhanced XR traffic models across varying XR user densities and transmission distances of up to 100 km. The results show that XP-DBA will reduce latency, jitter, and polling-cycle time while increasing throughput and supporting higher XR user densities under heavy network loads without violating XR delay bounds. These findings establish XP-DBA as an efficient and scalable scheduling solution for next-generation immersive XR services over long-reach optical access networks.

Akhilesh Patel, Y. Singh · 0 citations
Book Open access Sep 2026

Towards High-Performance eBPF-based OS Scheduling for Serverless Functions

The Linux default scheduler's fairness-oriented design frequently preempts short-running serverless functions, degrading Function-as-a-Service (FaaS) performance and increasing user costs. Existing solutions to remedy this problem propose custom OS scheduling policies based on custom kernels, external frameworks, or user-space polling. To address these limitations, we explore sched_ext, a recent Linux kernel feature providing an extensible scheduler framework via the Extended Berkeley Packet Filter (eBPF). We evaluate 11 prebuilt sched_ext schedulers under production-like FaaS workloads and show that 9 out of 11 policies outperform the default Linux scheduler (EEVDF) in both performance and user costs, reducing turnaround time by up to 61.1% and user costs by up to 51.3%. In this work, we demonstrate the significant impact of OS scheduling on FaaS environments and identify successful mechanisms to guide the design of future specialized schedulers.

Saman Akbari, Manfred Hauswirth · 0 citations

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.