ACL List Problems: first tests with binary trees

In article <Pine.LNX.3.91.961016175144.12088A-100000@supernet.net> you write:

>I have an obvious interest (along with many others) in this type of
>speedup. BTW my problem with the acl.list file turned out to be a '|'
>character that had managed to get into the file in an inappropiate
>place. I am now running with ~ 16000 records. The speed up is still
>needed.

I did some testing with a public domain binary tree library and the first
test are very promising. Below the results for various numbers of domains
stored in a binary tree and the number of microseconds required per lookup
call. The tests were done on a P5/133 with FreeBSD.

# of nodes microsecs per lookup call
-----------------------------------------
      1000 34
     10000 45
    100000 56

This means roughly that we can do approx. 20000 lookups per second for a
domainlist with 100000 entries. I think that should be enough :-).

Now I still have to integrate it into Squid and test it. Stay tuned.

Arjan
Received on Thu Oct 17 1996 - 15:58:29 MDT