| To: | davem@xxxxxxxxxx |
|---|---|
| Subject: | Re: patricia tries vs. hash for routing? |
| From: | Kristen Carlson <kristenc@xxxxxxxxxx> |
| Date: | Fri, 19 Sep 2003 14:48:37 -0700 |
| Cc: | netdev@xxxxxxxxxxx |
| Sender: | netdev-bounce@xxxxxxxxxxx |
| User-agent: | Mutt/1.4.1i |
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? Thanks, Kristen |
| <Prev in Thread] | Current Thread | [Next in Thread> |
|---|---|---|
| ||
| Previous by Date: | Re: [PATCH] wan: kill 3 "unused" warnings, Randy.Dunlap |
|---|---|
| Next by Date: | Re: [PATCH] (4/4) use system get_random_bytes in hdlcdrv, Andi Kleen |
| Previous by Thread: | Re: patricia tries vs. hash for routing?, David S. Miller |
| Next by Thread: | Re: patricia tries vs. hash for routing?, David S. Miller |
| Indexes: | [Date] [Thread] [Top] [All Lists] |