[Click] TrieIPLookup element and routing cache

[Eddie Kohler]

Hi Davide,

You're right: most of our routing elements do not have a cache.  
LinearIPLookup and friends do have a one- or two-element cache, but 
that's it.

I have nooooooooo idea how TrieIPLookup works.  Maybe Robert Morris can 
give a pointer; his student implemented it in 2003.  But it does seem 
to work (at least based on a set of trivial regression tests).

There is an ARP cache.

We'd be interested in elements that implement routing caches -- 
particularly if they are separate from the routing table elements 
themselves.  A nice project.

Eddie


On Feb 14, 2005, at 1:51 AM, Davide Bolognesi wrote:

> Hi,
>
> I'm Davide Bolognesi, I'm a student at Politecnico di Torino, Italy.
> I'm working on the E.U.R.O project
> (http://www.diit.unict.it/euro/index_en.htm) for my Laurea degree
> thesis.
>
> I've downloaded Click-1.4.3 and I would like to know more about the
> TrieIPLookup element: could you please point me to a paper/book
> describing the algorithm implemented? I've already read the comments in
> the C++ code, and I haven't found any clue!
>
> All *IPLookup elements seem to have only minimal routing cache support,
> is anybody aware of any element that implements a better routing cache?
>
> What about ARP elements? Do they implement any ARP cache?
>
> Thank you in advance for any help,
>
> Cheers,
>
> _______________________________________________
> click mailing list
> click at amsterdam.lcs.mit.edu
> https://amsterdam.lcs.mit.edu/mailman/listinfo/click