/* SPDX-License-Identifier: GPL-2.0 */ #ifndef __NET_SCHED_RED_H #define __NET_SCHED_RED_H #include <linux/types.h> #include <linux/bug.h> #include <net/pkt_sched.h> #include <net/inet_ecn.h> #include <net/dsfield.h> #include <linux/reciprocal_div.h> /* 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. */ /* * 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) #define RED_STAB_SIZE 256 #define RED_STAB_MASK (RED_STAB_SIZE - 1) struct red_stats { 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 */ }; struct red_parms { /* Parameters */ u32 qth_min; /* Min avg length threshold: Wlog scaled */ u32 qth_max; /* Max avg length threshold: Wlog scaled */ u32 Scell_max; u32 max_P; /* probability, [0 .. 1.0] 32 scaled */ /* reciprocal_value(max_P / qth_delta) */ struct reciprocal_value max_P_reciprocal; 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) */ u8 Scell_log; u8 Wlog; /* log(W) */ u8 Plog; /* random number bits */ u8 Stab[RED_STAB_SIZE]; }; struct red_vars { /* Variables */ int qcount; /* Number of packets since last random number generation */ u32 qR; /* Cached random number */ unsigned long qavg; /* Average queue length: Wlog scaled */ ktime_t qidlestart; /* Start of current idle period */ }; static inline u32 red_maxp(u8 Plog) { return Plog < 32 ? (~0U >> Plog) : ~0U; } 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; } static inline bool red_check_params(u32 qth_min, u32 qth_max, u8 Wlog, u8 Scell_log, u8 *stab) { if (fls(qth_min) + Wlog >= 32) return false; if (fls(qth_max) + Wlog >= 32) return false; if (Scell_log >= 32) return false; if (qth_max < qth_min) return false; if (stab) { int i; for (i = 0; i < RED_STAB_SIZE; i++) if (stab[i] >= 32) return false; } return true; } static inline void red_set_parms(struct red_parms *p, u32 qth_min, u32 qth_max, u8 Wlog, u8 Plog, u8 Scell_log, u8 *stab, u32 max_P) { int delta = qth_max - qth_min; u32 max_p_delta; p->qth_min = qth_min << Wlog; p->qth_max = qth_max << Wlog; p->Wlog = Wlog; p->Plog = Plog; if (delta <= 0) delta = 1; p->qth_delta = delta; 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); /* 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; p->Scell_log = Scell_log; p->Scell_max = (255 << Scell_log); if (stab) memcpy(p->Stab, stab, sizeof(p->Stab)); } static inline int red_is_idling(const struct red_vars *v) { return v->qidlestart != 0; } static inline void red_start_of_idle_period(struct red_vars *v) { v->qidlestart = ktime_get(); } static inline void red_end_of_idle_period(struct red_vars *v) { v->qidlestart = 0; } static inline void red_restart(struct red_vars *v) { red_end_of_idle_period(v); v->qavg = 0; v->qcount = -1; } static inline unsigned long red_calc_qavg_from_idle_time(const struct red_parms *p, const struct red_vars *v) { s64 delta = ktime_us_delta(ktime_get(), v->qidlestart); long us_idle = min_t(s64, delta, p->Scell_max); int shift; /* * 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. * * v->qavg *= (1-W)^m * * 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) return v->qavg >> shift; 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. */ us_idle = (v->qavg * (u64)us_idle) >> p->Scell_log; if (us_idle < (v->qavg >> 1)) return v->qavg - us_idle; else return v->qavg >> 1; } } static inline unsigned long red_calc_qavg_no_idle_time(const struct red_parms *p, const struct red_vars *v, unsigned int backlog) { /* * NOTE: v->qavg is fixed point number with point at Wlog. * The formula below is equvalent to floating point * version: * * qavg = qavg*(1-W) + backlog*W; * * --ANK (980924) */ return v->qavg + (backlog - (v->qavg >> p->Wlog)); } static inline unsigned long red_calc_qavg(const struct red_parms *p, const struct red_vars *v, unsigned int backlog) { if (!red_is_idling(v)) return red_calc_qavg_no_idle_time(p, v, backlog); else return red_calc_qavg_from_idle_time(p, v); } static inline u32 red_random(const struct red_parms *p) { return reciprocal_divide(prandom_u32(), p->max_P_reciprocal); } static inline int red_mark_probability(const struct red_parms *p, const struct red_vars *v, unsigned long qavg) { /* The formula used below causes questions. OK. qR is random number in the interval (0..1/max_P)*(qth_max-qth_min) 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 point at Wlog, two lines below have the following floating point equivalent: max_P*(qavg - qth_min)/(qth_max-qth_min) < rnd/qcount Any questions? --ANK (980924) */ return !(((qavg - p->qth_min) >> p->Wlog) * v->qcount < v->qR); } enum { RED_BELOW_MIN_THRESH, RED_BETWEEN_TRESH, RED_ABOVE_MAX_TRESH, }; static inline int red_cmp_thresh(const struct red_parms *p, unsigned long qavg) { 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, }; static inline int red_action(const struct red_parms *p, struct red_vars *v, unsigned long qavg) { switch (red_cmp_thresh(p, qavg)) { case RED_BELOW_MIN_THRESH: v->qcount = -1; return RED_DONT_MARK; case RED_BETWEEN_TRESH: if (++v->qcount) { if (red_mark_probability(p, v, qavg)) { v->qcount = 0; v->qR = red_random(p); return RED_PROB_MARK; } } else v->qR = red_random(p); return RED_DONT_MARK; case RED_ABOVE_MAX_TRESH: v->qcount = -1; return RED_HARD_MARK; } BUG(); return RED_DONT_MARK; } static inline void red_adaptative_algo(struct red_parms *p, struct red_vars *v) { unsigned long qavg; u32 max_p_delta; qavg = v->qavg; if (red_is_idling(v)) qavg = red_calc_qavg_from_idle_time(p, v); /* v->qavg is fixed point number with point at Wlog */ 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); max_p_delta = max(max_p_delta, 1U); p->max_P_reciprocal = reciprocal_value(max_p_delta); } #endif
Name | Type | Size | Permission | Actions |
---|---|---|---|---|
9p | Folder | 0755 |
|
|
bluetooth | Folder | 0755 |
|
|
caif | Folder | 0755 |
|
|
iucv | Folder | 0755 |
|
|
netfilter | Folder | 0755 |
|
|
netns | Folder | 0755 |
|
|
nfc | Folder | 0755 |
|
|
phonet | Folder | 0755 |
|
|
sctp | Folder | 0755 |
|
|
tc_act | Folder | 0755 |
|
|
6lowpan.h | File | 10.03 KB | 0644 |
|
Space.h | File | 1.15 KB | 0644 |
|
act_api.h | File | 6.38 KB | 0644 |
|
addrconf.h | File | 12.63 KB | 0644 |
|
af_ieee802154.h | File | 1.55 KB | 0644 |
|
af_rxrpc.h | File | 2.79 KB | 0644 |
|
af_unix.h | File | 2.22 KB | 0644 |
|
af_vsock.h | File | 7.21 KB | 0644 |
|
ah.h | File | 382 B | 0644 |
|
arp.h | File | 2 KB | 0644 |
|
atmclip.h | File | 1.48 KB | 0644 |
|
ax25.h | File | 15.02 KB | 0644 |
|
ax88796.h | File | 998 B | 0644 |
|
bond_3ad.h | File | 9.79 KB | 0644 |
|
bond_alb.h | File | 6.6 KB | 0644 |
|
bond_options.h | File | 3.92 KB | 0644 |
|
bonding.h | File | 19.1 KB | 0644 |
|
busy_poll.h | File | 3.8 KB | 0644 |
|
calipso.h | File | 2.15 KB | 0644 |
|
cfg80211-wext.h | File | 1.95 KB | 0644 |
|
cfg80211.h | File | 221.24 KB | 0644 |
|
cfg802154.h | File | 10.89 KB | 0644 |
|
checksum.h | File | 4.76 KB | 0644 |
|
cipso_ipv4.h | File | 8.2 KB | 0644 |
|
cls_cgroup.h | File | 2.15 KB | 0644 |
|
codel.h | File | 5.65 KB | 0644 |
|
codel_impl.h | File | 7.98 KB | 0644 |
|
codel_qdisc.h | File | 2.9 KB | 0644 |
|
compat.h | File | 2.11 KB | 0644 |
|
datalink.h | File | 619 B | 0644 |
|
dcbevent.h | File | 1.26 KB | 0644 |
|
dcbnl.h | File | 4.2 KB | 0644 |
|
devlink.h | File | 13.25 KB | 0644 |
|
dn.h | File | 6.88 KB | 0644 |
|
dn_dev.h | File | 5.36 KB | 0644 |
|
dn_fib.h | File | 3.98 KB | 0644 |
|
dn_neigh.h | File | 968 B | 0644 |
|
dn_nsp.h | File | 5.83 KB | 0644 |
|
dn_route.h | File | 4.36 KB | 0644 |
|
dsa.h | File | 13.94 KB | 0644 |
|
dsfield.h | File | 1.11 KB | 0644 |
|
dst.h | File | 13.48 KB | 0644 |
|
dst_cache.h | File | 2.53 KB | 0644 |
|
dst_metadata.h | File | 5.39 KB | 0644 |
|
dst_ops.h | File | 2 KB | 0644 |
|
erspan.h | File | 2.11 KB | 0644 |
|
esp.h | File | 877 B | 0644 |
|
ethoc.h | File | 538 B | 0644 |
|
fib_notifier.h | File | 1.29 KB | 0644 |
|
fib_rules.h | File | 4.18 KB | 0644 |
|
firewire.h | File | 636 B | 0644 |
|
flow.h | File | 6.16 KB | 0644 |
|
flow_dissector.h | File | 7.55 KB | 0644 |
|
fou.h | File | 549 B | 0644 |
|
fq.h | File | 2.67 KB | 0644 |
|
fq_impl.h | File | 6.9 KB | 0644 |
|
garp.h | File | 2.62 KB | 0644 |
|
gen_stats.h | File | 2.34 KB | 0644 |
|
genetlink.h | File | 11.3 KB | 0644 |
|
geneve.h | File | 1.67 KB | 0644 |
|
gre.h | File | 2.99 KB | 0644 |
|
gro_cells.h | File | 443 B | 0644 |
|
gtp.h | File | 633 B | 0644 |
|
gue.h | File | 3.23 KB | 0644 |
|
hwbm.h | File | 937 B | 0644 |
|
icmp.h | File | 2.01 KB | 0644 |
|
ieee80211_radiotap.h | File | 6.63 KB | 0644 |
|
ieee802154_netdev.h | File | 9.14 KB | 0644 |
|
if_inet6.h | File | 6.13 KB | 0644 |
|
ife.h | File | 1.06 KB | 0644 |
|
ila.h | File | 498 B | 0644 |
|
inet6_connection_sock.h | File | 976 B | 0644 |
|
inet6_hashtables.h | File | 3.7 KB | 0644 |
|
inet_common.h | File | 1.89 KB | 0644 |
|
inet_connection_sock.h | File | 10.48 KB | 0644 |
|
inet_ecn.h | File | 6.02 KB | 0644 |
|
inet_frag.h | File | 4.51 KB | 0644 |
|
inet_hashtables.h | File | 12.91 KB | 0644 |
|
inet_sock.h | File | 8.25 KB | 0644 |
|
inet_timewait_sock.h | File | 3.82 KB | 0644 |
|
inetpeer.h | File | 3.29 KB | 0644 |
|
ip.h | File | 18.51 KB | 0644 |
|
ip6_checksum.h | File | 2.89 KB | 0644 |
|
ip6_fib.h | File | 10.04 KB | 0644 |
|
ip6_route.h | File | 7.63 KB | 0644 |
|
ip6_tunnel.h | File | 4.72 KB | 0644 |
|
ip_fib.h | File | 10.72 KB | 0644 |
|
ip_tunnels.h | File | 13.61 KB | 0644 |
|
ip_vs.h | File | 46.78 KB | 0644 |
|
ipcomp.h | File | 659 B | 0644 |
|
ipconfig.h | File | 811 B | 0644 |
|
ipv6.h | File | 29.97 KB | 0644 |
|
ipv6_frag.h | File | 2.54 KB | 0644 |
|
ipx.h | File | 4.4 KB | 0644 |
|
iw_handler.h | File | 20.91 KB | 0644 |
|
kcm.h | File | 4.96 KB | 0644 |
|
l3mdev.h | File | 5.86 KB | 0644 |
|
lapb.h | File | 4.75 KB | 0644 |
|
lib80211.h | File | 3.92 KB | 0644 |
|
llc.h | File | 4.41 KB | 0644 |
|
llc_c_ac.h | File | 9.31 KB | 0644 |
|
llc_c_ev.h | File | 10.68 KB | 0644 |
|
llc_c_st.h | File | 1.72 KB | 0644 |
|
llc_conn.h | File | 4.06 KB | 0644 |
|
llc_if.h | File | 2.16 KB | 0644 |
|
llc_pdu.h | File | 14.44 KB | 0644 |
|
llc_s_ac.h | File | 1.55 KB | 0644 |
|
llc_s_ev.h | File | 2.2 KB | 0644 |
|
llc_s_st.h | File | 947 B | 0644 |
|
llc_sap.h | File | 1.08 KB | 0644 |
|
lwtunnel.h | File | 5.84 KB | 0644 |
|
mac80211.h | File | 230.36 KB | 0644 |
|
mac802154.h | File | 15.27 KB | 0644 |
|
mip6.h | File | 1.58 KB | 0644 |
|
mld.h | File | 2.8 KB | 0644 |
|
mpls.h | File | 932 B | 0644 |
|
mpls_iptunnel.h | File | 827 B | 0644 |
|
mrp.h | File | 3.03 KB | 0644 |
|
ncsi.h | File | 1.92 KB | 0644 |
|
ndisc.h | File | 13.77 KB | 0644 |
|
neighbour.h | File | 15.06 KB | 0644 |
|
net_namespace.h | File | 10.08 KB | 0644 |
|
net_ratelimit.h | File | 220 B | 0644 |
|
netevent.h | File | 910 B | 0644 |
|
netlabel.h | File | 20.74 KB | 0644 |
|
netlink.h | File | 40.39 KB | 0644 |
|
netprio_cgroup.h | File | 1.24 KB | 0644 |
|
netrom.h | File | 7.68 KB | 0644 |
|
nexthop.h | File | 865 B | 0644 |
|
nl802154.h | File | 12.09 KB | 0644 |
|
nsh.h | File | 12.31 KB | 0644 |
|
p8022.h | File | 447 B | 0644 |
|
ping.h | File | 3.45 KB | 0644 |
|
pkt_cls.h | File | 17.34 KB | 0644 |
|
pkt_sched.h | File | 4.05 KB | 0644 |
|
pptp.h | File | 557 B | 0644 |
|
protocol.h | File | 4.08 KB | 0644 |
|
psample.h | File | 860 B | 0644 |
|
psnap.h | File | 351 B | 0644 |
|
raw.h | File | 2.07 KB | 0644 |
|
rawv6.h | File | 854 B | 0644 |
|
red.h | File | 10.45 KB | 0644 |
|
regulatory.h | File | 10.12 KB | 0644 |
|
request_sock.h | File | 6.46 KB | 0644 |
|
rose.h | File | 7.62 KB | 0644 |
|
route.h | File | 10.02 KB | 0644 |
|
rtnetlink.h | File | 6.13 KB | 0644 |
|
sch_generic.h | File | 23.3 KB | 0644 |
|
scm.h | File | 3.5 KB | 0644 |
|
secure_seq.h | File | 855 B | 0644 |
|
seg6.h | File | 1.66 KB | 0644 |
|
seg6_hmac.h | File | 1.65 KB | 0644 |
|
slhc_vj.h | File | 6.67 KB | 0644 |
|
smc.h | File | 440 B | 0644 |
|
snmp.h | File | 5.23 KB | 0644 |
|
sock.h | File | 69.75 KB | 0644 |
|
sock_reuseport.h | File | 863 B | 0644 |
|
stp.h | File | 383 B | 0644 |
|
strparser.h | File | 3.75 KB | 0644 |
|
switchdev.h | File | 6.52 KB | 0644 |
|
tcp.h | File | 62.8 KB | 0644 |
|
tcp_states.h | File | 1.26 KB | 0644 |
|
timewait_sock.h | File | 1.11 KB | 0644 |
|
tipc.h | File | 2.34 KB | 0644 |
|
tls.h | File | 7.12 KB | 0644 |
|
transp_v6.h | File | 2.08 KB | 0644 |
|
tso.h | File | 515 B | 0644 |
|
tun_proto.h | File | 988 B | 0644 |
|
udp.h | File | 12.82 KB | 0644 |
|
udp_tunnel.h | File | 5.12 KB | 0644 |
|
udplite.h | File | 3.83 KB | 0644 |
|
vsock_addr.h | File | 1.05 KB | 0644 |
|
vxlan.h | File | 10.43 KB | 0644 |
|
wext.h | File | 1.51 KB | 0644 |
|
wimax.h | File | 19.97 KB | 0644 |
|
x25.h | File | 9.43 KB | 0644 |
|
x25device.h | File | 387 B | 0644 |
|
xfrm.h | File | 53.72 KB | 0644 |
|