Date: Sun, 01 Jul 2001 15:52:44 -0600 From: Wes Peters <wes@softweyr.com> To: Bakul Shah <bakul@bitblocks.com> Cc: Ruslan Ermilov <ru@FreeBSD.org>, Deepak Jain <deepak@ai.net>, net@FreeBSD.org, hackers@FreeBSD.org Subject: Re: fastforwarding? Message-ID: <3B3F9BAC.782B8E00@softweyr.com> References: <200107011700.NAA07500@tonnant.cnchost.com>
next in thread | previous in thread | raw e-mail | index | archive | help
Bakul Shah wrote:
>
> IMHO you are better off using a recent route lookup algorithm
> than messing with caches. The PATRICIA tree algorithm is
> what 33 years old now?
Not true. Any routing algorithm takes longer because they are by
definition a "fuzzy match." The fastforward algorithm is not, it
is a simple destination address lookup; the cached route is either
there or it is not. Fast hashing algorithms are quite effective
in locating the route if it has been cached. Routing switches
usually speed up the lookup even further by using Content Addressable
Memory to map the destination address to a cached route or interface
pointer; it would be interesting to experiment with something like
that in FreeBSD.
--
"Where am I, and what am I doing in this handbasket?"
Wes Peters Softweyr LLC
wes@softweyr.com http://softweyr.com/
To Unsubscribe: send mail to majordomo@FreeBSD.org
with "unsubscribe freebsd-net" in the body of the message
Want to link to this message? Use this URL: <https://mail-archive.FreeBSD.org/cgi/mid.cgi?3B3F9BAC.782B8E00>