| To: | "David S. Miller" <davem@xxxxxxxxxx> |
|---|---|
| Subject: | Re: Route cache performance under stress |
| From: | Florian Weimer <fw@xxxxxxxxxxxxx> |
| Date: | Sun, 08 Jun 2003 15:10:25 +0200 |
| Cc: | netdev@xxxxxxxxxxx, linux-net@xxxxxxxxxxxxxxx |
| In-reply-to: | <20030608.050500.28795668.davem@xxxxxxxxxx> (David S. Miller's message of "Sun, 08 Jun 2003 05:05:00 -0700 (PDT)") |
| References: | <87wuge59w2.fsf@xxxxxxxxxxxxx> <20030526.233211.54217447.davem@xxxxxxxxxx> <87he70re62.fsf@xxxxxxxxxxxxx> <20030608.050500.28795668.davem@xxxxxxxxxx> |
| Sender: | netdev-bounce@xxxxxxxxxxx |
| User-agent: | Gnus/5.1001 (Gnus v5.10.1) Emacs/21.3 (gnu/linux) |
"David S. Miller" <davem@xxxxxxxxxx> writes: > Although, I hope it's not "too similar" to what CEF does because > undoubtedly Cisco has a bazillion patents in this area. Most things in this area are patented, and the patents are extremely fuzzy (e.g. policy-based routing with hierarchical sequence of decisions has been patented countless times). 8-( > This is actually an argument for coming up with out own algorithms > without any knowledge of what CEF does or might do. :( The branchless variant is not described in the IOS book, and I can't tell if Cisco routers use it. If this idea is really novel, we are in pretty good shape because we no longer use trees, tries or whatever, but a DFA. 8-) Further parameters which could be tweaked is the kind of adjacency information (where to store the L2 information, whether to include the prefix length in the adjacency record etc.). |
| Previous by Date: | Re: Route cache performance under stress, David S. Miller |
|---|---|
| Next by Date: | Re: [PATCH][IPV6] keeping dst refcnt correctly with using xfrm, James Morris |
| Previous by Thread: | Re: Route cache performance under stress, David S. Miller |
| Next by Thread: | Re: Route cache performance under stress, Simon Kirby |
| Indexes: | [Date] [Thread] [Top] [All Lists] |