Re: Trees have one root

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

 



> From: "Eric A. Hall" <ehall@ehsco.com>

> ...
> 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.

Reiterating nonsense does not change its character.

That particular reiteration of Mr. Hall's thesis contains two valid
statements that are either independent of his original thesis or that
contradict it.  It is not clear what Mr. Hall intends by his first
sentence.

As far as I can tell, Mr. Hall supports the notion that dividing one
of the current large TLDs into N smaller, approximately equal sized,
each quite large TLDs would not cause an approximately linear increase
of N times as many hits on the roots.  An equivalent statement is that
combining N of the current large TLDs into a single TLD would not
reduce the number of queries for the roots by a factor of N.

Mr. Hall's thesis has been disproven in several recent comments.  I
think one of those comments came from Mr. Hall himself.  That comment
was when he noted that his server's cache had entries for both .com
and .edu.  Those two entries required his server to query the roots
twice.  If .com and .edu were merged, then Mr. Hall's own servers
would have made half as many queries of the roots.


Vernon Schryver    vjs@rhyolite.com


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