netdev.vger.kernel.org archive mirror
 help / color / mirror / Atom feed
* routing table improvements
@ 2004-10-25  0:19 Tobias DiPasquale
  2004-10-25  3:41 ` David S. Miller
  0 siblings, 1 reply; 2+ messages in thread
From: Tobias DiPasquale @ 2004-10-25  0:19 UTC (permalink / raw)
  To: linux-net, netdev, nf-devel

Hi all,

I am starting work on improving the routing table in Linux by removing
the route cache altogether and reimplemting the FIB with a radix tree
search implementation. However, I have some questions/RFCs before I
get too deep into it.

First of all, is anyone else doing something in this area?

Second, it doesn't look (to me) as if the lib/radix-tree.c
implementation is sufficiently generic to be used in this capacity.
What I mean is, it appears as if this code can't be used in interrupt
context, which is sort of a necessity for this particular purpose. Am
I just out of my mind or is that the case?

Finally, can anyone think of a reason not use a radix tree search for
the FIB? I was going to implement a simple binary radix tree (similar
to what FreeBSD has). I had originally thought of using something like
CEF uses (a 256-way radix tree), but this would be too
memory-intensive, IMO.

Anyone have any comments?

-- 
[ Tobias DiPasquale ]
0x636f6465736c696e67657240676d61696c2e636f6d

^ permalink raw reply	[flat|nested] 2+ messages in thread

end of thread, other threads:[~2004-10-25  3:41 UTC | newest]

Thread overview: 2+ messages (download: mbox.gz follow: Atom feed
-- links below jump to the message on this page --
2004-10-25  0:19 routing table improvements Tobias DiPasquale
2004-10-25  3:41 ` David S. Miller

This is a public inbox, see mirroring instructions
for how to clone and mirror all data and code used for this inbox;
as well as URLs for NNTP newsgroup(s).