Blame view
include/net/red.h
10 KB
a78347459 [PKT_SCHED]: Gene... |
1 2 |
#ifndef __NET_SCHED_RED_H #define __NET_SCHED_RED_H |
a78347459 [PKT_SCHED]: Gene... |
3 |
#include <linux/types.h> |
187f1882b BUG: headers with... |
4 |
#include <linux/bug.h> |
a78347459 [PKT_SCHED]: Gene... |
5 6 7 |
#include <net/pkt_sched.h> #include <net/inet_ecn.h> #include <net/dsfield.h> |
8af2a218d sch_red: Adaptati... |
8 |
#include <linux/reciprocal_div.h> |
a78347459 [PKT_SCHED]: Gene... |
9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 |
/* Random Early Detection (RED) algorithm. ======================================= Source: Sally Floyd and Van Jacobson, "Random Early Detection Gateways for Congestion Avoidance", 1993, IEEE/ACM Transactions on Networking. This file codes a "divisionless" version of RED algorithm as written down in Fig.17 of the paper. Short description. ------------------ When a new packet arrives we calculate the average queue length: avg = (1-W)*avg + W*current_queue_len, W is the filter time constant (chosen as 2^(-Wlog)), it controls the inertia of the algorithm. To allow larger bursts, W should be decreased. if (avg > th_max) -> packet marked (dropped). if (avg < th_min) -> packet passes. if (th_min < avg < th_max) we calculate probability: Pb = max_P * (avg - th_min)/(th_max-th_min) and mark (drop) packet with this probability. Pb changes from 0 (at avg==th_min) to max_P (avg==th_max). max_P should be small (not 1), usually 0.01..0.02 is good value. max_P is chosen as a number, so that max_P/(th_max-th_min) is a negative power of two in order arithmetics to contain only shifts. Parameters, settable by user: ----------------------------- qth_min - bytes (should be < qth_max/2) qth_max - bytes (should be at least 2*qth_min and less limit) Wlog - bits (<32) log(1/W). Plog - bits (<32) Plog is related to max_P by formula: max_P = (qth_max-qth_min)/2^Plog; F.e. if qth_max=128K and qth_min=32K, then Plog=22 corresponds to max_P=0.02 Scell_log Stab Lookup table for log((1-W)^(t/t_ave). NOTES: Upper bound on W. ----------------- If you want to allow bursts of L packets of size S, you should choose W: L + 1 - th_min/S < (1-(1-W)^L)/W th_min/S = 32 th_min/S = 4 log(W) L -1 33 -2 35 -3 39 -4 46 -5 57 -6 75 -7 101 -8 135 -9 190 etc. */ |
8af2a218d sch_red: Adaptati... |
90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 |
/* * Adaptative RED : An Algorithm for Increasing the Robustness of RED's AQM * (Sally FLoyd, Ramakrishna Gummadi, and Scott Shenker) August 2001 * * Every 500 ms: * if (avg > target and max_p <= 0.5) * increase max_p : max_p += alpha; * else if (avg < target and max_p >= 0.01) * decrease max_p : max_p *= beta; * * target :[qth_min + 0.4*(qth_min - qth_max), * qth_min + 0.6*(qth_min - qth_max)]. * alpha : min(0.01, max_p / 4) * beta : 0.9 * max_P is a Q0.32 fixed point number (with 32 bits mantissa) * max_P between 0.01 and 0.5 (1% - 50%) [ Its no longer a negative power of two ] */ #define RED_ONE_PERCENT ((u32)DIV_ROUND_CLOSEST(1ULL<<32, 100)) #define MAX_P_MIN (1 * RED_ONE_PERCENT) #define MAX_P_MAX (50 * RED_ONE_PERCENT) #define MAX_P_ALPHA(val) min(MAX_P_MIN, val / 4) |
a78347459 [PKT_SCHED]: Gene... |
112 113 |
#define RED_STAB_SIZE 256 #define RED_STAB_MASK (RED_STAB_SIZE - 1) |
fd2c3ef76 net: cleanup incl... |
114 |
struct red_stats { |
a78347459 [PKT_SCHED]: Gene... |
115 116 117 118 119 120 |
u32 prob_drop; /* Early probability drops */ u32 prob_mark; /* Early probability marks */ u32 forced_drop; /* Forced drops, qavg > max_thresh */ u32 forced_mark; /* Forced marks, qavg > max_thresh */ u32 pdrop; /* Drops due to queue limits */ u32 other; /* Drops due to drop() calls */ |
a78347459 [PKT_SCHED]: Gene... |
121 |
}; |
fd2c3ef76 net: cleanup incl... |
122 |
struct red_parms { |
a78347459 [PKT_SCHED]: Gene... |
123 |
/* Parameters */ |
8af2a218d sch_red: Adaptati... |
124 125 |
u32 qth_min; /* Min avg length threshold: Wlog scaled */ u32 qth_max; /* Max avg length threshold: Wlog scaled */ |
a78347459 [PKT_SCHED]: Gene... |
126 |
u32 Scell_max; |
8af2a218d sch_red: Adaptati... |
127 |
u32 max_P; /* probability, [0 .. 1.0] 32 scaled */ |
809fa972f reciprocal_divide... |
128 129 |
/* reciprocal_value(max_P / qth_delta) */ struct reciprocal_value max_P_reciprocal; |
8af2a218d sch_red: Adaptati... |
130 131 132 |
u32 qth_delta; /* max_th - min_th */ u32 target_min; /* min_th + 0.4*(max_th - min_th) */ u32 target_max; /* min_th + 0.6*(max_th - min_th) */ |
a78347459 [PKT_SCHED]: Gene... |
133 134 135 136 |
u8 Scell_log; u8 Wlog; /* log(W) */ u8 Plog; /* random number bits */ u8 Stab[RED_STAB_SIZE]; |
eeca6688d net_sched: red: s... |
137 |
}; |
a78347459 [PKT_SCHED]: Gene... |
138 |
|
eeca6688d net_sched: red: s... |
139 |
struct red_vars { |
a78347459 [PKT_SCHED]: Gene... |
140 141 142 143 |
/* Variables */ int qcount; /* Number of packets since last random number generation */ u32 qR; /* Cached random number */ |
8af2a218d sch_red: Adaptati... |
144 |
unsigned long qavg; /* Average queue length: Wlog scaled */ |
ea6a5d3b9 sch_red: fix red_... |
145 |
ktime_t qidlestart; /* Start of current idle period */ |
a78347459 [PKT_SCHED]: Gene... |
146 |
}; |
8af2a218d sch_red: Adaptati... |
147 |
static inline u32 red_maxp(u8 Plog) |
a78347459 [PKT_SCHED]: Gene... |
148 |
{ |
8af2a218d sch_red: Adaptati... |
149 |
return Plog < 32 ? (~0U >> Plog) : ~0U; |
a78347459 [PKT_SCHED]: Gene... |
150 |
} |
eeca6688d net_sched: red: s... |
151 152 153 154 155 156 157 158 159 160 |
static inline void red_set_vars(struct red_vars *v) { /* Reset average queue length, the value is strictly bound * to the parameters below, reseting hurts a bit but leaving * it might result in an unreasonable qavg for a while. --TGR */ v->qavg = 0; v->qcount = -1; } |
8af2a218d sch_red: Adaptati... |
161 |
|
a78347459 [PKT_SCHED]: Gene... |
162 163 |
static inline void red_set_parms(struct red_parms *p, u32 qth_min, u32 qth_max, u8 Wlog, u8 Plog, |
a73ed26bb sch_red: generali... |
164 |
u8 Scell_log, u8 *stab, u32 max_P) |
a78347459 [PKT_SCHED]: Gene... |
165 |
{ |
8af2a218d sch_red: Adaptati... |
166 |
int delta = qth_max - qth_min; |
a73ed26bb sch_red: generali... |
167 |
u32 max_p_delta; |
8af2a218d sch_red: Adaptati... |
168 |
|
a78347459 [PKT_SCHED]: Gene... |
169 170 171 172 |
p->qth_min = qth_min << Wlog; p->qth_max = qth_max << Wlog; p->Wlog = Wlog; p->Plog = Plog; |
8af2a218d sch_red: Adaptati... |
173 174 175 |
if (delta < 0) delta = 1; p->qth_delta = delta; |
a73ed26bb sch_red: generali... |
176 177 178 179 180 181 182 183 |
if (!max_P) { max_P = red_maxp(Plog); max_P *= delta; /* max_P = (qth_max - qth_min)/2^Plog */ } p->max_P = max_P; max_p_delta = max_P / delta; max_p_delta = max(max_p_delta, 1U); p->max_P_reciprocal = reciprocal_value(max_p_delta); |
8af2a218d sch_red: Adaptati... |
184 185 186 187 188 189 190 191 |
/* RED Adaptative target : * [min_th + 0.4*(min_th - max_th), * min_th + 0.6*(min_th - max_th)]. */ delta /= 5; p->target_min = qth_min + 2*delta; p->target_max = qth_min + 3*delta; |
a78347459 [PKT_SCHED]: Gene... |
192 193 |
p->Scell_log = Scell_log; p->Scell_max = (255 << Scell_log); |
ddecf0f4d net_sched: sfq: a... |
194 195 |
if (stab) memcpy(p->Stab, stab, sizeof(p->Stab)); |
a78347459 [PKT_SCHED]: Gene... |
196 |
} |
eeca6688d net_sched: red: s... |
197 |
static inline int red_is_idling(const struct red_vars *v) |
a78347459 [PKT_SCHED]: Gene... |
198 |
{ |
eeca6688d net_sched: red: s... |
199 |
return v->qidlestart.tv64 != 0; |
a78347459 [PKT_SCHED]: Gene... |
200 |
} |
eeca6688d net_sched: red: s... |
201 |
static inline void red_start_of_idle_period(struct red_vars *v) |
a78347459 [PKT_SCHED]: Gene... |
202 |
{ |
eeca6688d net_sched: red: s... |
203 |
v->qidlestart = ktime_get(); |
a78347459 [PKT_SCHED]: Gene... |
204 |
} |
eeca6688d net_sched: red: s... |
205 |
static inline void red_end_of_idle_period(struct red_vars *v) |
a78347459 [PKT_SCHED]: Gene... |
206 |
{ |
eeca6688d net_sched: red: s... |
207 |
v->qidlestart.tv64 = 0; |
a78347459 [PKT_SCHED]: Gene... |
208 |
} |
eeca6688d net_sched: red: s... |
209 |
static inline void red_restart(struct red_vars *v) |
a78347459 [PKT_SCHED]: Gene... |
210 |
{ |
eeca6688d net_sched: red: s... |
211 212 213 |
red_end_of_idle_period(v); v->qavg = 0; v->qcount = -1; |
a78347459 [PKT_SCHED]: Gene... |
214 |
} |
eeca6688d net_sched: red: s... |
215 216 |
static inline unsigned long red_calc_qavg_from_idle_time(const struct red_parms *p, const struct red_vars *v) |
a78347459 [PKT_SCHED]: Gene... |
217 |
{ |
eeca6688d net_sched: red: s... |
218 |
s64 delta = ktime_us_delta(ktime_get(), v->qidlestart); |
ea6a5d3b9 sch_red: fix red_... |
219 |
long us_idle = min_t(s64, delta, p->Scell_max); |
a78347459 [PKT_SCHED]: Gene... |
220 |
int shift; |
a78347459 [PKT_SCHED]: Gene... |
221 222 223 224 225 226 227 228 229 230 231 232 |
/* * The problem: ideally, average length queue recalcultion should * be done over constant clock intervals. This is too expensive, so * that the calculation is driven by outgoing packets. * When the queue is idle we have to model this clock by hand. * * SF+VJ proposed to "generate": * * m = idletime / (average_pkt_size / bandwidth) * * dummy packets as a burst after idle time, i.e. * |
4362aaf60 net_sched: red: M... |
233 |
* v->qavg *= (1-W)^m |
a78347459 [PKT_SCHED]: Gene... |
234 235 236 237 238 239 240 241 242 243 |
* * This is an apparently overcomplicated solution (f.e. we have to * precompute a table to make this calculation in reasonable time) * I believe that a simpler model may be used here, * but it is field for experiments. */ shift = p->Stab[(us_idle >> p->Scell_log) & RED_STAB_MASK]; if (shift) |
eeca6688d net_sched: red: s... |
244 |
return v->qavg >> shift; |
a78347459 [PKT_SCHED]: Gene... |
245 246 247 248 249 250 251 252 |
else { /* Approximate initial part of exponent with linear function: * * (1-W)^m ~= 1-mW + ... * * Seems, it is the best solution to * problem of too coarse exponent tabulation. */ |
eeca6688d net_sched: red: s... |
253 |
us_idle = (v->qavg * (u64)us_idle) >> p->Scell_log; |
a78347459 [PKT_SCHED]: Gene... |
254 |
|
eeca6688d net_sched: red: s... |
255 256 |
if (us_idle < (v->qavg >> 1)) return v->qavg - us_idle; |
a78347459 [PKT_SCHED]: Gene... |
257 |
else |
eeca6688d net_sched: red: s... |
258 |
return v->qavg >> 1; |
a78347459 [PKT_SCHED]: Gene... |
259 260 |
} } |
8af2a218d sch_red: Adaptati... |
261 |
static inline unsigned long red_calc_qavg_no_idle_time(const struct red_parms *p, |
eeca6688d net_sched: red: s... |
262 |
const struct red_vars *v, |
a78347459 [PKT_SCHED]: Gene... |
263 264 265 |
unsigned int backlog) { /* |
4362aaf60 net_sched: red: M... |
266 |
* NOTE: v->qavg is fixed point number with point at Wlog. |
a78347459 [PKT_SCHED]: Gene... |
267 268 269 270 271 272 273 |
* The formula below is equvalent to floating point * version: * * qavg = qavg*(1-W) + backlog*W; * * --ANK (980924) */ |
eeca6688d net_sched: red: s... |
274 |
return v->qavg + (backlog - (v->qavg >> p->Wlog)); |
a78347459 [PKT_SCHED]: Gene... |
275 |
} |
8af2a218d sch_red: Adaptati... |
276 |
static inline unsigned long red_calc_qavg(const struct red_parms *p, |
eeca6688d net_sched: red: s... |
277 |
const struct red_vars *v, |
a78347459 [PKT_SCHED]: Gene... |
278 279 |
unsigned int backlog) { |
eeca6688d net_sched: red: s... |
280 281 |
if (!red_is_idling(v)) return red_calc_qavg_no_idle_time(p, v, backlog); |
a78347459 [PKT_SCHED]: Gene... |
282 |
else |
eeca6688d net_sched: red: s... |
283 |
return red_calc_qavg_from_idle_time(p, v); |
a78347459 [PKT_SCHED]: Gene... |
284 |
} |
8af2a218d sch_red: Adaptati... |
285 286 |
static inline u32 red_random(const struct red_parms *p) |
a78347459 [PKT_SCHED]: Gene... |
287 |
{ |
63862b5be net: replace macr... |
288 |
return reciprocal_divide(prandom_u32(), p->max_P_reciprocal); |
a78347459 [PKT_SCHED]: Gene... |
289 |
} |
eeca6688d net_sched: red: s... |
290 291 292 |
static inline int red_mark_probability(const struct red_parms *p, const struct red_vars *v, unsigned long qavg) |
a78347459 [PKT_SCHED]: Gene... |
293 294 |
{ /* The formula used below causes questions. |
8af2a218d sch_red: Adaptati... |
295 296 |
OK. qR is random number in the interval (0..1/max_P)*(qth_max-qth_min) |
a78347459 [PKT_SCHED]: Gene... |
297 298 299 300 301 |
i.e. 0..(2^Plog). If we used floating point arithmetics, it would be: (2^Plog)*rnd_num, where rnd_num is less 1. Taking into account, that qavg have fixed |
8af2a218d sch_red: Adaptati... |
302 |
point at Wlog, two lines |
a78347459 [PKT_SCHED]: Gene... |
303 304 305 306 307 308 |
below have the following floating point equivalent: max_P*(qavg - qth_min)/(qth_max-qth_min) < rnd/qcount Any questions? --ANK (980924) */ |
eeca6688d net_sched: red: s... |
309 |
return !(((qavg - p->qth_min) >> p->Wlog) * v->qcount < v->qR); |
a78347459 [PKT_SCHED]: Gene... |
310 311 312 313 314 315 316 |
} enum { RED_BELOW_MIN_THRESH, RED_BETWEEN_TRESH, RED_ABOVE_MAX_TRESH, }; |
eeca6688d net_sched: red: s... |
317 |
static inline int red_cmp_thresh(const struct red_parms *p, unsigned long qavg) |
a78347459 [PKT_SCHED]: Gene... |
318 319 320 321 322 323 324 325 326 327 328 329 330 331 |
{ if (qavg < p->qth_min) return RED_BELOW_MIN_THRESH; else if (qavg >= p->qth_max) return RED_ABOVE_MAX_TRESH; else return RED_BETWEEN_TRESH; } enum { RED_DONT_MARK, RED_PROB_MARK, RED_HARD_MARK, }; |
eeca6688d net_sched: red: s... |
332 333 334 |
static inline int red_action(const struct red_parms *p, struct red_vars *v, unsigned long qavg) |
a78347459 [PKT_SCHED]: Gene... |
335 336 337 |
{ switch (red_cmp_thresh(p, qavg)) { case RED_BELOW_MIN_THRESH: |
eeca6688d net_sched: red: s... |
338 |
v->qcount = -1; |
a78347459 [PKT_SCHED]: Gene... |
339 340 341 |
return RED_DONT_MARK; case RED_BETWEEN_TRESH: |
eeca6688d net_sched: red: s... |
342 343 344 345 |
if (++v->qcount) { if (red_mark_probability(p, v, qavg)) { v->qcount = 0; v->qR = red_random(p); |
a78347459 [PKT_SCHED]: Gene... |
346 347 348 |
return RED_PROB_MARK; } } else |
eeca6688d net_sched: red: s... |
349 |
v->qR = red_random(p); |
a78347459 [PKT_SCHED]: Gene... |
350 351 352 353 |
return RED_DONT_MARK; case RED_ABOVE_MAX_TRESH: |
eeca6688d net_sched: red: s... |
354 |
v->qcount = -1; |
a78347459 [PKT_SCHED]: Gene... |
355 356 357 358 359 360 |
return RED_HARD_MARK; } BUG(); return RED_DONT_MARK; } |
eeca6688d net_sched: red: s... |
361 |
static inline void red_adaptative_algo(struct red_parms *p, struct red_vars *v) |
8af2a218d sch_red: Adaptati... |
362 363 364 |
{ unsigned long qavg; u32 max_p_delta; |
eeca6688d net_sched: red: s... |
365 366 367 |
qavg = v->qavg; if (red_is_idling(v)) qavg = red_calc_qavg_from_idle_time(p, v); |
8af2a218d sch_red: Adaptati... |
368 |
|
4362aaf60 net_sched: red: M... |
369 |
/* v->qavg is fixed point number with point at Wlog */ |
8af2a218d sch_red: Adaptati... |
370 371 372 373 374 375 376 377 |
qavg >>= p->Wlog; if (qavg > p->target_max && p->max_P <= MAX_P_MAX) p->max_P += MAX_P_ALPHA(p->max_P); /* maxp = maxp + alpha */ else if (qavg < p->target_min && p->max_P >= MAX_P_MIN) p->max_P = (p->max_P/10)*9; /* maxp = maxp * Beta */ max_p_delta = DIV_ROUND_CLOSEST(p->max_P, p->qth_delta); |
a73ed26bb sch_red: generali... |
378 |
max_p_delta = max(max_p_delta, 1U); |
8af2a218d sch_red: Adaptati... |
379 380 |
p->max_P_reciprocal = reciprocal_value(max_p_delta); } |
a78347459 [PKT_SCHED]: Gene... |
381 |
#endif |