1 /*- 2 * Copyright (c) 2009-2013 3 * Swinburne University of Technology, Melbourne, Australia 4 * All rights reserved. 5 * 6 * This software was developed at the Centre for Advanced Internet 7 * Architectures, Swinburne University of Technology, by David Hayes, made 8 * possible in part by a gift from The Cisco University Research Program Fund, 9 * a corporate advised fund of Silicon Valley Community Foundation. Development 10 * and testing were further assisted by a grant from the FreeBSD Foundation. 11 * 12 * Redistribution and use in source and binary forms, with or without 13 * modification, are permitted provided that the following conditions 14 * are met: 15 * 1. Redistributions of source code must retain the above copyright 16 * notice, this list of conditions and the following disclaimer. 17 * 2. Redistributions in binary form must reproduce the above copyright 18 * notice, this list of conditions and the following disclaimer in the 19 * documentation and/or other materials provided with the distribution. 20 * 21 * THIS SOFTWARE IS PROVIDED BY THE AUTHOR AND CONTRIBUTORS ``AS IS'' AND 22 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE 23 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE 24 * ARE DISCLAIMED. IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE LIABLE 25 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL 26 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS 27 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) 28 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT 29 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY 30 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF 31 * SUCH DAMAGE. 32 */ 33 34 /* 35 * CAIA Delay-Gradient (CDG) congestion control algorithm 36 * 37 * An implemention of the delay-gradient congestion control algorithm proposed 38 * in the following paper: 39 * 40 * D. A. Hayes and G. Armitage, "Revisiting TCP Congestion Control using Delay 41 * Gradients", in IFIP Networking, Valencia, Spain, 9-13 May 2011. 42 * 43 * Developed as part of the NewTCP research project at Swinburne University of 44 * Technology's Centre for Advanced Internet Architectures, Melbourne, 45 * Australia. More details are available at: 46 * http://caia.swin.edu.au/urp/newtcp/ 47 */ 48 49 #include <sys/cdefs.h> 50 __FBSDID("$FreeBSD$"); 51 52 #include <sys/param.h> 53 #include <sys/hhook.h> 54 #include <sys/kernel.h> 55 #include <sys/khelp.h> 56 #include <sys/limits.h> 57 #include <sys/lock.h> 58 #include <sys/malloc.h> 59 #include <sys/module.h> 60 #include <sys/queue.h> 61 #include <sys/socket.h> 62 #include <sys/socketvar.h> 63 #include <sys/sysctl.h> 64 #include <sys/systm.h> 65 66 #include <net/if.h> 67 #include <net/vnet.h> 68 69 #include <netinet/cc.h> 70 #include <netinet/tcp_seq.h> 71 #include <netinet/tcp_timer.h> 72 #include <netinet/tcp_var.h> 73 74 #include <netinet/cc/cc_module.h> 75 76 #include <netinet/khelp/h_ertt.h> 77 78 #include <vm/uma.h> 79 80 #define CDG_VERSION "0.1" 81 82 #define CAST_PTR_INT(X) (*((int*)(X))) 83 84 /* Private delay-gradient induced congestion control signal. */ 85 #define CC_CDG_DELAY 0x01000000 86 87 /* NewReno window deflation factor on loss (as a percentage). */ 88 #define RENO_BETA 50 89 90 /* Queue states. */ 91 #define CDG_Q_EMPTY 1 92 #define CDG_Q_RISING 2 93 #define CDG_Q_FALLING 3 94 #define CDG_Q_FULL 4 95 #define CDG_Q_UNKNOWN 9999 96 97 /* Number of bit shifts used in probexp lookup table. */ 98 #define EXP_PREC 15 99 100 /* Largest gradient represented in probexp lookup table. */ 101 #define MAXGRAD 5 102 103 /* 104 * Delay Precision Enhance - number of bit shifts used for qtrend related 105 * integer arithmetic precision. 106 */ 107 #define D_P_E 7 108 109 struct qdiff_sample { 110 long qdiff; 111 STAILQ_ENTRY(qdiff_sample) qdiff_lnk; 112 }; 113 114 struct cdg { 115 long max_qtrend; 116 long min_qtrend; 117 STAILQ_HEAD(minrtts_head, qdiff_sample) qdiffmin_q; 118 STAILQ_HEAD(maxrtts_head, qdiff_sample) qdiffmax_q; 119 long window_incr; 120 /* rttcount for window increase when in congestion avoidance */ 121 long rtt_count; 122 /* maximum measured rtt within an rtt period */ 123 int maxrtt_in_rtt; 124 /* maximum measured rtt within prev rtt period */ 125 int maxrtt_in_prevrtt; 126 /* minimum measured rtt within an rtt period */ 127 int minrtt_in_rtt; 128 /* minimum measured rtt within prev rtt period */ 129 int minrtt_in_prevrtt; 130 /* consecutive congestion episode counter */ 131 uint32_t consec_cong_cnt; 132 /* when tracking a new reno type loss window */ 133 uint32_t shadow_w; 134 /* maximum number of samples in the moving average queue */ 135 int sample_q_size; 136 /* number of samples in the moving average queue */ 137 int num_samples; 138 /* estimate of the queue state of the path */ 139 int queue_state; 140 }; 141 142 /* 143 * Lookup table for: 144 * (1 - exp(-x)) << EXP_PREC, where x = [0,MAXGRAD] in 2^-7 increments 145 * 146 * Note: probexp[0] is set to 10 (not 0) as a safety for very low increase 147 * gradients. 148 */ 149 static const int probexp[641] = { 150 10,255,508,759,1008,1255,1501,1744,1985,2225,2463,2698,2932,3165,3395,3624, 151 3850,4075,4299,4520,4740,4958,5175,5389,5602,5814,6024,6232,6438,6643,6846, 152 7048,7248,7447,7644,7839,8033,8226,8417,8606,8794,8981,9166,9350,9532,9713, 153 9892,10070,10247,10422,10596,10769,10940,11110,11278,11445,11611,11776,11939, 154 12101,12262,12422,12580,12737,12893,13048,13201,13354,13505,13655,13803,13951, 155 14097,14243,14387,14530,14672,14813,14952,15091,15229,15365,15500,15635,15768, 156 15900,16032,16162,16291,16419,16547,16673,16798,16922,17046,17168,17289,17410, 157 17529,17648,17766,17882,17998,18113,18227,18340,18453,18564,18675,18784,18893, 158 19001,19108,19215,19320,19425,19529,19632,19734,19835,19936,20036,20135,20233, 159 20331,20427,20523,20619,20713,20807,20900,20993,21084,21175,21265,21355,21444, 160 21532,21619,21706,21792,21878,21962,22046,22130,22213,22295,22376,22457,22537, 161 22617,22696,22774,22852,22929,23006,23082,23157,23232,23306,23380,23453,23525, 162 23597,23669,23739,23810,23879,23949,24017,24085,24153,24220,24286,24352,24418, 163 24483,24547,24611,24675,24738,24800,24862,24924,24985,25045,25106,25165,25224, 164 25283,25341,25399,25456,25513,25570,25626,25681,25737,25791,25846,25899,25953, 165 26006,26059,26111,26163,26214,26265,26316,26366,26416,26465,26514,26563,26611, 166 26659,26707,26754,26801,26847,26893,26939,26984,27029,27074,27118,27162,27206, 167 27249,27292,27335,27377,27419,27460,27502,27543,27583,27624,27664,27703,27743, 168 27782,27821,27859,27897,27935,27973,28010,28047,28084,28121,28157,28193,28228, 169 28263,28299,28333,28368,28402,28436,28470,28503,28536,28569,28602,28634,28667, 170 28699,28730,28762,28793,28824,28854,28885,28915,28945,28975,29004,29034,29063, 171 29092,29120,29149,29177,29205,29232,29260,29287,29314,29341,29368,29394,29421, 172 29447,29472,29498,29524,29549,29574,29599,29623,29648,29672,29696,29720,29744, 173 29767,29791,29814,29837,29860,29882,29905,29927,29949,29971,29993,30014,30036, 174 30057,30078,30099,30120,30141,30161,30181,30201,30221,30241,30261,30280,30300, 175 30319,30338,30357,30376,30394,30413,30431,30449,30467,30485,30503,30521,30538, 176 30555,30573,30590,30607,30624,30640,30657,30673,30690,30706,30722,30738,30753, 177 30769,30785,30800,30815,30831,30846,30861,30876,30890,30905,30919,30934,30948, 178 30962,30976,30990,31004,31018,31031,31045,31058,31072,31085,31098,31111,31124, 179 31137,31149,31162,31174,31187,31199,31211,31223,31235,31247,31259,31271,31283, 180 31294,31306,31317,31328,31339,31351,31362,31373,31383,31394,31405,31416,31426, 181 31436,31447,31457,31467,31477,31487,31497,31507,31517,31527,31537,31546,31556, 182 31565,31574,31584,31593,31602,31611,31620,31629,31638,31647,31655,31664,31673, 183 31681,31690,31698,31706,31715,31723,31731,31739,31747,31755,31763,31771,31778, 184 31786,31794,31801,31809,31816,31824,31831,31838,31846,31853,31860,31867,31874, 185 31881,31888,31895,31902,31908,31915,31922,31928,31935,31941,31948,31954,31960, 186 31967,31973,31979,31985,31991,31997,32003,32009,32015,32021,32027,32033,32038, 187 32044,32050,32055,32061,32066,32072,32077,32083,32088,32093,32098,32104,32109, 188 32114,32119,32124,32129,32134,32139,32144,32149,32154,32158,32163,32168,32173, 189 32177,32182,32186,32191,32195,32200,32204,32209,32213,32217,32222,32226,32230, 190 32234,32238,32242,32247,32251,32255,32259,32263,32267,32270,32274,32278,32282, 191 32286,32290,32293,32297,32301,32304,32308,32311,32315,32318,32322,32325,32329, 192 32332,32336,32339,32342,32346,32349,32352,32356,32359,32362,32365,32368,32371, 193 32374,32377,32381,32384,32387,32389,32392,32395,32398,32401,32404,32407,32410, 194 32412,32415,32418,32421,32423,32426,32429,32431,32434,32437,32439,32442,32444, 195 32447,32449,32452,32454,32457,32459,32461,32464,32466,32469,32471,32473,32476, 196 32478,32480,32482,32485,32487,32489,32491,32493,32495,32497,32500,32502,32504, 197 32506,32508,32510,32512,32514,32516,32518,32520,32522,32524,32526,32527,32529, 198 32531,32533,32535,32537,32538,32540,32542,32544,32545,32547}; 199 200 static uma_zone_t qdiffsample_zone; 201 202 static MALLOC_DEFINE(M_CDG, "cdg data", 203 "Per connection data required for the CDG congestion control algorithm"); 204 205 static int ertt_id; 206 207 static VNET_DEFINE(uint32_t, cdg_alpha_inc); 208 static VNET_DEFINE(uint32_t, cdg_beta_delay); 209 static VNET_DEFINE(uint32_t, cdg_beta_loss); 210 static VNET_DEFINE(uint32_t, cdg_smoothing_factor); 211 static VNET_DEFINE(uint32_t, cdg_exp_backoff_scale); 212 static VNET_DEFINE(uint32_t, cdg_consec_cong); 213 static VNET_DEFINE(uint32_t, cdg_hold_backoff); 214 #define V_cdg_alpha_inc VNET(cdg_alpha_inc) 215 #define V_cdg_beta_delay VNET(cdg_beta_delay) 216 #define V_cdg_beta_loss VNET(cdg_beta_loss) 217 #define V_cdg_smoothing_factor VNET(cdg_smoothing_factor) 218 #define V_cdg_exp_backoff_scale VNET(cdg_exp_backoff_scale) 219 #define V_cdg_consec_cong VNET(cdg_consec_cong) 220 #define V_cdg_hold_backoff VNET(cdg_hold_backoff) 221 222 /* Function prototypes. */ 223 static int cdg_mod_init(void); 224 static void cdg_conn_init(struct cc_var *ccv); 225 static int cdg_cb_init(struct cc_var *ccv); 226 static void cdg_cb_destroy(struct cc_var *ccv); 227 static void cdg_cong_signal(struct cc_var *ccv, uint32_t signal_type); 228 static void cdg_ack_received(struct cc_var *ccv, uint16_t ack_type); 229 230 struct cc_algo cdg_cc_algo = { 231 .name = "cdg", 232 .mod_init = cdg_mod_init, 233 .ack_received = cdg_ack_received, 234 .cb_destroy = cdg_cb_destroy, 235 .cb_init = cdg_cb_init, 236 .conn_init = cdg_conn_init, 237 .cong_signal = cdg_cong_signal 238 }; 239 240 /* Vnet created and being initialised. */ 241 static void 242 cdg_init_vnet(const void *unused __unused) 243 { 244 245 V_cdg_alpha_inc = 0; 246 V_cdg_beta_delay = 70; 247 V_cdg_beta_loss = 50; 248 V_cdg_smoothing_factor = 8; 249 V_cdg_exp_backoff_scale = 3; 250 V_cdg_consec_cong = 5; 251 V_cdg_hold_backoff = 5; 252 } 253 254 static int 255 cdg_mod_init(void) 256 { 257 VNET_ITERATOR_DECL(v); 258 259 ertt_id = khelp_get_id("ertt"); 260 if (ertt_id <= 0) 261 return (EINVAL); 262 263 qdiffsample_zone = uma_zcreate("cdg_qdiffsample", 264 sizeof(struct qdiff_sample), NULL, NULL, NULL, NULL, 0, 0); 265 266 VNET_LIST_RLOCK(); 267 VNET_FOREACH(v) { 268 CURVNET_SET(v); 269 cdg_init_vnet(NULL); 270 CURVNET_RESTORE(); 271 } 272 VNET_LIST_RUNLOCK(); 273 274 cdg_cc_algo.post_recovery = newreno_cc_algo.post_recovery; 275 cdg_cc_algo.after_idle = newreno_cc_algo.after_idle; 276 277 return (0); 278 } 279 280 static int 281 cdg_cb_init(struct cc_var *ccv) 282 { 283 struct cdg *cdg_data; 284 285 cdg_data = malloc(sizeof(struct cdg), M_CDG, M_NOWAIT); 286 if (cdg_data == NULL) 287 return (ENOMEM); 288 289 cdg_data->shadow_w = 0; 290 cdg_data->max_qtrend = 0; 291 cdg_data->min_qtrend = 0; 292 cdg_data->queue_state = CDG_Q_UNKNOWN; 293 cdg_data->maxrtt_in_rtt = 0; 294 cdg_data->maxrtt_in_prevrtt = 0; 295 cdg_data->minrtt_in_rtt = INT_MAX; 296 cdg_data->minrtt_in_prevrtt = 0; 297 cdg_data->window_incr = 0; 298 cdg_data->rtt_count = 0; 299 cdg_data->consec_cong_cnt = 0; 300 cdg_data->sample_q_size = V_cdg_smoothing_factor; 301 cdg_data->num_samples = 0; 302 STAILQ_INIT(&cdg_data->qdiffmin_q); 303 STAILQ_INIT(&cdg_data->qdiffmax_q); 304 305 ccv->cc_data = cdg_data; 306 307 return (0); 308 } 309 310 static void 311 cdg_conn_init(struct cc_var *ccv) 312 { 313 struct cdg *cdg_data = ccv->cc_data; 314 315 /* 316 * Initialise the shadow_cwnd in case we are competing with loss based 317 * flows from the start 318 */ 319 cdg_data->shadow_w = CCV(ccv, snd_cwnd); 320 } 321 322 static void 323 cdg_cb_destroy(struct cc_var *ccv) 324 { 325 struct cdg *cdg_data; 326 struct qdiff_sample *qds, *qds_n; 327 328 cdg_data = ccv->cc_data; 329 330 qds = STAILQ_FIRST(&cdg_data->qdiffmin_q); 331 while (qds != NULL) { 332 qds_n = STAILQ_NEXT(qds, qdiff_lnk); 333 uma_zfree(qdiffsample_zone,qds); 334 qds = qds_n; 335 } 336 337 qds = STAILQ_FIRST(&cdg_data->qdiffmax_q); 338 while (qds != NULL) { 339 qds_n = STAILQ_NEXT(qds, qdiff_lnk); 340 uma_zfree(qdiffsample_zone,qds); 341 qds = qds_n; 342 } 343 344 free(ccv->cc_data, M_CDG); 345 } 346 347 static int 348 cdg_beta_handler(SYSCTL_HANDLER_ARGS) 349 { 350 351 if (req->newptr != NULL && 352 (CAST_PTR_INT(req->newptr) == 0 || CAST_PTR_INT(req->newptr) > 100)) 353 return (EINVAL); 354 355 return (sysctl_handle_int(oidp, arg1, arg2, req)); 356 } 357 358 static int 359 cdg_exp_backoff_scale_handler(SYSCTL_HANDLER_ARGS) 360 { 361 362 if (req->newptr != NULL && CAST_PTR_INT(req->newptr) < 1) 363 return (EINVAL); 364 365 return (sysctl_handle_int(oidp, arg1, arg2, req)); 366 } 367 368 static inline unsigned long 369 cdg_window_decrease(struct cc_var *ccv, unsigned long owin, unsigned int beta) 370 { 371 372 return ((ulmin(CCV(ccv, snd_wnd), owin) * beta) / 100); 373 } 374 375 /* 376 * Window increase function 377 * This window increase function is independent of the initial window size 378 * to ensure small window flows are not discriminated against (i.e. fairness). 379 * It increases at 1pkt/rtt like Reno for alpha_inc rtts, and then 2pkts/rtt for 380 * the next alpha_inc rtts, etc. 381 */ 382 static void 383 cdg_window_increase(struct cc_var *ccv, int new_measurement) 384 { 385 struct cdg *cdg_data; 386 int incr, s_w_incr; 387 388 cdg_data = ccv->cc_data; 389 incr = s_w_incr = 0; 390 391 if (CCV(ccv, snd_cwnd) <= CCV(ccv, snd_ssthresh)) { 392 /* Slow start. */ 393 incr = CCV(ccv, t_maxseg); 394 s_w_incr = incr; 395 cdg_data->window_incr = cdg_data->rtt_count = 0; 396 } else { 397 /* Congestion avoidance. */ 398 if (new_measurement) { 399 s_w_incr = CCV(ccv, t_maxseg); 400 if (V_cdg_alpha_inc == 0) { 401 incr = CCV(ccv, t_maxseg); 402 } else { 403 if (++cdg_data->rtt_count >= V_cdg_alpha_inc) { 404 cdg_data->window_incr++; 405 cdg_data->rtt_count = 0; 406 } 407 incr = CCV(ccv, t_maxseg) * 408 cdg_data->window_incr; 409 } 410 } 411 } 412 413 if (cdg_data->shadow_w > 0) 414 cdg_data->shadow_w = ulmin(cdg_data->shadow_w + s_w_incr, 415 TCP_MAXWIN << CCV(ccv, snd_scale)); 416 417 CCV(ccv, snd_cwnd) = ulmin(CCV(ccv, snd_cwnd) + incr, 418 TCP_MAXWIN << CCV(ccv, snd_scale)); 419 } 420 421 static void 422 cdg_cong_signal(struct cc_var *ccv, uint32_t signal_type) 423 { 424 struct cdg *cdg_data = ccv->cc_data; 425 426 switch(signal_type) { 427 case CC_CDG_DELAY: 428 CCV(ccv, snd_ssthresh) = cdg_window_decrease(ccv, 429 CCV(ccv, snd_cwnd), V_cdg_beta_delay); 430 CCV(ccv, snd_cwnd) = CCV(ccv, snd_ssthresh); 431 CCV(ccv, snd_recover) = CCV(ccv, snd_max); 432 cdg_data->window_incr = cdg_data->rtt_count = 0; 433 ENTER_CONGRECOVERY(CCV(ccv, t_flags)); 434 break; 435 case CC_NDUPACK: 436 /* 437 * If already responding to congestion OR we have guessed no 438 * queue in the path is full. 439 */ 440 if (IN_CONGRECOVERY(CCV(ccv, t_flags)) || 441 cdg_data->queue_state < CDG_Q_FULL) { 442 CCV(ccv, snd_ssthresh) = CCV(ccv, snd_cwnd); 443 CCV(ccv, snd_recover) = CCV(ccv, snd_max); 444 } else { 445 /* 446 * Loss is likely to be congestion related. We have 447 * inferred a queue full state, so have shadow window 448 * react to loss as NewReno would. 449 */ 450 if (cdg_data->shadow_w > 0) 451 cdg_data->shadow_w = cdg_window_decrease(ccv, 452 cdg_data->shadow_w, RENO_BETA); 453 454 CCV(ccv, snd_ssthresh) = ulmax(cdg_data->shadow_w, 455 cdg_window_decrease(ccv, CCV(ccv, snd_cwnd), 456 V_cdg_beta_loss)); 457 458 cdg_data->window_incr = cdg_data->rtt_count = 0; 459 } 460 ENTER_RECOVERY(CCV(ccv, t_flags)); 461 break; 462 default: 463 newreno_cc_algo.cong_signal(ccv, signal_type); 464 break; 465 } 466 } 467 468 /* 469 * Using a negative exponential probabilistic backoff so that sources with 470 * varying RTTs which share the same link will, on average, have the same 471 * probability of backoff over time. 472 * 473 * Prob_backoff = 1 - exp(-qtrend / V_cdg_exp_backoff_scale), where 474 * V_cdg_exp_backoff_scale is the average qtrend for the exponential backoff. 475 */ 476 static inline int 477 prob_backoff(long qtrend) 478 { 479 int backoff, idx, p; 480 481 backoff = (qtrend > ((MAXGRAD * V_cdg_exp_backoff_scale) << D_P_E)); 482 483 if (!backoff) { 484 if (V_cdg_exp_backoff_scale > 1) 485 idx = (qtrend + V_cdg_exp_backoff_scale / 2) / 486 V_cdg_exp_backoff_scale; 487 else 488 idx = qtrend; 489 490 /* Backoff probability proportional to rate of queue growth. */ 491 p = (INT_MAX / (1 << EXP_PREC)) * probexp[idx]; 492 backoff = (random() < p); 493 } 494 495 return (backoff); 496 } 497 498 static inline void 499 calc_moving_average(struct cdg *cdg_data, long qdiff_max, long qdiff_min) 500 { 501 struct qdiff_sample *qds; 502 503 ++cdg_data->num_samples; 504 if (cdg_data->num_samples > cdg_data->sample_q_size) { 505 /* Minimum RTT. */ 506 qds = STAILQ_FIRST(&cdg_data->qdiffmin_q); 507 cdg_data->min_qtrend = cdg_data->min_qtrend + 508 (qdiff_min - qds->qdiff) / cdg_data->sample_q_size; 509 STAILQ_REMOVE_HEAD(&cdg_data->qdiffmin_q, qdiff_lnk); 510 qds->qdiff = qdiff_min; 511 STAILQ_INSERT_TAIL(&cdg_data->qdiffmin_q, qds, qdiff_lnk); 512 513 /* Maximum RTT. */ 514 qds = STAILQ_FIRST(&cdg_data->qdiffmax_q); 515 cdg_data->max_qtrend = cdg_data->max_qtrend + 516 (qdiff_max - qds->qdiff) / cdg_data->sample_q_size; 517 STAILQ_REMOVE_HEAD(&cdg_data->qdiffmax_q, qdiff_lnk); 518 qds->qdiff = qdiff_max; 519 STAILQ_INSERT_TAIL(&cdg_data->qdiffmax_q, qds, qdiff_lnk); 520 --cdg_data->num_samples; 521 } else { 522 qds = uma_zalloc(qdiffsample_zone, M_NOWAIT); 523 if (qds != NULL) { 524 cdg_data->min_qtrend = cdg_data->min_qtrend + 525 qdiff_min / cdg_data->sample_q_size; 526 qds->qdiff = qdiff_min; 527 STAILQ_INSERT_TAIL(&cdg_data->qdiffmin_q, qds, 528 qdiff_lnk); 529 } 530 531 qds = uma_zalloc(qdiffsample_zone, M_NOWAIT); 532 if (qds) { 533 cdg_data->max_qtrend = cdg_data->max_qtrend + 534 qdiff_max / cdg_data->sample_q_size; 535 qds->qdiff = qdiff_max; 536 STAILQ_INSERT_TAIL(&cdg_data->qdiffmax_q, qds, 537 qdiff_lnk); 538 } 539 } 540 } 541 542 static void 543 cdg_ack_received(struct cc_var *ccv, uint16_t ack_type) 544 { 545 struct cdg *cdg_data; 546 struct ertt *e_t; 547 long qdiff_max, qdiff_min; 548 int congestion, new_measurement, slowstart; 549 550 cdg_data = ccv->cc_data; 551 e_t = (struct ertt *)khelp_get_osd(CCV(ccv, osd), ertt_id); 552 new_measurement = e_t->flags & ERTT_NEW_MEASUREMENT; 553 congestion = 0; 554 cdg_data->maxrtt_in_rtt = imax(e_t->rtt, cdg_data->maxrtt_in_rtt); 555 cdg_data->minrtt_in_rtt = imin(e_t->rtt, cdg_data->minrtt_in_rtt); 556 557 if (new_measurement) { 558 slowstart = (CCV(ccv, snd_cwnd) <= CCV(ccv, snd_ssthresh)); 559 /* 560 * Update smoothed gradient measurements. Since we are only 561 * using one measurement per RTT, use max or min rtt_in_rtt. 562 * This is also less noisy than a sample RTT measurement. Max 563 * RTT measurements can have trouble due to OS issues. 564 */ 565 if (cdg_data->maxrtt_in_prevrtt) { 566 qdiff_max = ((long)(cdg_data->maxrtt_in_rtt - 567 cdg_data->maxrtt_in_prevrtt) << D_P_E ); 568 qdiff_min = ((long)(cdg_data->minrtt_in_rtt - 569 cdg_data->minrtt_in_prevrtt) << D_P_E ); 570 571 calc_moving_average(cdg_data, qdiff_max, qdiff_min); 572 573 /* Probabilistic backoff with respect to gradient. */ 574 if (slowstart && qdiff_min > 0) 575 congestion = prob_backoff(qdiff_min); 576 else if (cdg_data->min_qtrend > 0) 577 congestion = prob_backoff(cdg_data->min_qtrend); 578 else if (slowstart && qdiff_max > 0) 579 congestion = prob_backoff(qdiff_max); 580 else if (cdg_data->max_qtrend > 0) 581 congestion = prob_backoff(cdg_data->max_qtrend); 582 583 /* Update estimate of queue state. */ 584 if (cdg_data->min_qtrend > 0 && 585 cdg_data->max_qtrend <= 0) { 586 cdg_data->queue_state = CDG_Q_FULL; 587 } else if (cdg_data->min_qtrend >= 0 && 588 cdg_data->max_qtrend < 0) { 589 cdg_data->queue_state = CDG_Q_EMPTY; 590 cdg_data->shadow_w = 0; 591 } else if (cdg_data->min_qtrend > 0 && 592 cdg_data->max_qtrend > 0) { 593 cdg_data->queue_state = CDG_Q_RISING; 594 } else if (cdg_data->min_qtrend < 0 && 595 cdg_data->max_qtrend < 0) { 596 cdg_data->queue_state = CDG_Q_FALLING; 597 } 598 599 if (cdg_data->min_qtrend < 0 || 600 cdg_data->max_qtrend < 0) 601 cdg_data->consec_cong_cnt = 0; 602 } 603 604 cdg_data->minrtt_in_prevrtt = cdg_data->minrtt_in_rtt; 605 cdg_data->minrtt_in_rtt = INT_MAX; 606 cdg_data->maxrtt_in_prevrtt = cdg_data->maxrtt_in_rtt; 607 cdg_data->maxrtt_in_rtt = 0; 608 e_t->flags &= ~ERTT_NEW_MEASUREMENT; 609 } 610 611 if (congestion) { 612 cdg_data->consec_cong_cnt++; 613 if (!IN_RECOVERY(CCV(ccv, t_flags))) { 614 if (cdg_data->consec_cong_cnt <= V_cdg_consec_cong) 615 cdg_cong_signal(ccv, CC_CDG_DELAY); 616 else 617 /* 618 * We have been backing off but the queue is not 619 * falling. Assume we are competing with 620 * loss-based flows and don't back off for the 621 * next V_cdg_hold_backoff RTT periods. 622 */ 623 if (cdg_data->consec_cong_cnt >= 624 V_cdg_consec_cong + V_cdg_hold_backoff) 625 cdg_data->consec_cong_cnt = 0; 626 627 /* Won't see effect until 2nd RTT. */ 628 cdg_data->maxrtt_in_prevrtt = 0; 629 /* 630 * Resync shadow window in case we are competing with a 631 * loss based flow 632 */ 633 cdg_data->shadow_w = ulmax(CCV(ccv, snd_cwnd), 634 cdg_data->shadow_w); 635 } 636 } else if (ack_type == CC_ACK) 637 cdg_window_increase(ccv, new_measurement); 638 } 639 640 /* When a vnet is created and being initialised, init the per-stack CDG vars. */ 641 VNET_SYSINIT(cdg_init_vnet, SI_SUB_PROTO_BEGIN, SI_ORDER_FIRST, 642 cdg_init_vnet, NULL); 643 644 SYSCTL_DECL(_net_inet_tcp_cc_cdg); 645 SYSCTL_NODE(_net_inet_tcp_cc, OID_AUTO, cdg, CTLFLAG_RW, NULL, 646 "CAIA delay-gradient congestion control related settings"); 647 648 SYSCTL_STRING(_net_inet_tcp_cc_cdg, OID_AUTO, version, 649 CTLFLAG_RD, CDG_VERSION, sizeof(CDG_VERSION) - 1, 650 "Current algorithm/implementation version number"); 651 652 SYSCTL_VNET_UINT(_net_inet_tcp_cc_cdg, OID_AUTO, alpha_inc, 653 CTLFLAG_RW, &VNET_NAME(cdg_alpha_inc), 0, 654 "Increment the window increase factor alpha by 1 MSS segment every " 655 "alpha_inc RTTs during congestion avoidance mode."); 656 657 SYSCTL_VNET_PROC(_net_inet_tcp_cc_cdg, OID_AUTO, beta_delay, 658 CTLTYPE_UINT|CTLFLAG_RW, &VNET_NAME(cdg_beta_delay), 70, 659 &cdg_beta_handler, "IU", 660 "Delay-based window decrease factor as a percentage " 661 "(on delay-based backoff, w = w * beta_delay / 100)"); 662 663 SYSCTL_VNET_PROC(_net_inet_tcp_cc_cdg, OID_AUTO, beta_loss, 664 CTLTYPE_UINT|CTLFLAG_RW, &VNET_NAME(cdg_beta_loss), 50, 665 &cdg_beta_handler, "IU", 666 "Loss-based window decrease factor as a percentage " 667 "(on loss-based backoff, w = w * beta_loss / 100)"); 668 669 SYSCTL_VNET_PROC(_net_inet_tcp_cc_cdg, OID_AUTO, exp_backoff_scale, 670 CTLTYPE_UINT|CTLFLAG_RW, &VNET_NAME(cdg_exp_backoff_scale), 2, 671 &cdg_exp_backoff_scale_handler, "IU", 672 "Scaling parameter for the probabilistic exponential backoff"); 673 674 SYSCTL_VNET_UINT(_net_inet_tcp_cc_cdg, OID_AUTO, smoothing_factor, 675 CTLFLAG_RW, &VNET_NAME(cdg_smoothing_factor), 8, 676 "Number of samples used for moving average smoothing (0 = no smoothing)"); 677 678 SYSCTL_VNET_UINT(_net_inet_tcp_cc_cdg, OID_AUTO, loss_compete_consec_cong, 679 CTLFLAG_RW, &VNET_NAME(cdg_consec_cong), 5, 680 "Number of consecutive delay-gradient based congestion episodes which will " 681 "trigger loss based CC compatibility"); 682 683 SYSCTL_VNET_UINT(_net_inet_tcp_cc_cdg, OID_AUTO, loss_compete_hold_backoff, 684 CTLFLAG_RW, &VNET_NAME(cdg_hold_backoff), 5, 685 "Number of consecutive delay-gradient based congestion episodes to hold " 686 "the window backoff for loss based CC compatibility"); 687 688 DECLARE_CC_MODULE(cdg, &cdg_cc_algo); 689 690 MODULE_DEPEND(cdg, ertt, 1, 1, 1); 691