[bind10-dev] initial memo on recursive server performance research

[Likun Zhang]

Hi Jerry,

> Jerry Scharf
> Sent: Thursday, July 05, 2012 1:08 AM
> To: bind10-dev at lists.isc.org
> Subject: Re: [bind10-dev] initial memo on recursive server performance
> research
> 
> Jinmei,
> 
> On your second point.
> 
> Would it be possible to do the analysis for the actual cache hit rate
> rather than just the name appearing? Many of the popular web sites use
> short ttls (30-300s) for the main target. which reduces the
> effectiveness of caching.

Pre-fetch may helps here. the entries in cache will be refetched before they expire, in the last 10s, etc. but if the ttl is too short(less than 10s? we can give a min-ttl to stop it, :) ), it doesn't work.


> I really like the idea of a fast L1 cache per auth. The idea of an added
> a hast test/ttl check and L1 cache store to misses in return for not
> walking the tree/rebuilding the answer for popular queries seems like it
> would be a big win. All you need to do is fix the ttls and wrapper and
> it's ready to go. You will have to think a little bit about victim
> selection when a new cache entry comes in. You would like to victimize
> entries that have no hits before google.com gets replaced. When you get
> to views, you will need an L1 per view.
> 
> I wish I had thought of this when I was working on the trend recursive
> server. It may be a cheap 20% increase in performance.
 
Are you talking about authoritative server here? if not, does recursive server need to support views?

Likun