netdev
[Top] [All Lists]

Re: Route cache performance under stress

To: slblake@xxxxxxxxxxxxxx
Subject: Re: Route cache performance under stress
From: "David S. Miller" <davem@xxxxxxxxxx>
Date: Wed, 11 Jun 2003 23:31:22 -0700 (PDT)
Cc: fw@xxxxxxxxxxxxx, netdev@xxxxxxxxxxx, linux-net@xxxxxxxxxxxxxxx
In-reply-to: <1055214346.1199.65.camel@photon>
References: <20030608.050500.28795668.davem@xxxxxxxxxx> <874r30r9z2.fsf@xxxxxxxxxxxxx> <1055214346.1199.65.camel@photon>
Sender: netdev-bounce@xxxxxxxxxxx
   From: Steven Blake <slblake@xxxxxxxxxxxxxx>
   Date: 09 Jun 2003 23:05:47 -0400

   http://www.petri-meat.com/slblake/networking/refs/lpm_pkt-class/
   
Interesting link, thanks for mentioning it.

   IMHO, the best LPM algorithm (in terms of balancing lookup speed vs.
   memory consumption vs. update rate) is CRT, described in the first paper
   [ASIK].  It is patented, but there is hope that it might get released
   under GPL in the near future.

It would be nice if this actually was a "paper", but it's
a patent entry, such things are always so cryptic.  Is there
a real paper on this scheme?

<Prev in Thread] Current Thread [Next in Thread>