[<prev] [next>] [<thread-prev] [thread-next>] [day] [month] [year] [list]
Message-ID: <17884.53809.880275.142372@robur.slu.se>
Date: Thu, 22 Feb 2007 00:13:53 +0100
From: Robert Olsson <Robert.Olsson@...a.slu.se>
To: David Miller <davem@...emloft.net>
Cc: dada1@...mosbay.com, andi@...stfloor.org, johnpol@....mipt.ru,
akepner@....com, linux@...izon.com, netdev@...r.kernel.org,
bcrl@...ck.org
Subject: Re: Extensible hashing and RCU
David Miller writes:
> But what about if tree lookup were free :-)
>
> This is why I consider Robert Olsson's trash work the most promising,
> if we stick sockets into his full flow identified routing cache trie
> entries, we can eliminate lookup altogether.
>
> Just like how he already uses traffic inspection to kill cache entries
> when FIN shutdown sequence is snooped, we can explicitly flush such
> entries when socket is closed fully on local system.
Below is current tree-stats from a "production" flowlogging application at a
large university (real traffic) using this full flow lookup.
With 100k flows we typically see an aver depth 1.3 and a max depth 4. Right
now there is only a dst entry in leaf nodes. So yes anything else we can put
in leaf is "free".
trie:
Aver depth: 1.31
Max depth: 4
Leaves: 99930
Internal nodes: 14925
1: 13450 2: 1465 3: 9 18: 1
Pointers: 294976
Null ptrs: 180122
Total size: 7259 kB
Cheers.
--ro
-
To unsubscribe from this list: send the line "unsubscribe netdev" in
the body of a message to majordomo@...r.kernel.org
More majordomo info at http://vger.kernel.org/majordomo-info.html
Powered by blists - more mailing lists