blob: dd52ccb812ea421ae53eb2fb411076a6404b1342 [file] [log] [blame]
Daniel Borkmanne3118e82014-09-26 22:37:36 +02001/* DataCenter TCP (DCTCP) congestion control.
2 *
3 * http://simula.stanford.edu/~alizade/Site/DCTCP.html
4 *
5 * This is an implementation of DCTCP over Reno, an enhancement to the
6 * TCP congestion control algorithm designed for data centers. DCTCP
7 * leverages Explicit Congestion Notification (ECN) in the network to
8 * provide multi-bit feedback to the end hosts. DCTCP's goal is to meet
9 * the following three data center transport requirements:
10 *
11 * - High burst tolerance (incast due to partition/aggregate)
12 * - Low latency (short flows, queries)
13 * - High throughput (continuous data updates, large file transfers)
14 * with commodity shallow buffered switches
15 *
16 * The algorithm is described in detail in the following two papers:
17 *
18 * 1) Mohammad Alizadeh, Albert Greenberg, David A. Maltz, Jitendra Padhye,
19 * Parveen Patel, Balaji Prabhakar, Sudipta Sengupta, and Murari Sridharan:
20 * "Data Center TCP (DCTCP)", Data Center Networks session
21 * Proc. ACM SIGCOMM, New Delhi, 2010.
22 * http://simula.stanford.edu/~alizade/Site/DCTCP_files/dctcp-final.pdf
23 *
24 * 2) Mohammad Alizadeh, Adel Javanmard, and Balaji Prabhakar:
25 * "Analysis of DCTCP: Stability, Convergence, and Fairness"
26 * Proc. ACM SIGMETRICS, San Jose, 2011.
27 * http://simula.stanford.edu/~alizade/Site/DCTCP_files/dctcp_analysis-full.pdf
28 *
29 * Initial prototype from Abdul Kabbani, Masato Yasuda and Mohammad Alizadeh.
30 *
31 * Authors:
32 *
33 * Daniel Borkmann <dborkman@redhat.com>
34 * Florian Westphal <fw@strlen.de>
35 * Glenn Judd <glenn.judd@morganstanley.com>
36 *
37 * This program is free software; you can redistribute it and/or modify
38 * it under the terms of the GNU General Public License as published by
39 * the Free Software Foundation; either version 2 of the License, or (at
40 * your option) any later version.
41 */
42
43#include <linux/module.h>
44#include <linux/mm.h>
45#include <net/tcp.h>
46#include <linux/inet_diag.h>
47
48#define DCTCP_MAX_ALPHA 1024U
49
50struct dctcp {
51 u32 acked_bytes_ecn;
52 u32 acked_bytes_total;
53 u32 prior_snd_una;
54 u32 prior_rcv_nxt;
55 u32 dctcp_alpha;
56 u32 next_seq;
57 u32 ce_state;
58 u32 delayed_ack_reserved;
Florian Westphalce6dd232016-10-28 18:43:11 +020059 u32 loss_cwnd;
Daniel Borkmanne3118e82014-09-26 22:37:36 +020060};
61
62static unsigned int dctcp_shift_g __read_mostly = 4; /* g = 1/2^4 */
63module_param(dctcp_shift_g, uint, 0644);
64MODULE_PARM_DESC(dctcp_shift_g, "parameter g for updating dctcp_alpha");
65
66static unsigned int dctcp_alpha_on_init __read_mostly = DCTCP_MAX_ALPHA;
67module_param(dctcp_alpha_on_init, uint, 0644);
68MODULE_PARM_DESC(dctcp_alpha_on_init, "parameter for initial alpha value");
69
70static unsigned int dctcp_clamp_alpha_on_loss __read_mostly;
71module_param(dctcp_clamp_alpha_on_loss, uint, 0644);
72MODULE_PARM_DESC(dctcp_clamp_alpha_on_loss,
73 "parameter for clamping alpha on loss");
74
75static struct tcp_congestion_ops dctcp_reno;
76
77static void dctcp_reset(const struct tcp_sock *tp, struct dctcp *ca)
78{
79 ca->next_seq = tp->snd_nxt;
80
81 ca->acked_bytes_ecn = 0;
82 ca->acked_bytes_total = 0;
83}
84
85static void dctcp_init(struct sock *sk)
86{
87 const struct tcp_sock *tp = tcp_sk(sk);
88
89 if ((tp->ecn_flags & TCP_ECN_OK) ||
90 (sk->sk_state == TCP_LISTEN ||
91 sk->sk_state == TCP_CLOSE)) {
92 struct dctcp *ca = inet_csk_ca(sk);
93
94 ca->prior_snd_una = tp->snd_una;
95 ca->prior_rcv_nxt = tp->rcv_nxt;
96
97 ca->dctcp_alpha = min(dctcp_alpha_on_init, DCTCP_MAX_ALPHA);
98
99 ca->delayed_ack_reserved = 0;
Florian Westphalce6dd232016-10-28 18:43:11 +0200100 ca->loss_cwnd = 0;
Daniel Borkmanne3118e82014-09-26 22:37:36 +0200101 ca->ce_state = 0;
102
103 dctcp_reset(tp, ca);
104 return;
105 }
106
107 /* No ECN support? Fall back to Reno. Also need to clear
108 * ECT from sk since it is set during 3WHS for DCTCP.
109 */
110 inet_csk(sk)->icsk_ca_ops = &dctcp_reno;
111 INET_ECN_dontxmit(sk);
112}
113
114static u32 dctcp_ssthresh(struct sock *sk)
115{
Florian Westphalce6dd232016-10-28 18:43:11 +0200116 struct dctcp *ca = inet_csk_ca(sk);
Daniel Borkmanne3118e82014-09-26 22:37:36 +0200117 struct tcp_sock *tp = tcp_sk(sk);
118
Florian Westphalce6dd232016-10-28 18:43:11 +0200119 ca->loss_cwnd = tp->snd_cwnd;
Daniel Borkmanne3118e82014-09-26 22:37:36 +0200120 return max(tp->snd_cwnd - ((tp->snd_cwnd * ca->dctcp_alpha) >> 11U), 2U);
121}
122
123/* Minimal DCTP CE state machine:
124 *
125 * S: 0 <- last pkt was non-CE
126 * 1 <- last pkt was CE
127 */
128
129static void dctcp_ce_state_0_to_1(struct sock *sk)
130{
131 struct dctcp *ca = inet_csk_ca(sk);
132 struct tcp_sock *tp = tcp_sk(sk);
133
Yuchung Cheng87367112018-07-18 13:56:36 -0700134 if (!ca->ce_state) {
135 /* State has changed from CE=0 to CE=1, force an immediate
136 * ACK to reflect the new CE state. If an ACK was delayed,
137 * send that first to reflect the prior CE state.
138 */
139 if (inet_csk(sk)->icsk_ack.pending & ICSK_ACK_TIMER)
140 __tcp_send_ack(sk, ca->prior_rcv_nxt);
141 tcp_enter_quickack_mode(sk);
142 }
Daniel Borkmanne3118e82014-09-26 22:37:36 +0200143
144 ca->prior_rcv_nxt = tp->rcv_nxt;
145 ca->ce_state = 1;
146
147 tp->ecn_flags |= TCP_ECN_DEMAND_CWR;
148}
149
150static void dctcp_ce_state_1_to_0(struct sock *sk)
151{
152 struct dctcp *ca = inet_csk_ca(sk);
153 struct tcp_sock *tp = tcp_sk(sk);
154
Yuchung Cheng87367112018-07-18 13:56:36 -0700155 if (ca->ce_state) {
156 /* State has changed from CE=1 to CE=0, force an immediate
157 * ACK to reflect the new CE state. If an ACK was delayed,
158 * send that first to reflect the prior CE state.
159 */
160 if (inet_csk(sk)->icsk_ack.pending & ICSK_ACK_TIMER)
161 __tcp_send_ack(sk, ca->prior_rcv_nxt);
162 tcp_enter_quickack_mode(sk);
163 }
Daniel Borkmanne3118e82014-09-26 22:37:36 +0200164
165 ca->prior_rcv_nxt = tp->rcv_nxt;
166 ca->ce_state = 0;
167
168 tp->ecn_flags &= ~TCP_ECN_DEMAND_CWR;
169}
170
171static void dctcp_update_alpha(struct sock *sk, u32 flags)
172{
173 const struct tcp_sock *tp = tcp_sk(sk);
174 struct dctcp *ca = inet_csk_ca(sk);
175 u32 acked_bytes = tp->snd_una - ca->prior_snd_una;
176
177 /* If ack did not advance snd_una, count dupack as MSS size.
178 * If ack did update window, do not count it at all.
179 */
180 if (acked_bytes == 0 && !(flags & CA_ACK_WIN_UPDATE))
181 acked_bytes = inet_csk(sk)->icsk_ack.rcv_mss;
182 if (acked_bytes) {
183 ca->acked_bytes_total += acked_bytes;
184 ca->prior_snd_una = tp->snd_una;
185
186 if (flags & CA_ACK_ECE)
187 ca->acked_bytes_ecn += acked_bytes;
188 }
189
190 /* Expired RTT */
191 if (!before(tp->snd_una, ca->next_seq)) {
Eric Dumazetf9c2ff22015-06-10 22:11:17 -0700192 u64 bytes_ecn = ca->acked_bytes_ecn;
193 u32 alpha = ca->dctcp_alpha;
Daniel Borkmanne3118e82014-09-26 22:37:36 +0200194
195 /* alpha = (1 - g) * alpha + g * F */
Daniel Borkmanne3118e82014-09-26 22:37:36 +0200196
Andrew Shewmakerc80dbe02015-10-18 21:59:08 -0700197 alpha -= min_not_zero(alpha, alpha >> dctcp_shift_g);
Eric Dumazetf9c2ff22015-06-10 22:11:17 -0700198 if (bytes_ecn) {
199 /* If dctcp_shift_g == 1, a 32bit value would overflow
200 * after 8 Mbytes.
201 */
202 bytes_ecn <<= (10 - dctcp_shift_g);
203 do_div(bytes_ecn, max(1U, ca->acked_bytes_total));
Daniel Borkmanne3118e82014-09-26 22:37:36 +0200204
Eric Dumazetf9c2ff22015-06-10 22:11:17 -0700205 alpha = min(alpha + (u32)bytes_ecn, DCTCP_MAX_ALPHA);
206 }
207 /* dctcp_alpha can be read from dctcp_get_info() without
208 * synchro, so we ask compiler to not use dctcp_alpha
209 * as a temporary variable in prior operations.
210 */
211 WRITE_ONCE(ca->dctcp_alpha, alpha);
Daniel Borkmanne3118e82014-09-26 22:37:36 +0200212 dctcp_reset(tp, ca);
213 }
214}
215
216static void dctcp_state(struct sock *sk, u8 new_state)
217{
218 if (dctcp_clamp_alpha_on_loss && new_state == TCP_CA_Loss) {
219 struct dctcp *ca = inet_csk_ca(sk);
220
221 /* If this extension is enabled, we clamp dctcp_alpha to
222 * max on packet loss; the motivation is that dctcp_alpha
223 * is an indicator to the extend of congestion and packet
224 * loss is an indicator of extreme congestion; setting
225 * this in practice turned out to be beneficial, and
226 * effectively assumes total congestion which reduces the
227 * window by half.
228 */
229 ca->dctcp_alpha = DCTCP_MAX_ALPHA;
230 }
231}
232
233static void dctcp_update_ack_reserved(struct sock *sk, enum tcp_ca_event ev)
234{
235 struct dctcp *ca = inet_csk_ca(sk);
236
237 switch (ev) {
238 case CA_EVENT_DELAYED_ACK:
239 if (!ca->delayed_ack_reserved)
240 ca->delayed_ack_reserved = 1;
241 break;
242 case CA_EVENT_NON_DELAYED_ACK:
243 if (ca->delayed_ack_reserved)
244 ca->delayed_ack_reserved = 0;
245 break;
246 default:
247 /* Don't care for the rest. */
248 break;
249 }
250}
251
252static void dctcp_cwnd_event(struct sock *sk, enum tcp_ca_event ev)
253{
254 switch (ev) {
255 case CA_EVENT_ECN_IS_CE:
256 dctcp_ce_state_0_to_1(sk);
257 break;
258 case CA_EVENT_ECN_NO_CE:
259 dctcp_ce_state_1_to_0(sk);
260 break;
261 case CA_EVENT_DELAYED_ACK:
262 case CA_EVENT_NON_DELAYED_ACK:
263 dctcp_update_ack_reserved(sk, ev);
264 break;
265 default:
266 /* Don't care for the rest. */
267 break;
268 }
269}
270
Eric Dumazet64f40ff2015-04-28 16:23:48 -0700271static size_t dctcp_get_info(struct sock *sk, u32 ext, int *attr,
272 union tcp_cc_info *info)
Daniel Borkmanne3118e82014-09-26 22:37:36 +0200273{
274 const struct dctcp *ca = inet_csk_ca(sk);
275
276 /* Fill it also in case of VEGASINFO due to req struct limits.
277 * We can still correctly retrieve it later.
278 */
279 if (ext & (1 << (INET_DIAG_DCTCPINFO - 1)) ||
280 ext & (1 << (INET_DIAG_VEGASINFO - 1))) {
Neal Cardwelldcf11582016-06-13 11:20:35 -0400281 memset(&info->dctcp, 0, sizeof(info->dctcp));
Daniel Borkmanne3118e82014-09-26 22:37:36 +0200282 if (inet_csk(sk)->icsk_ca_ops != &dctcp_reno) {
Eric Dumazet64f40ff2015-04-28 16:23:48 -0700283 info->dctcp.dctcp_enabled = 1;
284 info->dctcp.dctcp_ce_state = (u16) ca->ce_state;
285 info->dctcp.dctcp_alpha = ca->dctcp_alpha;
286 info->dctcp.dctcp_ab_ecn = ca->acked_bytes_ecn;
287 info->dctcp.dctcp_ab_tot = ca->acked_bytes_total;
Daniel Borkmanne3118e82014-09-26 22:37:36 +0200288 }
289
Eric Dumazet64f40ff2015-04-28 16:23:48 -0700290 *attr = INET_DIAG_DCTCPINFO;
Neal Cardwelldcf11582016-06-13 11:20:35 -0400291 return sizeof(info->dctcp);
Daniel Borkmanne3118e82014-09-26 22:37:36 +0200292 }
Eric Dumazet521f1cf2015-04-16 18:10:35 -0700293 return 0;
Daniel Borkmanne3118e82014-09-26 22:37:36 +0200294}
295
Florian Westphalce6dd232016-10-28 18:43:11 +0200296static u32 dctcp_cwnd_undo(struct sock *sk)
297{
298 const struct dctcp *ca = inet_csk_ca(sk);
299
300 return max(tcp_sk(sk)->snd_cwnd, ca->loss_cwnd);
301}
302
Daniel Borkmanne3118e82014-09-26 22:37:36 +0200303static struct tcp_congestion_ops dctcp __read_mostly = {
304 .init = dctcp_init,
305 .in_ack_event = dctcp_update_alpha,
306 .cwnd_event = dctcp_cwnd_event,
307 .ssthresh = dctcp_ssthresh,
308 .cong_avoid = tcp_reno_cong_avoid,
Florian Westphalce6dd232016-10-28 18:43:11 +0200309 .undo_cwnd = dctcp_cwnd_undo,
Daniel Borkmanne3118e82014-09-26 22:37:36 +0200310 .set_state = dctcp_state,
311 .get_info = dctcp_get_info,
312 .flags = TCP_CONG_NEEDS_ECN,
313 .owner = THIS_MODULE,
314 .name = "dctcp",
315};
316
317static struct tcp_congestion_ops dctcp_reno __read_mostly = {
318 .ssthresh = tcp_reno_ssthresh,
319 .cong_avoid = tcp_reno_cong_avoid,
320 .get_info = dctcp_get_info,
321 .owner = THIS_MODULE,
322 .name = "dctcp-reno",
323};
324
325static int __init dctcp_register(void)
326{
327 BUILD_BUG_ON(sizeof(struct dctcp) > ICSK_CA_PRIV_SIZE);
328 return tcp_register_congestion_control(&dctcp);
329}
330
331static void __exit dctcp_unregister(void)
332{
333 tcp_unregister_congestion_control(&dctcp);
334}
335
336module_init(dctcp_register);
337module_exit(dctcp_unregister);
338
339MODULE_AUTHOR("Daniel Borkmann <dborkman@redhat.com>");
340MODULE_AUTHOR("Florian Westphal <fw@strlen.de>");
341MODULE_AUTHOR("Glenn Judd <glenn.judd@morganstanley.com>");
342
343MODULE_LICENSE("GPL v2");
344MODULE_DESCRIPTION("DataCenter TCP (DCTCP)");