--- Ken Corson <[EMAIL PROTECTED]> wrote: > (no heavy mathspeak in this one) > > It seems that there are two differing expectations about how > the datastore can specialize. Perhaps a visual representation > of keyspace can help what I'm saying - > > > 1) . . . . . ..-=*###*==--... . . . . > > > > 2) . . -*#*- . . .. -+- . .. .. -++- . . . > > > > In example 1, the keys cluster about a single point. It seems > most people expect this behavior. > > In example 2, there are multiple points of "clustering." The > existence of a clustering point reinforces that cluster, but > multiple "points" exist. > > I don't know which of these is the proper interpretation, but > I'm leaning towards #2.
2 is what happens now. 1 is easier to "learn" for another node and IMHO will lead to better routing. > And again, it is worth restating, that if the local datastore > is only able to directly respond to some small percent of the > total queries received, the datastore's specialization is far > less significant than routing specialization. Right, think of it this way if queries get answered in an average 10 HTL, there's only 10% of queries on the average node are being answered by the datastores. 90% are being routed, so it's way more important that you know where to route. __________________________________________________________________ Gesendet von Yahoo! Mail - http://mail.yahoo.de Logos und Klingelt�ne f�rs Handy bei http://sms.yahoo.de _______________________________________________ Devl mailing list [EMAIL PROTECTED] http://dodo.freenetproject.org/cgi-bin/mailman/listinfo/devl
