Repository logo
Log in(current)
Repository logoMIT Open ScholarshipDSpace@MIT
  1. Home
  2. MIT Open Access Articles
  3. MIT Open Access Articles
  4. Restructuring endpoint congestion control

Restructuring endpoint congestion control

Thumbnail Image
Download
Name

ccp-sigcomm18.pdf

Description
Accepted version
Size

913.87 KB

Format

Adobe PDF

Checksum (MD5)

f3b02388247ec53ad55c278ea924c562

sword-2019-05-02T16:32:33.original.xml (130 B)
Original SWORD entry document
Author(s)
Narayan, Akshay
•
Cangialosi, Frank
•
Raghavan, Deepti
•
Goyal, Prateesh
•
Narayana, Srinivas
•
Mittal, Radhika
•
Alizadeh, Mohammad
•
Balakrishnan, Hari
Date Issued
August 7, 2018
Publisher
ACM
Citation
Narayan, Akshay, Cangialosi, Frank, Raghavan, Deepti, Goyal, Prateesh, Narayana, Srinivas et al. 2018. "Restructuring endpoint congestion control."
Version
Author's final manuscript
Abstract
© 2018 Copyright held by the owner/author(s). Publication rights licensed to the Association for Computing Machinery. This paper describes the implementation and evaluation of a system to implement complex congestion control functions by placing them in a separate agent outside the datapath. Each datapath'such as the Linux kernel TCP, UDP-based QUIC, or kernel-bypass transports like mTCP-on-DPDK'summarizes information about packet round-trip times, receptions, losses, and ECN via a well-defined interface to algorithms running in the off-datapath Congestion Control Plane (CCP). The algorithms use this information to control the datapath's congestion window or pacing rate. Algorithms written in CCP can run on multiple datapaths. CCP improves both the pace of development and ease of maintenance of congestion control algorithms by providing better, modular abstractions, and supports aggregation capabilities of the Congestion Manager, all with one-time changes to datapaths. CCP also enables new capabilities, such as Copa in Linux TCP, several algorithms running on QUIC and mTCP/DPDK, and the use of signal processing algorithms to detect whether cross-traffic is ACK-clocked. Experiments with our user-level Linux CCP implementation show that CCP algorithms behave similarly to kernel algorithms, and incur modest CPU overhead of a few percent.
MIT Department
Massachusetts Institute of Technology. Computer Science and Artificial Intelligence Laboratory
Terms of Use
Creative Commons Attribution-Noncommercial-Share Alike
http://creativecommons.org/licenses/by-nc-sa/4.0/
Persistent DSpace Link
https://hdl.handle.net/1721.1/137387
DOI of Published Version
https://doi.org/10.1145/3230543.3230553
Repository logo
PrivacyPermissionsAccessibilityContact us
Repository logo
Notify us about copyright concerns.