We should in the near future implement reliably exposing our peers' locations to our peers, and use it to implement using our peers' peers' locations for better routing. According to Oskar and Vive, who refer to published papers, this should significantly improve performance relative to simple greedy routing. I believe the correct algorithm is to simply route to the node which either has the closest location to the target, or whose best peer is closest to the target.
Any comments? I propose to implement the first half soon, maybe before I've finished with the current work on the client layer (which is making progress although it is a *major* piece of work and there have been various mostly non-work distractions recently). -------------- next part -------------- A non-text attachment was scrubbed... Name: not available Type: application/pgp-signature Size: 189 bytes Desc: not available URL: <https://emu.freenetproject.org/pipermail/devl/attachments/20080612/edc80e83/attachment.pgp>
