While talking to jrandom, the following occurred to me: If we have two large darknets (say 1000 nodes each), and a severely limited number of connections between the two (say 10), then a typical search for a key will, unless it is very close to the location of one of the cross-links, go to the node closest to the target within the darknet it started in.
Ian has proposed that we use "performance tiered routing". In other words, we route on the fastest nodes until we stop getting closer to the target; then we route on the moderately fast nodes until we stop getting closer; then we route on all nodes (including the really slow ones) until we stop getting closer. I suggest that tunnels could usefully combine with this in situations where the network is fragmented. I don't know exactly how to do this yet, but we could have a tunnel across the barrier be shown as a really slow link for the purposes of the above algorithm. Any thoughts? I don't think this is an immediate priority, but it may need to be addressed eventually. -- Matthew J Toseland - toad at amphibian.dyndns.org Freenet Project Official Codemonkey - http://freenetproject.org/ ICTHUS - Nothing is impossible. Our Boss says so. -------------- next part -------------- A non-text attachment was scrubbed... Name: signature.asc Type: application/pgp-signature Size: 189 bytes Desc: Digital signature URL: <https://emu.freenetproject.org/pipermail/tech/attachments/20051015/9c5807d8/attachment.pgp>
