| Main index | Section 4 | Options |
Like HD, the algorithm aims to keep network queuing delays below a particular threshold (queue_threshold) and decides to reduce the congestion window (cwnd) probabilistically based on its estimate of the network queuing delay.
It differs from HD in three key aspects:
| queue_threshold | |
| Queueing congestion threshold (qth) in ticks. Default is 20. | |
| pmax | |
| Per RTT maximum backoff probability as a percentage. Default is 50. | |
| qmin | |
| Minimum queuing delay threshold (qmin) in ticks. Default is 5. | |
| loss_fair | |
| If 1, cwnd is adjusted using the shadow window when a congestion related loss is detected. Default is 1. | |
| use_max | |
| If 1, the maximum RTT seen within the measurement period is used as the basic delay measurement for the algorithm, otherwise a sampled RTT measurement is used. Default is 1. | |
, , in 35th Annual IEEE Conference on Local Computer Networks, 24-31, Improved coexistence and loss tolerance for delay based TCP congestion control, October 2010.
The module was first released in 2010 by David Hayes whilst working on the NewTCP research project at Swinburne University of Technology's Centre for Advanced Internet Architectures, Melbourne, Australia. More details are available at:
| CC_CHD (4) | May 13, 2021 |
| Main index | Section 4 | Options |
Please direct any comments about this manual page service to Ben Bullock. Privacy policy.
| “ | An ASCII character walks into a bar and orders a double. "Having a bad day?" asks the barman. "Yeah, I have a parity error," replies the ASCII character. The barman says, "Yeah, I thought you looked a bit off." | ” |