From: Steven Blake <slblake@petri-meat.com> 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? - : send the line "unsubscribe linux-net" in the body of a message to majordomo@vger.kernel.org More majordomo info at http://vger.kernel.org/majordomo-info.html
