If there is a consistent routing and advertising mechanism, every node will forward the query to "at most one node".
For every key, the node will select the appropriate one from its neighbours. It knows that asking a second one will be redundant, since if the key existed the first one must have known it. The current internet mechanism is also like this. If you want to connect to A from B your PC will know that A is not in its local network, so it will forward the query to one of its routers, C. It will never ask a peer D to route the packet for it even though D can also route that packet (using C) to A. > I am not quite sure how you think routing is going > to help > with bad queries? > If you are wishing to guarrenty that the document is > returned > if it is anywhere within freenet then you much > search all of > the nodes anyway, regardless of routing. > If that is not the case then nodes can just discard > messages > as they reach their bandwidth limits (I seem to > remember reading > that this is the case now), and you get a best > effort result. > > I am wondering however how the hops-to-live is > affected when the > search via the "best" node fails, and the node > restarts the query > on the second best. Is it the same as for the > original search, > decremented by 1, or what? I have read everything I > could find > and not found this. ===== 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
