Date: Tue, 18 May 2004 18:47:37 -0400 From: Barney Wolff <barney@databus.com> To: Vincent Jardin <vjardin@free.fr> Cc: freebsd-net@freebsd.org Subject: Re: ia_netbroadcast Message-ID: <20040518224737.GA24171@pit.databus.com> In-Reply-To: <200405182020.28286.vjardin@free.fr> References: <20040518092439.GF845@darkness.comp.waw.pl> <20040518024346.A5068@xorpc.icir.org> <20040518100503.GG845@darkness.comp.waw.pl> <200405182020.28286.vjardin@free.fr>
next in thread | previous in thread | raw e-mail | index | archive | help
On Tue, May 18, 2004 at 08:20:26PM +0200, Vincent Jardin wrote: > > +> This said, how do you plan to handle the alias search, by > > +> implementing a per-interface hash table containing the > > +> addresses and broadcast addresses ? > > > > First I want to find all places that need fast processing and it probably > > needs hash tables for IPs and broadcasts, but I'm not sure if that's all. > >Why not a lookup using Patricia ? It is very efficient, moreover it is already > provided by net/radix.c Well, no. A trie is very efficient when the problem is to match an address with an addr/mask pair. For matching on equality, hashing is far better. -- Barney Wolff http://www.databus.com/bwresume.pdf I'm available by contract or FT, in the NYC metro area or via the 'Net.
Want to link to this message? Use this URL: <https://mail-archive.FreeBSD.org/cgi/mid.cgi?20040518224737.GA24171>