Multipath Congestion Control for the L4S Architecture

• Queuing latency is one of the limiting factors to achieve the latency targets of emerging latency-sensitive Internet applications (e.g., interactive web, real-time online gaming). It occurs when large capacity-seeking traffic bloats router buffers configured to allow full link utilization of standard TCP congestion controllers (e.g., TCP Reno, Cubic). The Low Latency, Low Loss and Scalable Throughput (L4S) architecture proposes to overcome the problem by combining scalable congestion controllers (e.g., DCTCP, TCP Prague) and early congestion signaling from the network. L4S defines Dual Queue Coupled (DQC) AQM as transition mechanism enabling scalable senders to coexist with standard congestion control. This paper extends the L4S Internet service to the multipath domain by using MDTCP—a scalable multipath congestion control for Multipath TCP (MPTCP). We evaluate the performance of MDTCP in a controlled network environment mimicking the L4S Internet service architecture. Our results indicate that MDTCP and TCP Prague achieve similar flow completion time for short flows, and outperform both the non-scalable, single-path, and multipath congestion controls. MDTCP also improves multipath capacity utilization compared to the existing MPTCP congestion controllers and outperforms both TCP Prague and TCP Cubic. Although MDTCP achieves a lower FCT for medium flows than TCP Prague, it does not show improved performance than the classic CCs due to its exit from the slow-start phase. With regard to bottleneck capacity sharing, MDTCP never caused starvation when sharing a bottleneck with a single-path TCP Prague, and is not severely affected by the competing TCP Prague flows.

Ämnesord

NATURVETENSKAP  -- Data- och informationsvetenskap -- Datavetenskap (hsv//swe)

NATURAL SCIENCES  -- Computer and Information Sciences -- Computer Sciences (hsv//eng)

Nyckelord

Computer Science

Datavetenskap

Publikations- och innehållstyp

vet (ämneskategori)

ovr (ämneskategori)