20 #define TCP_YEAH_GAMMA        1 /* fraction of queue to be removed per rtt */
24 #define TCP_YEAH_RHO         16 /* minimum number of consecutive rtt to consider competition on los…
84 	 * of snd_una and snd_nxt at the beginning of the current RTT. More  in tcp_yeah_cong_avoid()
85 	 * precisely, they represent the amount of data sent during the RTT.  in tcp_yeah_cong_avoid()
86 	 * At the end of the RTT, when we receive an ACK for v_beg_snd_nxt,  in tcp_yeah_cong_avoid()
88 	 * bytes of data have been ACKed during the course of the RTT, giving  in tcp_yeah_cong_avoid()
91 	 *     (v_beg_snd_nxt - v_vegas.beg_snd_una) / (rtt duration)  in tcp_yeah_cong_avoid()
99 	 * of bytes we send in an RTT is often less than our cwnd will allow.  in tcp_yeah_cong_avoid()
104 		/* We do the Vegas calculations only if we got enough RTT  in tcp_yeah_cong_avoid()
106 		 * at least one RTT sample that wasn't from a delayed ACK.  in tcp_yeah_cong_avoid()
108 		 * then that means we're getting only 1 ACK per RTT, which  in tcp_yeah_cong_avoid()
114 			u32 rtt, queue;  in tcp_yeah_cong_avoid()  local
117 			/* We have enough RTT samples, so, using the Vegas  in tcp_yeah_cong_avoid()
122 			/* Pluck out the RTT we are using for the Vegas  in tcp_yeah_cong_avoid()
123 			 * calculations. This is the min RTT seen during the  in tcp_yeah_cong_avoid()
124 			 * last RTT. Taking the min filters out the effects  in tcp_yeah_cong_avoid()
128 			rtt = yeah->vegas.minRTT;  in tcp_yeah_cong_avoid()
134 			bw *= rtt - yeah->vegas.baseRTT;  in tcp_yeah_cong_avoid()
135 			do_div(bw, rtt);  in tcp_yeah_cong_avoid()
139 			    rtt - yeah->vegas.baseRTT > (yeah->vegas.baseRTT / TCP_YEAH_PHY)) {  in tcp_yeah_cong_avoid()
175 		 * at the end of the next RTT.  in tcp_yeah_cong_avoid()
181 		/* Wipe the slate clean for the next RTT. */  in tcp_yeah_cong_avoid()