Commit graph

21 commits

Author SHA1 Message Date
Ondrej Zajicek
d759c1a6f8 NEWS and version update. 2010-04-09 17:42:39 +02:00
Ondrej Zajicek
75f8861898 NEWS and version update. 2010-02-10 16:18:17 +01:00
Ondrej Zajicek
0c75411bec NEWS, version and documentation update. 2010-01-06 16:57:20 +01:00
Ondrej Zajicek
6877ff73a6 NEWS and version update. 2009-12-19 18:45:46 +01:00
Ondrej Zajicek
6a72a276f6 New version. 2009-11-19 12:53:55 +01:00
Ondrej 'Feela' Filip
f1f1e899b7 Version 1.1.5 2009-11-02 15:59:01 +01:00
Ondrej Zajicek
b5332824ea New version. 2009-10-28 20:33:08 +01:00
Ondrej Zajicek
43c7a1ffa0 New version. 2009-09-30 18:48:38 +02:00
Ondrej Zajicek
c5be5a163c NEWS and version update. 2009-08-12 10:26:42 +02:00
Ondrej Zajicek
200ede8226 NEWS and version update. 2009-06-25 14:42:25 +02:00
Ondrej Zajicek
050ceb867f Update versions. 2009-05-22 18:41:52 +02:00
Ondrej Filip
6721e2862b Build and run both IPv4 and IPv6. 2004-06-07 14:38:35 +00:00
Ondrej Filip
e677d04aeb RPM is now able to build IPv4 and IPv6 bird. 2004-06-06 17:20:16 +00:00
Ondrej Filip
c48b33292b Yes, 1.0.5 released. 2001-06-09 15:13:38 +00:00
Ondrej Filip
482bbc7396 Minor rpm changes to make RedHat happy. 2000-09-09 19:21:01 +00:00
Ondrej Filip
fdb1998202 Serious bug in ext lsa origination found. Going for 1.0.4. 2000-09-03 22:18:40 +00:00
Ondrej Filip
43dff480ef Version 1.0.3. 2000-09-03 18:13:00 +00:00
Ondrej Filip
8b6b49239f Minor bug. It does not work on non RH systems. Thanx to
Craig Bourne <cbourne@cbourne.com>
2000-08-25 12:26:03 +00:00
Ondrej Filip
6cf7e97abe Added files for RPM building. 2000-08-24 20:08:00 +00:00
Martin Mares
29ad2c9ee1 Variance estimation fixed. 1998-12-19 21:53:28 +00:00
Martin Mares
87b60bf7e8 Added several tools for fib hashing function analysis. It turned out
we can use very simple function which is monotonic with respect
to re-hashing:

	n ^= n >> 16;
	n ^= n << 10;
	h = (n >> (16 - o)) & ((1 << o) - 1);

where o is table order. Statistical analysis for both backbone routing
table and local OSPF routing tables gives values near theoretical
optimum for uniform distribution (see ips.c for formulae).

The trick is very simple: We always calculate a 16-bit hash value n and
use o most significant bits (this gives us monotonity wrt. rehashing
if we sort the chains by the value of n). The first shift/xor pair
reduces the IP address to a 16-bit one, the second pair makes higher
bits of the 16-bit value uniformly distributed even for tables containing
lots of long prefixes (typical interior routing case with 24-bit or even
longer prefixes).
1998-12-19 11:51:47 +00:00