Manual Pages  — CC_HD

cc_hd – HD Congestion Control Algorithm

DESCRIPTION MIB Variables SEE ALSO ACKNOWLEDGEMENTS FUTURE WORK HISTORY AUTHORS

The HD congestion control algorithm is an implementation of the Hamilton Institute's delay-based congestion control which aims to keep network queuing delays below a particular threshold (queue_threshold).

HD probabilistically reduces the congestion window (cwnd) based on its estimate of the network queuing delay. The probability of reducing cwnd is zero at hd_qmin or less, rising to a maximum at queue_threshold, and then back to zero at the maximum queuing delay.

Loss-based congestion control algorithms such as NewReno probe for network capacity by filling queues until there is a packet loss. HD competes with loss-based congestion control algorithms by allowing its probability of reducing cwnd to drop from a maximum at queue_threshold to be zero at the maximum queuing delay. This has been shown to work well when the bottleneck link is highly multiplexed.

Development and testing of this software were made possible in part by grants from the FreeBSD Foundation and Cisco University Research Program Fund at Community Foundation Silicon Valley.

The Hamilton Institute have recently made some improvements to the algorithm implemented by this module and have called it Coexistent-TCP (C-TCP). The improvements should be evaluated and potentially incorporated into this module.

The cc_hd congestion control module and this manual page were written by David Hayes <Mt david.hayes@ieee.org>.