Re: Trees have one root

[Date Prev][Date Next][Thread Prev][Thread Next][Date Index][Thread Index]

 




on 7/31/2002 10:23 AM Keith Moore wrote:
>>>False.  The caching system means that the roots don't pay per query;
>>>they pay per cache miss--and the number of cache misses is going to be
>>>roughly proportional to the number of TLDs.
>>
>>The number of cache misses will be in relation to the frequency at which
>>queries arrive versus the TTL for the TLD's authoritative servers. The
>>number of TLDs is completely irrelevant.
> 
> 
> the latter statement is false, because the more TLDs there are, the more
> potential cache misses for some TLD (thus requiring a query to a root server)
> at any resolver.

First of all, the statement is not false in the context of the original
comment (that the number of TLDs is a factor of cache misses).

As to your point, I will simply reiterate that the function remains to be
bound by frequency, and thus the quantity of queries over time. The number
of cache misses will not double unless and until you double the number of
out-of-window queries. A TLD which never gets queried has no misses.

-- 
Eric A. Hall                                        http://www.ehsco.com/
Internet Core Protocols          http://www.oreilly.com/catalog/coreprot/


[Index of Archives]     [IETF Annoucements]     [IETF]     [IP Storage]     [Yosemite News]     [Linux SCTP]     [Linux Newbies]     [Fedora Users]