]>
Commit | Line | Data |
---|---|---|
6d2010ae | 1 | /* |
fe8ab488 | 2 | * Copyright (c) 2010-2014 Apple Inc. All rights reserved. |
6d2010ae A |
3 | * |
4 | * @APPLE_OSREFERENCE_LICENSE_HEADER_START@ | |
5 | * | |
6 | * This file contains Original Code and/or Modifications of Original Code | |
7 | * as defined in and that are subject to the Apple Public Source License | |
8 | * Version 2.0 (the 'License'). You may not use this file except in | |
9 | * compliance with the License. The rights granted to you under the License | |
10 | * may not be used to create, or enable the creation or redistribution of, | |
11 | * unlawful or unlicensed copies of an Apple operating system, or to | |
12 | * circumvent, violate, or enable the circumvention or violation of, any | |
13 | * terms of an Apple operating system software license agreement. | |
14 | * | |
15 | * Please obtain a copy of the License at | |
16 | * http://www.opensource.apple.com/apsl/ and read it before using this file. | |
17 | * | |
18 | * The Original Code and all software distributed under the License are | |
19 | * distributed on an 'AS IS' basis, WITHOUT WARRANTY OF ANY KIND, EITHER | |
20 | * EXPRESS OR IMPLIED, AND APPLE HEREBY DISCLAIMS ALL SUCH WARRANTIES, | |
21 | * INCLUDING WITHOUT LIMITATION, ANY WARRANTIES OF MERCHANTABILITY, | |
22 | * FITNESS FOR A PARTICULAR PURPOSE, QUIET ENJOYMENT OR NON-INFRINGEMENT. | |
23 | * Please see the License for the specific language governing rights and | |
24 | * limitations under the License. | |
25 | * | |
26 | * @APPLE_OSREFERENCE_LICENSE_HEADER_END@ | |
27 | */ | |
28 | #include <sys/param.h> | |
29 | #include <sys/systm.h> | |
30 | #include <sys/kernel.h> | |
31 | #include <sys/protosw.h> | |
32 | #include <sys/mcache.h> | |
33 | #include <sys/sysctl.h> | |
34 | ||
35 | #include <net/route.h> | |
36 | #include <netinet/in.h> | |
37 | #include <netinet/in_systm.h> | |
38 | #include <netinet/ip.h> | |
39 | ||
40 | #if INET6 | |
41 | #include <netinet/ip6.h> | |
42 | #endif | |
43 | #include <netinet/ip_var.h> | |
44 | #include <netinet/tcp.h> | |
45 | #include <netinet/tcp_fsm.h> | |
46 | #include <netinet/tcp_timer.h> | |
47 | #include <netinet/tcp_var.h> | |
48 | #include <netinet/tcpip.h> | |
49 | #include <netinet/tcp_cc.h> | |
50 | ||
51 | #include <libkern/OSAtomic.h> | |
52 | ||
53 | /* This file implements an alternate TCP congestion control algorithm | |
54 | * for background transport developed by LEDBAT working group at IETF and | |
55 | * described in draft: draft-ietf-ledbat-congestion-02 | |
56 | */ | |
57 | ||
58 | int tcp_ledbat_init(struct tcpcb *tp); | |
59 | int tcp_ledbat_cleanup(struct tcpcb *tp); | |
60 | void tcp_ledbat_cwnd_init(struct tcpcb *tp); | |
fe8ab488 | 61 | void tcp_ledbat_congestion_avd(struct tcpcb *tp, struct tcphdr *th); |
6d2010ae | 62 | void tcp_ledbat_ack_rcvd(struct tcpcb *tp, struct tcphdr *th); |
316670eb | 63 | void tcp_ledbat_pre_fr(struct tcpcb *tp); |
6d2010ae A |
64 | void tcp_ledbat_post_fr(struct tcpcb *tp, struct tcphdr *th); |
65 | void tcp_ledbat_after_idle(struct tcpcb *tp); | |
66 | void tcp_ledbat_after_timeout(struct tcpcb *tp); | |
67 | int tcp_ledbat_delay_ack(struct tcpcb *tp, struct tcphdr *th); | |
68 | void tcp_ledbat_switch_cc(struct tcpcb *tp, uint16_t old_cc_index); | |
69 | ||
70 | struct tcp_cc_algo tcp_cc_ledbat = { | |
71 | .name = "ledbat", | |
72 | .init = tcp_ledbat_init, | |
73 | .cleanup = tcp_ledbat_cleanup, | |
74 | .cwnd_init = tcp_ledbat_cwnd_init, | |
fe8ab488 | 75 | .congestion_avd = tcp_ledbat_congestion_avd, |
6d2010ae A |
76 | .ack_rcvd = tcp_ledbat_ack_rcvd, |
77 | .pre_fr = tcp_ledbat_pre_fr, | |
78 | .post_fr = tcp_ledbat_post_fr, | |
79 | .after_idle = tcp_ledbat_after_idle, | |
80 | .after_timeout = tcp_ledbat_after_timeout, | |
81 | .delay_ack = tcp_ledbat_delay_ack, | |
82 | .switch_to = tcp_ledbat_switch_cc | |
83 | }; | |
84 | ||
0a7de745 A |
85 | /* Target queuing delay in milliseconds. This includes the processing |
86 | * and scheduling delay on both of the end-hosts. A LEDBAT sender tries | |
6d2010ae | 87 | * to keep queuing delay below this limit. When the queuing delay |
0a7de745 | 88 | * goes above this limit, a LEDBAT sender will start reducing the |
6d2010ae A |
89 | * congestion window. |
90 | * | |
0a7de745 | 91 | * The LEDBAT draft says that target queue delay MUST be 100 ms for |
6d2010ae A |
92 | * inter-operability. |
93 | */ | |
5ba3f43e | 94 | SYSCTL_SKMEM_TCP_INT(OID_AUTO, bg_target_qdelay, CTLFLAG_RW | CTLFLAG_LOCKED, |
0a7de745 | 95 | int, target_qdelay, 100, "Target queuing delay"); |
6d2010ae A |
96 | |
97 | /* Allowed increase and tether are used to place an upper bound on | |
98 | * congestion window based on the amount of data that is outstanding. | |
0a7de745 | 99 | * This will limit the congestion window when the amount of data in |
6d2010ae | 100 | * flight is little because the application is writing to the socket |
0a7de745 | 101 | * intermittently and is preventing the connection from becoming idle . |
6d2010ae A |
102 | * |
103 | * max_allowed_cwnd = allowed_increase + (tether * flight_size) | |
104 | * cwnd = min(cwnd, max_allowed_cwnd) | |
105 | * | |
4b17d6b6 A |
106 | * 'Allowed_increase' parameter is set to 8. If the flight size is zero, then |
107 | * we want the congestion window to be at least 8 packets to reduce the | |
0a7de745 | 108 | * delay induced by delayed ack. This helps when the receiver is acking |
4b17d6b6 | 109 | * more than 2 packets at a time (stretching acks for better performance). |
0a7de745 | 110 | * |
6d2010ae A |
111 | * 'Tether' is also set to 2. We do not want this to limit the growth of cwnd |
112 | * during slow-start. | |
0a7de745 | 113 | */ |
5ba3f43e | 114 | SYSCTL_SKMEM_TCP_INT(OID_AUTO, bg_allowed_increase, CTLFLAG_RW | CTLFLAG_LOCKED, |
0a7de745 A |
115 | int, allowed_increase, 8, |
116 | "Additive constant used to calculate max allowed congestion window"); | |
6d2010ae A |
117 | |
118 | /* Left shift for cwnd to get tether value of 2 */ | |
5ba3f43e | 119 | SYSCTL_SKMEM_TCP_INT(OID_AUTO, bg_tether_shift, CTLFLAG_RW | CTLFLAG_LOCKED, |
0a7de745 | 120 | int, tether_shift, 1, "Tether shift for max allowed congestion window"); |
6d2010ae | 121 | |
0a7de745 | 122 | /* Start with an initial window of 2. This will help to get more accurate |
6d2010ae A |
123 | * minimum RTT measurement in the beginning. It will help to probe |
124 | * the path slowly and will not add to the existing delay if the path is | |
125 | * already congested. Using 2 packets will reduce the delay induced by delayed-ack. | |
126 | */ | |
5ba3f43e | 127 | SYSCTL_SKMEM_TCP_INT(OID_AUTO, bg_ss_fltsz, CTLFLAG_RW | CTLFLAG_LOCKED, |
0a7de745 | 128 | uint32_t, bg_ss_fltsz, 2, "Initial congestion window for background transport"); |
6d2010ae A |
129 | |
130 | extern int rtt_samples_per_slot; | |
131 | ||
0a7de745 A |
132 | static void |
133 | update_cwnd(struct tcpcb *tp, uint32_t incr) | |
134 | { | |
6d2010ae | 135 | uint32_t max_allowed_cwnd = 0, flight_size = 0; |
ecc0ceb4 | 136 | uint32_t base_rtt; |
6d2010ae A |
137 | |
138 | base_rtt = get_base_rtt(tp); | |
139 | ||
140 | /* If we do not have a good RTT measurement yet, increment | |
0a7de745 | 141 | * congestion window by the default value. |
6d2010ae A |
142 | */ |
143 | if (base_rtt == 0 || tp->t_rttcur == 0) { | |
144 | tp->snd_cwnd += incr; | |
145 | goto check_max; | |
146 | } | |
6d2010ae | 147 | |
ecc0ceb4 A |
148 | if (tp->t_rttcur <= (base_rtt + target_qdelay)) { |
149 | /* | |
150 | * Delay decreased or remained the same, we can increase | |
6d2010ae A |
151 | * the congestion window according to RFC 3465. |
152 | * | |
153 | * Move background slow-start threshold to current | |
154 | * congestion window so that the next time (after some idle | |
0a7de745 | 155 | * period), we can attempt to do slow-start till here if there |
6d2010ae A |
156 | * is no increase in rtt |
157 | */ | |
0a7de745 | 158 | if (tp->bg_ssthresh < tp->snd_cwnd) { |
6d2010ae | 159 | tp->bg_ssthresh = tp->snd_cwnd; |
0a7de745 A |
160 | } |
161 | tp->snd_cwnd += incr; | |
6d2010ae | 162 | } else { |
0a7de745 A |
163 | /* In response to an increase in rtt, reduce the congestion |
164 | * window by one-eighth. This will help to yield immediately | |
6d2010ae A |
165 | * to a competing stream. |
166 | */ | |
167 | uint32_t redwin; | |
168 | ||
0a7de745 | 169 | redwin = tp->snd_cwnd >> 3; |
6d2010ae | 170 | tp->snd_cwnd -= redwin; |
0a7de745 | 171 | if (tp->snd_cwnd < bg_ss_fltsz * tp->t_maxseg) { |
6d2010ae | 172 | tp->snd_cwnd = bg_ss_fltsz * tp->t_maxseg; |
0a7de745 | 173 | } |
6d2010ae | 174 | |
0a7de745 | 175 | /* Lower background slow-start threshold so that the connection |
6d2010ae A |
176 | * will go into congestion avoidance phase |
177 | */ | |
0a7de745 | 178 | if (tp->bg_ssthresh > tp->snd_cwnd) { |
6d2010ae | 179 | tp->bg_ssthresh = tp->snd_cwnd; |
0a7de745 | 180 | } |
6d2010ae A |
181 | } |
182 | check_max: | |
183 | /* Calculate the outstanding flight size and restrict the | |
184 | * congestion window to a factor of flight size. | |
185 | */ | |
186 | flight_size = tp->snd_max - tp->snd_una; | |
187 | ||
0a7de745 A |
188 | max_allowed_cwnd = (allowed_increase * tp->t_maxseg) |
189 | + (flight_size << tether_shift); | |
6d2010ae A |
190 | tp->snd_cwnd = min(tp->snd_cwnd, max_allowed_cwnd); |
191 | return; | |
192 | } | |
193 | ||
0a7de745 A |
194 | int |
195 | tcp_ledbat_init(struct tcpcb *tp) | |
196 | { | |
6d2010ae A |
197 | #pragma unused(tp) |
198 | OSIncrementAtomic((volatile SInt32 *)&tcp_cc_ledbat.num_sockets); | |
199 | return 0; | |
200 | } | |
201 | ||
0a7de745 A |
202 | int |
203 | tcp_ledbat_cleanup(struct tcpcb *tp) | |
204 | { | |
6d2010ae A |
205 | #pragma unused(tp) |
206 | OSDecrementAtomic((volatile SInt32 *)&tcp_cc_ledbat.num_sockets); | |
207 | return 0; | |
208 | } | |
209 | ||
0a7de745 A |
210 | /* Initialize the congestion window for a connection |
211 | * | |
6d2010ae A |
212 | */ |
213 | ||
214 | void | |
0a7de745 A |
215 | tcp_ledbat_cwnd_init(struct tcpcb *tp) |
216 | { | |
6d2010ae A |
217 | tp->snd_cwnd = tp->t_maxseg * bg_ss_fltsz; |
218 | tp->bg_ssthresh = tp->snd_ssthresh; | |
219 | } | |
220 | ||
0a7de745 A |
221 | /* Function to handle an in-sequence ack which is fast-path processing |
222 | * of an in sequence ack in tcp_input function (called as header prediction). | |
6d2010ae A |
223 | * This gets called only during congestion avoidance phase. |
224 | */ | |
225 | void | |
0a7de745 A |
226 | tcp_ledbat_congestion_avd(struct tcpcb *tp, struct tcphdr *th) |
227 | { | |
6d2010ae A |
228 | int acked = 0; |
229 | u_int32_t incr = 0; | |
230 | ||
39236c6e | 231 | acked = BYTES_ACKED(th, tp); |
6d2010ae A |
232 | tp->t_bytes_acked += acked; |
233 | if (tp->t_bytes_acked > tp->snd_cwnd) { | |
234 | tp->t_bytes_acked -= tp->snd_cwnd; | |
235 | incr = tp->t_maxseg; | |
236 | } | |
237 | ||
238 | if (tp->snd_cwnd < tp->snd_wnd && incr > 0) { | |
239 | update_cwnd(tp, incr); | |
240 | } | |
241 | } | |
242 | /* Function to process an ack. | |
243 | */ | |
244 | void | |
0a7de745 A |
245 | tcp_ledbat_ack_rcvd(struct tcpcb *tp, struct tcphdr *th) |
246 | { | |
6d2010ae A |
247 | /* |
248 | * RFC 3465 - Appropriate Byte Counting. | |
249 | * | |
250 | * If the window is currently less than ssthresh, | |
251 | * open the window by the number of bytes ACKed by | |
252 | * the last ACK, however clamp the window increase | |
253 | * to an upper limit "L". | |
254 | * | |
255 | * In congestion avoidance phase, open the window by | |
256 | * one segment each time "bytes_acked" grows to be | |
257 | * greater than or equal to the congestion window. | |
258 | */ | |
259 | ||
39037602 A |
260 | u_int cw = tp->snd_cwnd; |
261 | u_int incr = tp->t_maxseg; | |
6d2010ae A |
262 | int acked = 0; |
263 | ||
39236c6e | 264 | acked = BYTES_ACKED(th, tp); |
6d2010ae A |
265 | tp->t_bytes_acked += acked; |
266 | if (cw >= tp->bg_ssthresh) { | |
267 | /* congestion-avoidance */ | |
268 | if (tp->t_bytes_acked < cw) { | |
269 | /* No need to increase yet. */ | |
270 | incr = 0; | |
271 | } | |
272 | } else { | |
273 | /* | |
274 | * If the user explicitly enables RFC3465 | |
275 | * use 2*SMSS for the "L" param. Otherwise | |
276 | * use the more conservative 1*SMSS. | |
277 | * | |
278 | * (See RFC 3465 2.3 Choosing the Limit) | |
279 | */ | |
280 | u_int abc_lim; | |
281 | ||
282 | abc_lim = (tcp_do_rfc3465_lim2 && | |
0a7de745 | 283 | tp->snd_nxt == tp->snd_max) ? incr * 2 : incr; |
6d2010ae A |
284 | |
285 | incr = lmin(acked, abc_lim); | |
286 | } | |
0a7de745 | 287 | if (tp->t_bytes_acked >= cw) { |
6d2010ae | 288 | tp->t_bytes_acked -= cw; |
0a7de745 A |
289 | } |
290 | if (incr > 0) { | |
6d2010ae | 291 | update_cwnd(tp, incr); |
0a7de745 | 292 | } |
6d2010ae A |
293 | } |
294 | ||
295 | void | |
0a7de745 A |
296 | tcp_ledbat_pre_fr(struct tcpcb *tp) |
297 | { | |
6d2010ae A |
298 | uint32_t win; |
299 | ||
0a7de745 A |
300 | win = min(tp->snd_wnd, tp->snd_cwnd) / |
301 | 2 / tp->t_maxseg; | |
302 | if (win < 2) { | |
6d2010ae | 303 | win = 2; |
0a7de745 A |
304 | } |
305 | tp->snd_ssthresh = win * tp->t_maxseg; | |
306 | if (tp->bg_ssthresh > tp->snd_ssthresh) { | |
6d2010ae | 307 | tp->bg_ssthresh = tp->snd_ssthresh; |
0a7de745 | 308 | } |
316670eb A |
309 | |
310 | tcp_cc_resize_sndbuf(tp); | |
6d2010ae A |
311 | } |
312 | ||
313 | void | |
0a7de745 A |
314 | tcp_ledbat_post_fr(struct tcpcb *tp, struct tcphdr *th) |
315 | { | |
6d2010ae A |
316 | int32_t ss; |
317 | ||
318 | ss = tp->snd_max - th->th_ack; | |
319 | ||
320 | /* | |
321 | * Complete ack. Inflate the congestion window to | |
322 | * ssthresh and exit fast recovery. | |
323 | * | |
324 | * Window inflation should have left us with approx. | |
325 | * snd_ssthresh outstanding data. But in case we | |
326 | * would be inclined to send a burst, better to do | |
327 | * it via the slow start mechanism. | |
39236c6e | 328 | * |
0a7de745 A |
329 | * If the flight size is zero, then make congestion |
330 | * window to be worth at least 2 segments to avoid | |
39236c6e | 331 | * delayed acknowledgement (draft-ietf-tcpm-rfc3782-bis-05). |
6d2010ae | 332 | */ |
0a7de745 | 333 | if (ss < (int32_t)tp->snd_ssthresh) { |
39236c6e | 334 | tp->snd_cwnd = max(ss, tp->t_maxseg) + tp->t_maxseg; |
0a7de745 | 335 | } else { |
6d2010ae | 336 | tp->snd_cwnd = tp->snd_ssthresh; |
0a7de745 | 337 | } |
6d2010ae A |
338 | tp->t_bytes_acked = 0; |
339 | } | |
340 | ||
341 | /* | |
342 | * Function to handle connections that have been idle for | |
343 | * some time. Slow start to get ack "clock" running again. | |
344 | * Clear base history after idle time. | |
345 | */ | |
346 | void | |
0a7de745 A |
347 | tcp_ledbat_after_idle(struct tcpcb *tp) |
348 | { | |
6d2010ae A |
349 | /* Reset the congestion window */ |
350 | tp->snd_cwnd = tp->t_maxseg * bg_ss_fltsz; | |
351 | } | |
352 | ||
0a7de745 | 353 | /* Function to change the congestion window when the retransmit |
6d2010ae A |
354 | * timer fires. The behavior is the same as that for best-effort |
355 | * TCP, reduce congestion window to one segment and start probing | |
356 | * the link using "slow start". The slow start threshold is set | |
357 | * to half of the current window. Lower the background slow start | |
358 | * threshold also. | |
359 | */ | |
360 | void | |
0a7de745 A |
361 | tcp_ledbat_after_timeout(struct tcpcb *tp) |
362 | { | |
363 | if (tp->t_state >= TCPS_ESTABLISHED) { | |
6d2010ae | 364 | u_int win = min(tp->snd_wnd, tp->snd_cwnd) / 2 / tp->t_maxseg; |
0a7de745 | 365 | if (win < 2) { |
6d2010ae | 366 | win = 2; |
0a7de745 | 367 | } |
6d2010ae | 368 | tp->snd_ssthresh = win * tp->t_maxseg; |
6d2010ae | 369 | |
0a7de745 | 370 | if (tp->bg_ssthresh > tp->snd_ssthresh) { |
6d2010ae | 371 | tp->bg_ssthresh = tp->snd_ssthresh; |
0a7de745 | 372 | } |
316670eb | 373 | |
39236c6e | 374 | tp->snd_cwnd = tp->t_maxseg; |
316670eb | 375 | tcp_cc_resize_sndbuf(tp); |
6d2010ae A |
376 | } |
377 | } | |
378 | ||
379 | /* | |
380 | * Indicate whether this ack should be delayed. | |
381 | * We can delay the ack if: | |
382 | * - our last ack wasn't a 0-sized window. | |
0a7de745 A |
383 | * - the peer hasn't sent us a TH_PUSH data packet: if he did, take this |
384 | * as a clue that we need to ACK without any delay. This helps higher | |
385 | * level protocols who won't send us more data even if the window is | |
386 | * open because their last "segment" hasn't been ACKed | |
6d2010ae | 387 | * Otherwise the receiver will ack every other full-sized segment or when the |
0a7de745 | 388 | * delayed ack timer fires. This will help to generate better rtt estimates for |
6d2010ae | 389 | * the other end if it is a ledbat sender. |
0a7de745 | 390 | * |
6d2010ae A |
391 | */ |
392 | ||
393 | int | |
0a7de745 A |
394 | tcp_ledbat_delay_ack(struct tcpcb *tp, struct tcphdr *th) |
395 | { | |
6d2010ae | 396 | if ((tp->t_flags & TF_RXWIN0SENT) == 0 && |
0a7de745 A |
397 | (th->th_flags & TH_PUSH) == 0 && (tp->t_unacksegs == 1)) { |
398 | return 1; | |
399 | } | |
400 | return 0; | |
6d2010ae A |
401 | } |
402 | ||
403 | /* Change a connection to use ledbat. First, lower bg_ssthresh value | |
0a7de745 | 404 | * if it needs to be. |
6d2010ae A |
405 | */ |
406 | void | |
0a7de745 A |
407 | tcp_ledbat_switch_cc(struct tcpcb *tp, uint16_t old_cc_index) |
408 | { | |
6d2010ae A |
409 | #pragma unused(old_cc_index) |
410 | uint32_t cwnd; | |
411 | ||
0a7de745 | 412 | if (tp->bg_ssthresh == 0 || tp->bg_ssthresh > tp->snd_ssthresh) { |
6d2010ae | 413 | tp->bg_ssthresh = tp->snd_ssthresh; |
0a7de745 | 414 | } |
6d2010ae A |
415 | |
416 | cwnd = min(tp->snd_wnd, tp->snd_cwnd); | |
417 | ||
0a7de745 | 418 | if (tp->snd_cwnd > tp->bg_ssthresh) { |
6d2010ae | 419 | cwnd = cwnd / tp->t_maxseg; |
0a7de745 | 420 | } else { |
6d2010ae | 421 | cwnd = cwnd / 2 / tp->t_maxseg; |
0a7de745 | 422 | } |
6d2010ae | 423 | |
0a7de745 | 424 | if (cwnd < bg_ss_fltsz) { |
6d2010ae | 425 | cwnd = bg_ss_fltsz; |
0a7de745 | 426 | } |
6d2010ae A |
427 | |
428 | tp->snd_cwnd = cwnd * tp->t_maxseg; | |
429 | tp->t_bytes_acked = 0; | |
430 | ||
431 | OSIncrementAtomic((volatile SInt32 *)&tcp_cc_ledbat.num_sockets); | |
432 | } |