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
..
loss_interval.c	[DCCP]: Simplified conditions due to use of enum:8 states	2006-12-02 21:24:38 -08:00
loss_interval.h	[DCCP]: Fix CCID3	2006-08-26 23:40:50 -07:00
Makefile	[DCCP]: Move the calc_X routines to dccp_tfrc_lib	2005-08-29 16:12:47 -07:00
packet_history.c	[DCCP]: Fix CCID3	2006-08-26 23:40:50 -07:00
packet_history.h	[DCCP]: Fix CCID3	2006-08-26 23:40:50 -07:00
tfrc.h	[DCCP]: Update contact details and copyright	2006-08-26 19:01:30 -07:00
tfrc_equation.c	[DCCP] tfrc: Binary search for reverse TFRC lookup	2006-12-03 14:53:27 -02:00