On Mon, Jun 18, 2001 at 04:35:08PM -0700, Scott Miller wrote: > Sure there is. Each reference gives more information about the keyspace of > that node. As has been said, it doesnt matter how many references there are > to a node, its how (or whether) that influences how often that node is > contacted.
Perhaps, but given the current mechanism it does influence how often that node is contacted - a node will be contacted roughly in proportion to the number of references it has in the datastore, which will create a positive feedback loop and make the problem even worse. In a healthy network, the number of times the same DataSource is returned for different keys should be so small as to make the problem of throwing away data negligable. Having said that, and after some IRC discussion, I have realised that another solution which should fix the problem as a side-effect is to periodically split DataRequests and take the DataSource in the first to return. The main reason for doing this is to make the network optimise to the physical Internet by creating a bias for faster routes. Ian. -------------- next part -------------- A non-text attachment was scrubbed... Name: not available Type: application/pgp-signature Size: 232 bytes Desc: not available URL: <https://emu.freenetproject.org/pipermail/devl/attachments/20010618/d6bc5e4f/attachment.pgp>
