> One can come up with a btree which should reduce the worst case lookup to a max > of 8 lookups for a /24. i did this once with a traffic counting system. works nice, still not perfect, but nice.
> One can come up with a btree which should reduce the worst case lookup to a max > of 8 lookups for a /24. i did this once with a traffic counting system. works nice, still not perfect, but nice.
|