--On Thursday, October 17, 2002 9:25 AM -0500 Stephen Gill <gillsrat_private> wrote: > Hi Carson, > State entry lookups don't actually occur in constant time. Yes they do, if you have enough memory, and a good enough hash function, such that collisions are low. The paper you mentioned argued that for the hash functions they tried, Khash > log(n)*Ktree, for reasonable values of n. It never said that the hash function time wasn't invariant with n. -- Carson _______________________________________________ firewall-wizards mailing list firewall-wizardsat_private http://honor.icsalabs.com/mailman/listinfo/firewall-wizards
This archive was generated by hypermail 2b30 : Thu Oct 17 2002 - 14:40:25 PDT