Improving DCTCP/Prague Congestion Control Responsiveness

01/19/2021
by   Bob Briscoe, et al.
0

This report explains how DCTCP introduces 1–2 rounds of unnecessary lag, due to the way it processes congestion feedback. To solve this, a per-ACK moving average is proposed. It always cuts out 1 RTT of this lag and, paradoxically, it cuts out most of the rest of the lag by spreading the congestion response over a round. The EWMA still averages out variations in the feedback signal over the same set number of round trips, even though it is clocked per-ACK. This version of the report is released prior to full evaluation, in order to elicit early feedback on the design.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
06/14/2022

Future Internet Congestion Control: The Diminishing Feedback Problem

It is increasingly difficult for Internet congestion control mechanisms ...
research
08/26/2019

Low-Congestion Shortcut and Graph Parameters

The concept of low-congestion shortcuts is initiated by Ghaffari and Hae...
research
08/20/2015

Passenger Flow Predictions at Sydney International Airport: A Data-Driven Queuing Approach

Time spent in processing zones at an airport are an important part of th...
research
03/21/2019

Utilizing Mobile Nodes for Congestion Control in Wireless Sensor Networks

Congestion control and avoidance in Wireless Sensor Networks (WSNs) is a...
research
06/04/2022

Learning in Congestion Games with Bandit Feedback

Learning Nash equilibria is a central problem in multi-agent systems. In...
research
08/18/2020

Evaluating BBRv2 on the Dropbox Edge Network

Nowadays, loss-based TCP congestion controls in general and CUBIC specif...
research
10/24/2022

Offline congestion games: How feedback type affects data coverage requirement

This paper investigates when one can efficiently recover an approximate ...

Please sign up or login with your details

Forgot password? Click here to reset