tcp_dctcp.c 7.9 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273
  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. #include <linux/module.h>
  43. #include <linux/mm.h>
  44. #include <net/tcp.h>
  45. #include <linux/inet_diag.h>
  46. #include "tcp_dctcp.h"
  47. #define DCTCP_MAX_ALPHA 1024U
  48. struct dctcp {
  49. u32 acked_bytes_ecn;
  50. u32 acked_bytes_total;
  51. u32 prior_snd_una;
  52. u32 prior_rcv_nxt;
  53. u32 dctcp_alpha;
  54. u32 next_seq;
  55. u32 ce_state;
  56. u32 loss_cwnd;
  57. };
  58. static unsigned int dctcp_shift_g __read_mostly = 4; /* g = 1/2^4 */
  59. module_param(dctcp_shift_g, uint, 0644);
  60. MODULE_PARM_DESC(dctcp_shift_g, "parameter g for updating dctcp_alpha");
  61. static unsigned int dctcp_alpha_on_init __read_mostly = DCTCP_MAX_ALPHA;
  62. module_param(dctcp_alpha_on_init, uint, 0644);
  63. MODULE_PARM_DESC(dctcp_alpha_on_init, "parameter for initial alpha value");
  64. static unsigned int dctcp_clamp_alpha_on_loss __read_mostly;
  65. module_param(dctcp_clamp_alpha_on_loss, uint, 0644);
  66. MODULE_PARM_DESC(dctcp_clamp_alpha_on_loss,
  67. "parameter for clamping alpha on loss");
  68. static struct tcp_congestion_ops dctcp_reno;
  69. static void dctcp_reset(const struct tcp_sock *tp, struct dctcp *ca)
  70. {
  71. ca->next_seq = tp->snd_nxt;
  72. ca->acked_bytes_ecn = 0;
  73. ca->acked_bytes_total = 0;
  74. }
  75. static void dctcp_init(struct sock *sk)
  76. {
  77. const struct tcp_sock *tp = tcp_sk(sk);
  78. if ((tp->ecn_flags & TCP_ECN_OK) ||
  79. (sk->sk_state == TCP_LISTEN ||
  80. sk->sk_state == TCP_CLOSE)) {
  81. struct dctcp *ca = inet_csk_ca(sk);
  82. ca->prior_snd_una = tp->snd_una;
  83. ca->prior_rcv_nxt = tp->rcv_nxt;
  84. ca->dctcp_alpha = min(dctcp_alpha_on_init, DCTCP_MAX_ALPHA);
  85. ca->loss_cwnd = 0;
  86. ca->ce_state = 0;
  87. dctcp_reset(tp, ca);
  88. return;
  89. }
  90. /* No ECN support? Fall back to Reno. Also need to clear
  91. * ECT from sk since it is set during 3WHS for DCTCP.
  92. */
  93. inet_csk(sk)->icsk_ca_ops = &dctcp_reno;
  94. INET_ECN_dontxmit(sk);
  95. }
  96. static u32 dctcp_ssthresh(struct sock *sk)
  97. {
  98. struct dctcp *ca = inet_csk_ca(sk);
  99. struct tcp_sock *tp = tcp_sk(sk);
  100. ca->loss_cwnd = tp->snd_cwnd;
  101. return max(tp->snd_cwnd - ((tp->snd_cwnd * ca->dctcp_alpha) >> 11U), 2U);
  102. }
  103. static void dctcp_update_alpha(struct sock *sk, u32 flags)
  104. {
  105. const struct tcp_sock *tp = tcp_sk(sk);
  106. struct dctcp *ca = inet_csk_ca(sk);
  107. u32 acked_bytes = tp->snd_una - ca->prior_snd_una;
  108. /* If ack did not advance snd_una, count dupack as MSS size.
  109. * If ack did update window, do not count it at all.
  110. */
  111. if (acked_bytes == 0 && !(flags & CA_ACK_WIN_UPDATE))
  112. acked_bytes = inet_csk(sk)->icsk_ack.rcv_mss;
  113. if (acked_bytes) {
  114. ca->acked_bytes_total += acked_bytes;
  115. ca->prior_snd_una = tp->snd_una;
  116. if (flags & CA_ACK_ECE)
  117. ca->acked_bytes_ecn += acked_bytes;
  118. }
  119. /* Expired RTT */
  120. if (!before(tp->snd_una, ca->next_seq)) {
  121. u64 bytes_ecn = ca->acked_bytes_ecn;
  122. u32 alpha = ca->dctcp_alpha;
  123. /* alpha = (1 - g) * alpha + g * F */
  124. alpha -= min_not_zero(alpha, alpha >> dctcp_shift_g);
  125. if (bytes_ecn) {
  126. /* If dctcp_shift_g == 1, a 32bit value would overflow
  127. * after 8 Mbytes.
  128. */
  129. bytes_ecn <<= (10 - dctcp_shift_g);
  130. do_div(bytes_ecn, max(1U, ca->acked_bytes_total));
  131. alpha = min(alpha + (u32)bytes_ecn, DCTCP_MAX_ALPHA);
  132. }
  133. /* dctcp_alpha can be read from dctcp_get_info() without
  134. * synchro, so we ask compiler to not use dctcp_alpha
  135. * as a temporary variable in prior operations.
  136. */
  137. WRITE_ONCE(ca->dctcp_alpha, alpha);
  138. dctcp_reset(tp, ca);
  139. }
  140. }
  141. static void dctcp_state(struct sock *sk, u8 new_state)
  142. {
  143. if (dctcp_clamp_alpha_on_loss && new_state == TCP_CA_Loss) {
  144. struct dctcp *ca = inet_csk_ca(sk);
  145. /* If this extension is enabled, we clamp dctcp_alpha to
  146. * max on packet loss; the motivation is that dctcp_alpha
  147. * is an indicator to the extend of congestion and packet
  148. * loss is an indicator of extreme congestion; setting
  149. * this in practice turned out to be beneficial, and
  150. * effectively assumes total congestion which reduces the
  151. * window by half.
  152. */
  153. ca->dctcp_alpha = DCTCP_MAX_ALPHA;
  154. }
  155. }
  156. static void dctcp_cwnd_event(struct sock *sk, enum tcp_ca_event ev)
  157. {
  158. struct dctcp *ca = inet_csk_ca(sk);
  159. switch (ev) {
  160. case CA_EVENT_ECN_IS_CE:
  161. case CA_EVENT_ECN_NO_CE:
  162. dctcp_ece_ack_update(sk, ev, &ca->prior_rcv_nxt, &ca->ce_state);
  163. break;
  164. default:
  165. /* Don't care for the rest. */
  166. break;
  167. }
  168. }
  169. static size_t dctcp_get_info(struct sock *sk, u32 ext, int *attr,
  170. union tcp_cc_info *info)
  171. {
  172. const struct dctcp *ca = inet_csk_ca(sk);
  173. /* Fill it also in case of VEGASINFO due to req struct limits.
  174. * We can still correctly retrieve it later.
  175. */
  176. if (ext & (1 << (INET_DIAG_DCTCPINFO - 1)) ||
  177. ext & (1 << (INET_DIAG_VEGASINFO - 1))) {
  178. memset(&info->dctcp, 0, sizeof(info->dctcp));
  179. if (inet_csk(sk)->icsk_ca_ops != &dctcp_reno) {
  180. info->dctcp.dctcp_enabled = 1;
  181. info->dctcp.dctcp_ce_state = (u16) ca->ce_state;
  182. info->dctcp.dctcp_alpha = ca->dctcp_alpha;
  183. info->dctcp.dctcp_ab_ecn = ca->acked_bytes_ecn;
  184. info->dctcp.dctcp_ab_tot = ca->acked_bytes_total;
  185. }
  186. *attr = INET_DIAG_DCTCPINFO;
  187. return sizeof(info->dctcp);
  188. }
  189. return 0;
  190. }
  191. static u32 dctcp_cwnd_undo(struct sock *sk)
  192. {
  193. const struct dctcp *ca = inet_csk_ca(sk);
  194. return max(tcp_sk(sk)->snd_cwnd, ca->loss_cwnd);
  195. }
  196. static struct tcp_congestion_ops dctcp __read_mostly = {
  197. .init = dctcp_init,
  198. .in_ack_event = dctcp_update_alpha,
  199. .cwnd_event = dctcp_cwnd_event,
  200. .ssthresh = dctcp_ssthresh,
  201. .cong_avoid = tcp_reno_cong_avoid,
  202. .undo_cwnd = dctcp_cwnd_undo,
  203. .set_state = dctcp_state,
  204. .get_info = dctcp_get_info,
  205. .flags = TCP_CONG_NEEDS_ECN,
  206. .owner = THIS_MODULE,
  207. .name = "dctcp",
  208. };
  209. static struct tcp_congestion_ops dctcp_reno __read_mostly = {
  210. .ssthresh = tcp_reno_ssthresh,
  211. .cong_avoid = tcp_reno_cong_avoid,
  212. .undo_cwnd = tcp_reno_undo_cwnd,
  213. .get_info = dctcp_get_info,
  214. .owner = THIS_MODULE,
  215. .name = "dctcp-reno",
  216. };
  217. static int __init dctcp_register(void)
  218. {
  219. BUILD_BUG_ON(sizeof(struct dctcp) > ICSK_CA_PRIV_SIZE);
  220. return tcp_register_congestion_control(&dctcp);
  221. }
  222. static void __exit dctcp_unregister(void)
  223. {
  224. tcp_unregister_congestion_control(&dctcp);
  225. }
  226. module_init(dctcp_register);
  227. module_exit(dctcp_unregister);
  228. MODULE_AUTHOR("Daniel Borkmann <dborkman@redhat.com>");
  229. MODULE_AUTHOR("Florian Westphal <fw@strlen.de>");
  230. MODULE_AUTHOR("Glenn Judd <glenn.judd@morganstanley.com>");
  231. MODULE_LICENSE("GPL v2");
  232. MODULE_DESCRIPTION("DataCenter TCP (DCTCP)");