Dual Queue Coupled AQM: Deployable Very Low Queuing Delay for All

by   Koen De Schepper, et al.

On the Internet, sub-millisecond queueing delay and capacity-seeking have traditionally been considered mutually exclusive. We introduce a service that offers both: Low Latency Low Loss Scalable throughput (L4S). When tested under a wide range of conditions emulated on a testbed using real residential broadband equipment, queue delay remained both low (median 100–300 μs) and consistent (99th percentile below 2 ms even under highly dynamic workloads), without compromising other metrics (zero congestion loss and close to full utilization). L4S exploits the properties of `Scalable' congestion controls (e.g., DCTCP, TCP Prague). Flows using such congestion control are however very aggressive, which causes a deployment challenge as L4S has to coexist with so-called `Classic' flows (e.g., Reno, CUBIC). This paper introduces an architectural solution: `Dual Queue Coupled Active Queue Management', which enables balance between Scalable and Classic flows. It counterbalances the more aggressive response of Scalable flows with more aggressive marking, without having to inspect flow identifiers. The Dual Queue structure has been implemented as a Linux queuing discipline. It acts like a semi-permeable membrane, isolating the latency of Scalable and `Classic' traffic, but coupling their capacity into a single bandwidth pool. This paper justifies the design and implementation choices, and visualizes a representative selection of hundreds of thousands of experiment runs to test our claims.


DWTCP: Ultra Low Latency Congestion Control Protocol for Data Centers

Congestion control algorithms rely on a variety of congestion signals (p...

The Native AQM for L4S Traffic

This memo focuses solely on the native AQM of Low Latency Low Loss Scala...

SQP: Congestion Control for Low-Latency Interactive Video Streaming

This paper presents the design and evaluation of SQP, a congestion contr...

Scaling TCP's Congestion Window for Small Round Trip Times

This memo explains that deploying active queue management (AQM) to count...

Fissile Locks

Classic test-and-test (TS) mutual exclusion locks are simple, and enjoy ...

Enabling Work-conserving Bandwidth Guarantees for Multi-tenant Datacenters via Dynamic Tenant-Queue Binding

Today's cloud networks are shared among many tenants. Bandwidth guarante...

Resolving Tensions between Congestion Control Scaling Requirements

Low Latency, Low Loss Scalable throughput (L4S) is being proposed as the...

Please sign up or login with your details

Forgot password? Click here to reset