MPCC: Online learning multipath transport

Tomer Gilad, Neta Rozen-Schiff, P. Brighten Godfrey, Costin Raiciu, Michael Schapira

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract

Multipath transport, as embodied in MPTCP, is deployed to improve throughput and reliability in mobile and residential access networks, with additional use-cases including spreading load in data centers and WANs. However, MPTCP is fundamentally tied to TCP Reno's legacy AIMD algorithm, and significantly lags behind the performance of modern single-path designs. Consequently, MPTCP fails to achieve high performance in many real-world environments. We present MPCC, a high-performance multipath congestion control architecture. To achieve our combined goals of fairness and high performance in challenging environments, MPCC employs online convex optimization (a.k.a. online learning). In experiments with a kernel implementation on emulated and live networks, MPCC significantly outperforms MPTCP.

Original languageEnglish (US)
Title of host publicationCoNEXT 2020 - Proceedings of the 16th International Conference on Emerging Networking EXperiments and Technologies
PublisherAssociation for Computing Machinery, Inc
Pages121-135
Number of pages15
ISBN (Electronic)9781450379489
DOIs
StatePublished - Nov 23 2020
Externally publishedYes
Event16th ACM Conference on Emerging Networking Experiment and Technologies, CoNEXT 2020 - Barcelona, Spain
Duration: Dec 1 2020Dec 4 2020

Publication series

NameCoNEXT 2020 - Proceedings of the 16th International Conference on Emerging Networking EXperiments and Technologies

Conference

Conference16th ACM Conference on Emerging Networking Experiment and Technologies, CoNEXT 2020
CountrySpain
CityBarcelona
Period12/1/2012/4/20

Keywords

  • congestion control
  • multipath

ASJC Scopus subject areas

  • Computer Networks and Communications

Fingerprint Dive into the research topics of 'MPCC: Online learning multipath transport'. Together they form a unique fingerprint.

Cite this