Relentless Congestion Control
Source: Pittsburgh Supercomputing Center
Relentless congestion control is a simple modification to AIMD congestion control: instead of halving cwnd after a loss, cwnd is reduced by the number of lost segments. It can be modeled as a strict implementation of Van Jacob-son's Packet Conservation Principle. Relentless congestion control has exactly unity gain, which is expected to make it much easier for network devices to accurately control traffic. Relentless Congestion Control is not TCP-friendly. It requires that the network allocates capacity through some technique that segregates the traffic into flows or classes and can send different congestion signals to each.