1 // SPDX-License-Identifier: GPL-2.0-or-later 1
2 /* DataCenter TCP (DCTCP) congestion control.
3 *
4 * http://simula.stanford.edu/~alizade/Site/DC
5 *
6 * This is an implementation of DCTCP over Ren
7 * TCP congestion control algorithm designed f
8 * leverages Explicit Congestion Notification
9 * provide multi-bit feedback to the end hosts
10 * the following three data center transport r
11 *
12 * - High burst tolerance (incast due to part
13 * - Low latency (short flows, queries)
14 * - High throughput (continuous data updates
15 * with commodity shallow buffered switches
16 *
17 * The algorithm is described in detail in the
18 *
19 * 1) Mohammad Alizadeh, Albert Greenberg, Dav
20 * Parveen Patel, Balaji Prabhakar, Sudipta
21 * "Data Center TCP (DCTCP)", Data Center
22 * Proc. ACM SIGCOMM, New Delhi, 2010.
23 * http://simula.stanford.edu/~alizade/Site/
24 *
25 * 2) Mohammad Alizadeh, Adel Javanmard, and B
26 * "Analysis of DCTCP: Stability, Converg
27 * Proc. ACM SIGMETRICS, San Jose, 2011.
28 * http://simula.stanford.edu/~alizade/Site/
29 *
30 * Initial prototype from Abdul Kabbani, Masat
31 *
32 * Authors:
33 *
34 * Daniel Borkmann <dborkman@redhat.com>
35 * Florian Westphal <fw@strlen.de>
36 * Glenn Judd <glenn.judd@morganstanley.c
37 */
38
39 #include <linux/btf.h>
40 #include <linux/btf_ids.h>
41 #include <linux/module.h>
42 #include <linux/mm.h>
43 #include <net/tcp.h>
44 #include <linux/inet_diag.h>
45 #include "tcp_dctcp.h"
46
47 #define DCTCP_MAX_ALPHA 1024U
48
49 struct dctcp {
50 u32 old_delivered;
51 u32 old_delivered_ce;
52 u32 prior_rcv_nxt;
53 u32 dctcp_alpha;
54 u32 next_seq;
55 u32 ce_state;
56 u32 loss_cwnd;
57 struct tcp_plb_state plb;
58 };
59
60 static unsigned int dctcp_shift_g __read_mostl
61
62 static int dctcp_shift_g_set(const char *val,
63 {
64 return param_set_uint_minmax(val, kp,
65 }
66
67 static const struct kernel_param_ops dctcp_shi
68 .set = dctcp_shift_g_set,
69 .get = param_get_uint,
70 };
71
72 module_param_cb(dctcp_shift_g, &dctcp_shift_g_
73 MODULE_PARM_DESC(dctcp_shift_g, "parameter g f
74
75 static unsigned int dctcp_alpha_on_init __read
76 module_param(dctcp_alpha_on_init, uint, 0644);
77 MODULE_PARM_DESC(dctcp_alpha_on_init, "paramet
78
79 static struct tcp_congestion_ops dctcp_reno;
80
81 static void dctcp_reset(const struct tcp_sock
82 {
83 ca->next_seq = tp->snd_nxt;
84
85 ca->old_delivered = tp->delivered;
86 ca->old_delivered_ce = tp->delivered_c
87 }
88
89 __bpf_kfunc static void dctcp_init(struct sock
90 {
91 const struct tcp_sock *tp = tcp_sk(sk)
92
93 if ((tp->ecn_flags & TCP_ECN_OK) ||
94 (sk->sk_state == TCP_LISTEN ||
95 sk->sk_state == TCP_CLOSE)) {
96 struct dctcp *ca = inet_csk_ca
97
98 ca->prior_rcv_nxt = tp->rcv_nx
99
100 ca->dctcp_alpha = min(dctcp_al
101
102 ca->loss_cwnd = 0;
103 ca->ce_state = 0;
104
105 dctcp_reset(tp, ca);
106 tcp_plb_init(sk, &ca->plb);
107
108 return;
109 }
110
111 /* No ECN support? Fall back to Reno.
112 * ECT from sk since it is set during
113 */
114 inet_csk(sk)->icsk_ca_ops = &dctcp_ren
115 INET_ECN_dontxmit(sk);
116 }
117
118 __bpf_kfunc static u32 dctcp_ssthresh(struct s
119 {
120 struct dctcp *ca = inet_csk_ca(sk);
121 struct tcp_sock *tp = tcp_sk(sk);
122
123 ca->loss_cwnd = tcp_snd_cwnd(tp);
124 return max(tcp_snd_cwnd(tp) - ((tcp_sn
125 }
126
127 __bpf_kfunc static void dctcp_update_alpha(str
128 {
129 const struct tcp_sock *tp = tcp_sk(sk)
130 struct dctcp *ca = inet_csk_ca(sk);
131
132 /* Expired RTT */
133 if (!before(tp->snd_una, ca->next_seq)
134 u32 delivered = tp->delivered
135 u32 delivered_ce = tp->deliver
136 u32 alpha = ca->dctcp_alpha;
137 u32 ce_ratio = 0;
138
139 if (delivered > 0) {
140 /* dctcp_alpha keeps E
141 * packets. Because of
142 * be slow so we use c
143 * measure of congesti
144 * ECN marked packets
145 */
146 if (delivered_ce > 0)
147 ce_ratio = (de
148 tcp_plb_update_state(s
149 tcp_plb_check_rehash(s
150 }
151
152 /* alpha = (1 - g) * alpha + g
153
154 alpha -= min_not_zero(alpha, a
155 if (delivered_ce) {
156
157 /* If dctcp_shift_g ==
158 * after 8 M packets.
159 */
160 delivered_ce <<= (10 -
161 delivered_ce /= max(1U
162
163 alpha = min(alpha + de
164 }
165 /* dctcp_alpha can be read fro
166 * synchro, so we ask compiler
167 * as a temporary variable in
168 */
169 WRITE_ONCE(ca->dctcp_alpha, al
170 dctcp_reset(tp, ca);
171 }
172 }
173
174 static void dctcp_react_to_loss(struct sock *s
175 {
176 struct dctcp *ca = inet_csk_ca(sk);
177 struct tcp_sock *tp = tcp_sk(sk);
178
179 ca->loss_cwnd = tcp_snd_cwnd(tp);
180 tp->snd_ssthresh = max(tcp_snd_cwnd(tp
181 }
182
183 __bpf_kfunc static void dctcp_state(struct soc
184 {
185 if (new_state == TCP_CA_Recovery &&
186 new_state != inet_csk(sk)->icsk_ca
187 dctcp_react_to_loss(sk);
188 /* We handle RTO in dctcp_cwnd_event t
189 * one loss-adjustment per RTT.
190 */
191 }
192
193 __bpf_kfunc static void dctcp_cwnd_event(struc
194 {
195 struct dctcp *ca = inet_csk_ca(sk);
196
197 switch (ev) {
198 case CA_EVENT_ECN_IS_CE:
199 case CA_EVENT_ECN_NO_CE:
200 dctcp_ece_ack_update(sk, ev, &
201 break;
202 case CA_EVENT_LOSS:
203 tcp_plb_update_state_upon_rto(
204 dctcp_react_to_loss(sk);
205 break;
206 case CA_EVENT_TX_START:
207 tcp_plb_check_rehash(sk, &ca->
208 break;
209 default:
210 /* Don't care for the rest. */
211 break;
212 }
213 }
214
215 static size_t dctcp_get_info(struct sock *sk,
216 union tcp_cc_info
217 {
218 const struct dctcp *ca = inet_csk_ca(s
219 const struct tcp_sock *tp = tcp_sk(sk)
220
221 /* Fill it also in case of VEGASINFO d
222 * We can still correctly retrieve it
223 */
224 if (ext & (1 << (INET_DIAG_DCTCPINFO -
225 ext & (1 << (INET_DIAG_VEGASINFO -
226 memset(&info->dctcp, 0, sizeof
227 if (inet_csk(sk)->icsk_ca_ops
228 info->dctcp.dctcp_enab
229 info->dctcp.dctcp_ce_s
230 info->dctcp.dctcp_alph
231 info->dctcp.dctcp_ab_e
232
233 info->dctcp.dctcp_ab_t
234
235 }
236
237 *attr = INET_DIAG_DCTCPINFO;
238 return sizeof(info->dctcp);
239 }
240 return 0;
241 }
242
243 __bpf_kfunc static u32 dctcp_cwnd_undo(struct
244 {
245 const struct dctcp *ca = inet_csk_ca(s
246 struct tcp_sock *tp = tcp_sk(sk);
247
248 return max(tcp_snd_cwnd(tp), ca->loss_
249 }
250
251 static struct tcp_congestion_ops dctcp __read_
252 .init = dctcp_init,
253 .in_ack_event = dctcp_update_alpha,
254 .cwnd_event = dctcp_cwnd_event,
255 .ssthresh = dctcp_ssthresh,
256 .cong_avoid = tcp_reno_cong_avoid,
257 .undo_cwnd = dctcp_cwnd_undo,
258 .set_state = dctcp_state,
259 .get_info = dctcp_get_info,
260 .flags = TCP_CONG_NEEDS_ECN,
261 .owner = THIS_MODULE,
262 .name = "dctcp",
263 };
264
265 static struct tcp_congestion_ops dctcp_reno __
266 .ssthresh = tcp_reno_ssthresh,
267 .cong_avoid = tcp_reno_cong_avoid,
268 .undo_cwnd = tcp_reno_undo_cwnd,
269 .get_info = dctcp_get_info,
270 .owner = THIS_MODULE,
271 .name = "dctcp-reno",
272 };
273
274 BTF_KFUNCS_START(tcp_dctcp_check_kfunc_ids)
275 BTF_ID_FLAGS(func, dctcp_init)
276 BTF_ID_FLAGS(func, dctcp_update_alpha)
277 BTF_ID_FLAGS(func, dctcp_cwnd_event)
278 BTF_ID_FLAGS(func, dctcp_ssthresh)
279 BTF_ID_FLAGS(func, dctcp_cwnd_undo)
280 BTF_ID_FLAGS(func, dctcp_state)
281 BTF_KFUNCS_END(tcp_dctcp_check_kfunc_ids)
282
283 static const struct btf_kfunc_id_set tcp_dctcp
284 .owner = THIS_MODULE,
285 .set = &tcp_dctcp_check_kfunc_ids,
286 };
287
288 static int __init dctcp_register(void)
289 {
290 int ret;
291
292 BUILD_BUG_ON(sizeof(struct dctcp) > IC
293
294 ret = register_btf_kfunc_id_set(BPF_PR
295 if (ret < 0)
296 return ret;
297 return tcp_register_congestion_control
298 }
299
300 static void __exit dctcp_unregister(void)
301 {
302 tcp_unregister_congestion_control(&dct
303 }
304
305 module_init(dctcp_register);
306 module_exit(dctcp_unregister);
307
308 MODULE_AUTHOR("Daniel Borkmann <dborkman@redha
309 MODULE_AUTHOR("Florian Westphal <fw@strlen.de>
310 MODULE_AUTHOR("Glenn Judd <glenn.judd@morganst
311
312 MODULE_LICENSE("GPL v2");
313 MODULE_DESCRIPTION("DataCenter TCP (DCTCP)");
314
Linux® is a registered trademark of Linus Torvalds in the United States and other countries.
TOMOYO® is a registered trademark of NTT DATA CORPORATION.