Skip to content
Preprint

Extending Low Latency Service Across the Internet

Aug 2026 · 0 citations · 27 references
Computer Science

TL;DR

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.

Abstract

Protocols such as L4S for low latency network services have attracted growing interest from major industry stakeholders such as Comcast, Apple, T-Mobile, and NVIDIA. However, L4S requires isolation between L4S flows and classic flows in order to maintain its low latency benefits and safe coexistence. The L4S architecture uses a DualPI2 AQM mechanism to provide this isolation when the bottleneck occurs at the home access link. In practice, however, bottlenecks may also occur at other locations in the network, such as peering points, ingress to wide area networks, or occasionally congested links in the core, where deploying DualPI2 AQM is not feasible. Without a solution to this problem, L4S may struggle to gain deployment, since its benefits may remain limited without end-to-end support. To address this challenge, we propose 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. We demonstrate the feasibility of this approach through large scale experiments on the FABRIC testbed. Our results demonstrate a practical deployment strategy for extending low latency service across the Internet, even across independently administered networks.

View source

Similar papers

Abstraction: Flow Prioritization With Spatial Diversity in The Data Center Network

The proposed Multi-Path Multi-Level Feedback Queueing (MP-MLFQ) leverages the spatial diversity and regularity of DCNs to realize a scheduler with numerous logical priority levels while occupying as low as 2 physical priority queues within network switches.

Alessandro Cornacchia, Andrea Bianco, Paolo Giaccone et al. · 0 citations
Preprint Aug 2026

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

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.

Maria Eduarda Veras, Eduardo Freitas, Assis T. de Oliveira et al. · 0 citations
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, Xiaolin Pang, Junyi Zhang · 0 citations
Book Open access Aug 2026

PacketExpress: Fully Exploiting Large MTUs for Internet Traffic in Private Networks

Network bandwidth continues to scale rapidly, yet Internet data transmission performance remains constrained by the legacy 1500 B MTU. This small MTU translates high bandwidth into high packet rates that strain CPU processing at middleboxes and end hosts. While increasing the MTU could substantially improve performance, coordinating upgrades across arbitrary Internet paths is impractical. This paper presents PacketExpress, a packet processing architecture that enables networks to leverage large MTUs for Internet traffic without requiring modifications to neighboring networks. MTU-translating gateways at network borders dynamically aggregate incoming small packets into larger packets for efficient processing, then segment them back when forwarding externally. We present PXIO, a packet processing stack that leverages NIC offload capabilities to achieve high throughput. We introduce F-PMTUD, which determines the path MTU within a single round-trip time without relying on ICMP. For UDP, we present PX-caravan, a tunneling mechanism that encapsulates multiple packets to benefit from large MTUs while preserving packet boundaries. Our prototype achieves 1.47 Tbps throughput with 8 CPU cores while converting over 90% of 1500 B packets into 9000 B packets, improving middlebox performance by up to 5.1× and end-host performance by up to 2.5×.

Junghan Yoon, Youngmin Choi, Juyoung Park et al. · 0 citations
Book Open access Aug 2026

Multi-CDN as a Collective Service: Towards Hot Start in Congestion Control at Scale

Modern CDN vendors typically provide multi-server services for content deliveries, in which different requests from the same client are often scheduled to diverse CDN nodes. In this case, the requested data (e.g., short video chunks) always suffer from cold start during its transmission, especially for the first flow of established connections, due to the unknown client-side network quality. Existing schemes focus on single-server startup parameter optimization, whose referred metrics appear to be extremely limited. To address this issue, we propose hStart, a novel collective service paradigm that enables hot-start congestion control by efficient collaboration between CDN nodes. hStart synchronizes probed network quality information (e.g., bandwidth, latency) across CDN nodes to initialize congestion control from historical data, avoiding probing convergence. It uses hierarchical state synchronization to limit overhead, and adaptive prediction with a time-decay trust model to handle dynamics. We implement and deploy the hStart system for the QUIC protocol. Extensive evaluations in both controlled testbeds and large-scale production CDN environments demonstrate that hStart effectively eliminates cold start penalties, boosting 46.47% throughput gain and 21.43% rebuffering reduction.

Tong Li, Jiuxiang Zhu, Bo Wu et al. · 0 citations
Book Open access Aug 2026

CSIG: Congestion Signaling for Datacenter Transports

This work introduces CSIG, a protocol that delivers precise, multi-bit bottleneck congestion signals via a fixed-length Ethernet header, and proposes Fast Ramp-Up, a congestion control primitive that leverages these bottleneck signals to reduce median RPC latency by 20% and unclaimed bandwidth by 60% in production.

Abhiram Ravi, Nandita Dukkipati, Weiwu Pang et al. · 0 citations

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