Linux kernel stable tree (mirror) https://git.radix-linux.su/kernel/linux.git/atom?h=linux-2.6.16.y 2007-10-18T15:56:27+00:00 2007-10-18T15:56:27+00:00 Ilpo Järvinen ilpo.jarvinen@helsinki.fi 2007-10-18T15:56:27+00:00 urn:sha1:c94861ff9759f5f73b49fb4f0fe0c000b82c703a Overflow can occur very easily with 32 bits, e.g., with 1 second us_idle is approx. 2^20, which leaves only 11-Wlog bits for queue length. Since the EWMA exponent is typically around 9, queue lengths larger than 2^2 cause overflow. Whether the affected branch is taken when us_idle is as high as 1 second, depends on Scell_log, but with rather reasonable configuration Scell_log is large enough to cause p->Stab to have zero index, which always results zero shift (typically also few other small indices result in zero shift). Signed-off-by: Ilpo Järvinen <ilpo.jarvinen@helsinki.fi> Signed-off-by: Adrian Bunk <bunk@kernel.org> 2005-11-05T21:02:24+00:00 Thomas Graf tgraf@suug.ch 2005-11-05T20:14:03+00:00 urn:sha1:a783474591f2eed0348e08b15934fa9a25e23b3e Extracts the RED algorithm from sch_red.c and puts it into include/net/red.h for use by other RED based modules. The statistics are extended to be more fine grained in order to differ between probability/forced marks/drops. We now reset the average queue length when setting new parameters, leaving it might result in an unreasonable qavg for a while depending on the value of W. Signed-off-by: Thomas Graf <tgraf@suug.ch> Signed-off-by: Arnaldo Carvalho de Melo <acme@mandriva.com>