Subject: Re: patricia tries vs. hash for routing?

From: [email-masked] (bill davidsen)
Date: 28 Oct 2003 13:29:54 GMT

In article <[email-masked]>,
David S. Miller <[email-masked]> wrote:
| On Fri, 19 Sep 2003 14:48:37 -0700
| Kristen Carlson <[email-masked]> wrote:
| 
| > I was looking through some very old mail list discussions (1996!) on this 
| > topic, and the feeling then was that the code was optimal for < 60,000 routes.
| > Given that much has happened since then, is it still a fair assumption to say
| > that the linux routing algorithm is optimized for < 60,000 routes, but a
| > more BSD-like algorithm works better for > 60,000 routes?
| 
| That's not true at all, the current code can handle many more than
| 60,000 routes.

I don't think "optimized for" meant it wouldn't handle more, just that
performance would degrade.
-- 
bill davidsen <[email-masked]>
  CTO, TMR Associates, Inc
Doing interesting things with little computers since 1979.