[Click] Query

[Eddie Kohler]

Hi Siddharth,

In fact, that lookup has been implemented before.  The Click anonymous CVS 
repository -- but not the Click distribution -- includes some old code in 
lib/lulea.{cc,hh} that implements a version of the Degermark et al. data 
structure.  We do not distribute the code, or hook it up to an element, as the 
algorithm is known to be patented.  Our current fastest lookup is 
RangeIPLookup; see the documentation for IPRouteTable for some benchmarking 
results.

Eddie


Siddharth Kasat wrote:
> Hi,
> 
> I am planning to implement implementing a fast look up [DEGERMARK, M., 
> BRODNIK, A., CARLSSON, S., AND PINK, S. 1997. Small forwarding tables 
> for fast routing lookups. In Proc. ACM SIGCOMM Conference (SIGCOMM ?97) 
> (Oct. 1997), pp.3?14.] using Click as one of my projects.
> 
> I would like to know if something like this has been implemented before.
> 
> Thanks,
> Siddharth
> 
> _______________________________________________
> click mailing list
> click at amsterdam.lcs.mit.edu
> https://amsterdam.lcs.mit.edu/mailman/listinfo/click