Lines Matching +full:zero +full:- +full:based

2 .\" Copyright (c) 2010-2011 The FreeBSD Foundation
37 Institute's delay-based congestion control which aims to keep network queuing
40 HD probabilistically reduces the congestion window (cwnd) based on its estimate
42 The probability of reducing cwnd is zero at hd_qmin or less, rising to a maximum
43 at queue_threshold, and then back to zero at the maximum queuing delay.
45 Loss-based congestion control algorithms such as NewReno probe for network
47 HD competes with loss-based congestion control algorithms by allowing its
49 zero at the maximum queuing delay.
57 .Bl -tag -width ".Va queue_threshold"
86 .%T "A strategy for fair coexistence of loss and delay-based congestion control algorithms"
91 .%P "555-557"
99 implemented by this module and have called it Coexistent-TCP (C-TCP).
115 .An -nosplit