On Fri, Aug 28, 2009 at 6:46 PM, Michael Yip<mhy831 at cs.bham.ac.uk> wrote: > But then how come the routing is done by choosing the node whose > location offers shortest distance to the key?
Because that's how you find the key. Keys are expected to be stored near their location, so you look for them near their location. Evan Daniel > > Martin Scheffler wrote: >> Am Freitag, 28. August 2009 08:48:09 schrieb Michael Yip: >> >>> Just a simple question: >>> >>> Does it mean that the key would be closest to the location of the data >>> source node? >>> >>> ... >>> >> >> no, the key is determined by the content. >> the routing tries to push the data into the right direction where it can be >> found later. >> all the keys that the source node inserts are going different ways. >> if your node is neighbour of the source node you will only see some keys from >> the insert which are in your keyspace. >> and even when your "cancer nodes" dominate the routing table of the source >> node, you can't know the content until you have the URI to access it. >> >> good byte >> >> ------------------------------------------------------------------------ >> >> _______________________________________________ >> Devl mailing list >> Devl at freenetproject.org >> http://emu.freenetproject.org/cgi-bin/mailman/listinfo/devl > > _______________________________________________ > Devl mailing list > Devl at freenetproject.org > http://emu.freenetproject.org/cgi-bin/mailman/listinfo/devl >
