1 /* 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 50 struct 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 loss_cwnd; 59 }; 60 61 static unsigned int dctcp_shift_g __read_mostly = 4; /* g = 1/2^4 */ 62 module_param(dctcp_shift_g, uint, 0644); 63 MODULE_PARM_DESC(dctcp_shift_g, "parameter g for updating dctcp_alpha"); 64 65 static unsigned int dctcp_alpha_on_init __read_mostly = DCTCP_MAX_ALPHA; 66 module_param(dctcp_alpha_on_init, uint, 0644); 67 MODULE_PARM_DESC(dctcp_alpha_on_init, "parameter for initial alpha value"); 68 69 static unsigned int dctcp_clamp_alpha_on_loss __read_mostly; 70 module_param(dctcp_clamp_alpha_on_loss, uint, 0644); 71 MODULE_PARM_DESC(dctcp_clamp_alpha_on_loss, 72 "parameter for clamping alpha on loss"); 73 74 static struct tcp_congestion_ops dctcp_reno; 75 76 static void dctcp_reset(const struct tcp_sock *tp, struct dctcp *ca) 77 { 78 ca->next_seq = tp->snd_nxt; 79 80 ca->acked_bytes_ecn = 0; 81 ca->acked_bytes_total = 0; 82 } 83 84 static void dctcp_init(struct sock *sk) 85 { 86 const struct tcp_sock *tp = tcp_sk(sk); 87 88 if ((tp->ecn_flags & TCP_ECN_OK) || 89 (sk->sk_state == TCP_LISTEN || 90 sk->sk_state == TCP_CLOSE)) { 91 struct dctcp *ca = inet_csk_ca(sk); 92 93 ca->prior_snd_una = tp->snd_una; 94 ca->prior_rcv_nxt = tp->rcv_nxt; 95 96 ca->dctcp_alpha = min(dctcp_alpha_on_init, DCTCP_MAX_ALPHA); 97 98 ca->loss_cwnd = 0; 99 ca->ce_state = 0; 100 101 dctcp_reset(tp, ca); 102 return; 103 } 104 105 /* No ECN support? Fall back to Reno. Also need to clear 106 * ECT from sk since it is set during 3WHS for DCTCP. 107 */ 108 inet_csk(sk)->icsk_ca_ops = &dctcp_reno; 109 INET_ECN_dontxmit(sk); 110 } 111 112 static u32 dctcp_ssthresh(struct sock *sk) 113 { 114 struct dctcp *ca = inet_csk_ca(sk); 115 struct tcp_sock *tp = tcp_sk(sk); 116 117 ca->loss_cwnd = tp->snd_cwnd; 118 return max(tp->snd_cwnd - ((tp->snd_cwnd * ca->dctcp_alpha) >> 11U), 2U); 119 } 120 121 /* Minimal DCTP CE state machine: 122 * 123 * S: 0 <- last pkt was non-CE 124 * 1 <- last pkt was CE 125 */ 126 127 static void dctcp_ce_state_0_to_1(struct sock *sk) 128 { 129 struct dctcp *ca = inet_csk_ca(sk); 130 struct tcp_sock *tp = tcp_sk(sk); 131 132 /* State has changed from CE=0 to CE=1 and delayed 133 * ACK has not sent yet. 134 */ 135 if (!ca->ce_state && 136 inet_csk(sk)->icsk_ack.pending & ICSK_ACK_TIMER) { 137 u32 tmp_rcv_nxt; 138 139 /* Save current rcv_nxt. */ 140 tmp_rcv_nxt = tp->rcv_nxt; 141 142 /* Generate previous ack with CE=0. */ 143 tp->ecn_flags &= ~TCP_ECN_DEMAND_CWR; 144 tp->rcv_nxt = ca->prior_rcv_nxt; 145 146 tcp_send_ack(sk); 147 148 /* Recover current rcv_nxt. */ 149 tp->rcv_nxt = tmp_rcv_nxt; 150 } 151 152 ca->prior_rcv_nxt = tp->rcv_nxt; 153 ca->ce_state = 1; 154 155 tp->ecn_flags |= TCP_ECN_DEMAND_CWR; 156 } 157 158 static void dctcp_ce_state_1_to_0(struct sock *sk) 159 { 160 struct dctcp *ca = inet_csk_ca(sk); 161 struct tcp_sock *tp = tcp_sk(sk); 162 163 /* State has changed from CE=1 to CE=0 and delayed 164 * ACK has not sent yet. 165 */ 166 if (ca->ce_state && 167 inet_csk(sk)->icsk_ack.pending & ICSK_ACK_TIMER) { 168 u32 tmp_rcv_nxt; 169 170 /* Save current rcv_nxt. */ 171 tmp_rcv_nxt = tp->rcv_nxt; 172 173 /* Generate previous ack with CE=1. */ 174 tp->ecn_flags |= TCP_ECN_DEMAND_CWR; 175 tp->rcv_nxt = ca->prior_rcv_nxt; 176 177 tcp_send_ack(sk); 178 179 /* Recover current rcv_nxt. */ 180 tp->rcv_nxt = tmp_rcv_nxt; 181 } 182 183 ca->prior_rcv_nxt = tp->rcv_nxt; 184 ca->ce_state = 0; 185 186 tp->ecn_flags &= ~TCP_ECN_DEMAND_CWR; 187 } 188 189 static void dctcp_update_alpha(struct sock *sk, u32 flags) 190 { 191 const struct tcp_sock *tp = tcp_sk(sk); 192 struct dctcp *ca = inet_csk_ca(sk); 193 u32 acked_bytes = tp->snd_una - ca->prior_snd_una; 194 195 /* If ack did not advance snd_una, count dupack as MSS size. 196 * If ack did update window, do not count it at all. 197 */ 198 if (acked_bytes == 0 && !(flags & CA_ACK_WIN_UPDATE)) 199 acked_bytes = inet_csk(sk)->icsk_ack.rcv_mss; 200 if (acked_bytes) { 201 ca->acked_bytes_total += acked_bytes; 202 ca->prior_snd_una = tp->snd_una; 203 204 if (flags & CA_ACK_ECE) 205 ca->acked_bytes_ecn += acked_bytes; 206 } 207 208 /* Expired RTT */ 209 if (!before(tp->snd_una, ca->next_seq)) { 210 u64 bytes_ecn = ca->acked_bytes_ecn; 211 u32 alpha = ca->dctcp_alpha; 212 213 /* alpha = (1 - g) * alpha + g * F */ 214 215 alpha -= min_not_zero(alpha, alpha >> dctcp_shift_g); 216 if (bytes_ecn) { 217 /* If dctcp_shift_g == 1, a 32bit value would overflow 218 * after 8 Mbytes. 219 */ 220 bytes_ecn <<= (10 - dctcp_shift_g); 221 do_div(bytes_ecn, max(1U, ca->acked_bytes_total)); 222 223 alpha = min(alpha + (u32)bytes_ecn, DCTCP_MAX_ALPHA); 224 } 225 /* dctcp_alpha can be read from dctcp_get_info() without 226 * synchro, so we ask compiler to not use dctcp_alpha 227 * as a temporary variable in prior operations. 228 */ 229 WRITE_ONCE(ca->dctcp_alpha, alpha); 230 dctcp_reset(tp, ca); 231 } 232 } 233 234 static void dctcp_state(struct sock *sk, u8 new_state) 235 { 236 if (dctcp_clamp_alpha_on_loss && new_state == TCP_CA_Loss) { 237 struct dctcp *ca = inet_csk_ca(sk); 238 239 /* If this extension is enabled, we clamp dctcp_alpha to 240 * max on packet loss; the motivation is that dctcp_alpha 241 * is an indicator to the extend of congestion and packet 242 * loss is an indicator of extreme congestion; setting 243 * this in practice turned out to be beneficial, and 244 * effectively assumes total congestion which reduces the 245 * window by half. 246 */ 247 ca->dctcp_alpha = DCTCP_MAX_ALPHA; 248 } 249 } 250 251 static void dctcp_cwnd_event(struct sock *sk, enum tcp_ca_event ev) 252 { 253 switch (ev) { 254 case CA_EVENT_ECN_IS_CE: 255 dctcp_ce_state_0_to_1(sk); 256 break; 257 case CA_EVENT_ECN_NO_CE: 258 dctcp_ce_state_1_to_0(sk); 259 break; 260 default: 261 /* Don't care for the rest. */ 262 break; 263 } 264 } 265 266 static size_t dctcp_get_info(struct sock *sk, u32 ext, int *attr, 267 union tcp_cc_info *info) 268 { 269 const struct dctcp *ca = inet_csk_ca(sk); 270 271 /* Fill it also in case of VEGASINFO due to req struct limits. 272 * We can still correctly retrieve it later. 273 */ 274 if (ext & (1 << (INET_DIAG_DCTCPINFO - 1)) || 275 ext & (1 << (INET_DIAG_VEGASINFO - 1))) { 276 memset(&info->dctcp, 0, sizeof(info->dctcp)); 277 if (inet_csk(sk)->icsk_ca_ops != &dctcp_reno) { 278 info->dctcp.dctcp_enabled = 1; 279 info->dctcp.dctcp_ce_state = (u16) ca->ce_state; 280 info->dctcp.dctcp_alpha = ca->dctcp_alpha; 281 info->dctcp.dctcp_ab_ecn = ca->acked_bytes_ecn; 282 info->dctcp.dctcp_ab_tot = ca->acked_bytes_total; 283 } 284 285 *attr = INET_DIAG_DCTCPINFO; 286 return sizeof(info->dctcp); 287 } 288 return 0; 289 } 290 291 static u32 dctcp_cwnd_undo(struct sock *sk) 292 { 293 const struct dctcp *ca = inet_csk_ca(sk); 294 295 return max(tcp_sk(sk)->snd_cwnd, ca->loss_cwnd); 296 } 297 298 static struct tcp_congestion_ops dctcp __read_mostly = { 299 .init = dctcp_init, 300 .in_ack_event = dctcp_update_alpha, 301 .cwnd_event = dctcp_cwnd_event, 302 .ssthresh = dctcp_ssthresh, 303 .cong_avoid = tcp_reno_cong_avoid, 304 .undo_cwnd = dctcp_cwnd_undo, 305 .set_state = dctcp_state, 306 .get_info = dctcp_get_info, 307 .flags = TCP_CONG_NEEDS_ECN, 308 .owner = THIS_MODULE, 309 .name = "dctcp", 310 }; 311 312 static struct tcp_congestion_ops dctcp_reno __read_mostly = { 313 .ssthresh = tcp_reno_ssthresh, 314 .cong_avoid = tcp_reno_cong_avoid, 315 .undo_cwnd = tcp_reno_undo_cwnd, 316 .get_info = dctcp_get_info, 317 .owner = THIS_MODULE, 318 .name = "dctcp-reno", 319 }; 320 321 static int __init dctcp_register(void) 322 { 323 BUILD_BUG_ON(sizeof(struct dctcp) > ICSK_CA_PRIV_SIZE); 324 return tcp_register_congestion_control(&dctcp); 325 } 326 327 static void __exit dctcp_unregister(void) 328 { 329 tcp_unregister_congestion_control(&dctcp); 330 } 331 332 module_init(dctcp_register); 333 module_exit(dctcp_unregister); 334 335 MODULE_AUTHOR("Daniel Borkmann <dborkman@redhat.com>"); 336 MODULE_AUTHOR("Florian Westphal <fw@strlen.de>"); 337 MODULE_AUTHOR("Glenn Judd <glenn.judd@morganstanley.com>"); 338 339 MODULE_LICENSE("GPL v2"); 340 MODULE_DESCRIPTION("DataCenter TCP (DCTCP)"); 341