Actually for socket code any other binary tree will work perfectly ok -
socket code does not have wildcards (except listening sockets), so it is
possible to combine all values into one search key used in flat
one-dimensional tree - it scales as hell and allows still very high
lookup time.
As of cache usage - such trees can be combined with different protocols
to increase cache locality.
The only reason I implemented trie is that netchannels support
wildcards, that is how netfilter is implemented on top of them.
Tree with lazy deletion (i.e. without deletion at all) can be moved to
RCU very easily.
--
Evgeniy Polyakov
-
To unsubscribe from this list: send the line "unsubscribe netdev" in
the body of a message to [EMAIL PROTECTED]
More majordomo info at http://vger.kernel.org/majordomo-info.html
