On Sun, 24 Oct 2004 20:19:55 -0400 Tobias DiPasquale <codeslinger@gmail.com> wrote: > First of all, is anyone else doing something in this area? Yes, this has been discussed on this list over the past 2 months. Let me save you some time: 1) We are already working on abstracting out the algorithmic portions of net/ipv4/fib_hash.c, see recent changeset history of this file in 2.6.x for details 2) Using the BSD Radix tree will not improve performance, it has the same algorithmic complexity as the current 32-hashtable algorithm for large routing tables 3) Once the complexity of the mid-level routing table FIB algorithms is made better, there is no evidence that this means the routing cache should be removed. You should instead evaluate it's performance after the mid-level algorithms perform acceptably. If you remove the routing cache, I don't believe you understand the implications of this. Firstly, you have to store the routing metrics for every remote host we talk to, where do you plan to store this and what will it be keyed upon? How will you handle per-socket routes? How will you handle the interface with the IPSEC layer which uses trees of routing cache entries as it's fundamental object type? Please scan the list postings, particularly on netdev, and I've even given a keynote on our planned work just the other week in Tokyo. - : send the line "unsubscribe linux-net" in the body of a message to majordomo@vger.kernel.org More majordomo info at http://vger.kernel.org/majordomo-info.html
