Looks like a bit like a 1/N curve to me, so you update twice as frequently, it takes half the time (I think).
Ian. On 21 Aug 2006, at 15:13, Matthew Toseland wrote: > Any idea why? > > On Sun, Aug 20, 2006 at 07:13:37PM -0700, Ian Clarke wrote: >> Attached find a graph indicating how long it takes a 10,000 greedy >> routing network to reach an average path length of 10 for varying >> probabilities of updating a node's connections through destination >> sampling. As can be seen, performance improves rapidly until around >> 0.25, then the benefits get smaller and smaller. >> >> Ian. > -- > Matthew J Toseland - toad at amphibian.dyndns.org > Freenet Project Official Codemonkey - http://freenetproject.org/ > ICTHUS - Nothing is impossible. Our Boss says so. > _______________________________________________ > Tech mailing list > Tech at freenetproject.org > http://emu.freenetproject.org/cgi-bin/mailman/listinfo/tech Ian Clarke: Co-Founder & Chief Scientist Revver, Inc. phone: 323.871.2828 | personal blog - http://locut.us/blog -------------- next part -------------- An HTML attachment was scrubbed... URL: <https://emu.freenetproject.org/pipermail/tech/attachments/20060821/64f8b46e/attachment.html> -------------- next part -------------- A non-text attachment was scrubbed... Name: PGP.sig Type: application/pgp-signature Size: 186 bytes Desc: This is a digitally signed message part URL: <https://emu.freenetproject.org/pipermail/tech/attachments/20060821/64f8b46e/attachment.pgp>
