linux/net/dccp/ccids
Gerrit Renker 2bbf29acd8 [DCCP] tfrc: Binary search for reverse TFRC lookup
This replaces the linear search algorithm for reverse lookup with
binary search.

It has the advantage of better scalability: O(log2(N)) instead of O(N).
This means that the average number of iterations is reduced from 250
(linear search if each value appears equally likely) down to at most 9.

Signed-off-by: Gerrit Renker <gerrit@erg.abdn.ac.uk>
Acked-by: Ian McDonald <ian.mcdonald@jandi.co.nz>
Signed-off-by: Arnaldo Carvalho de Melo <acme@mandriva.com>
2006-12-03 14:53:27 -02:00
..
lib [DCCP] tfrc: Binary search for reverse TFRC lookup 2006-12-03 14:53:27 -02:00
ccid2.c [DCCP]: Use `unsigned' for packet lengths 2006-12-02 21:31:02 -08:00
ccid2.h [DCCP] ccid2: Allow window to grow larger 2006-12-02 21:30:34 -08:00
ccid3.c [DCCP] ccid3: Deprecate TFRC_SMALLEST_P 2006-12-03 14:53:07 -02:00
ccid3.h [DCCP] ccid3: Deprecate TFRC_SMALLEST_P 2006-12-03 14:53:07 -02:00
Kconfig [DCCP]: Use higher RTO default for CCID3 2006-12-03 14:50:23 -02:00
Makefile [DCCP] CCID2: Initial CCID2 (TCP-Like) implementation 2006-03-20 17:41:47 -08:00