What you say below is "advertising". Do you mean, for every insert the data is replicated to HTL (100) hosts? Than this is advertising and it will have a better finding ratio (much better than %0.1, see my previuos reply).
But there is still chance that a new node will not be able to locate a newly inserted data from another new node. > There is no need for "key advertisement", as each > node will figure out a value of the key being > searched for. It then looks through a list of nodes > (in which nodes are paired up with a key value that > they had previously inserted or requested) and then > finds the node containing a key value which is > closest to the key value being searched for. A > similar process goes on during insertion (it inserts > to the node with the closest key value). > > BTW--Ian Clark already used this as a thesis. ===== Sukru Tikves, Hacettepe University Computer Engineering Department, Ankara http://piskare.cjb.net __________________________________________________ Do You Yahoo!? Listen to your Yahoo! Mail messages from any phone. http://phone.yahoo.com _______________________________________________ freenet-tech mailing list [EMAIL PROTECTED] http://lists.freenetproject.org/mailman/listinfo/tech
