DeepAI AI Chat
Log In Sign Up

Improving DCTCP/Prague Congestion Control Responsiveness

by   Bob Briscoe, et al.

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.


page 1

page 2

page 3

page 4


Future Internet Congestion Control: The Diminishing Feedback Problem

It is increasingly difficult for Internet congestion control mechanisms ...

Pulser: Fast Congestion Response using Explicit Incast Notifications for Datacenter Networks

Datacenter applications frequently cause incast congestion, which degrad...

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...

Low-Congestion Shortcut and Graph Parameters

The concept of low-congestion shortcuts is initiated by Ghaffari and Hae...

Utilizing Mobile Nodes for Congestion Control in Wireless Sensor Networks

Congestion control and avoidance in Wireless Sensor Networks (WSNs) is a...

Evaluating BBRv2 on the Dropbox Edge Network

Nowadays, loss-based TCP congestion controls in general and CUBIC specif...

An Evaluation of BBR and its variants

The congestion control algorithm bring such importance that it avoids th...