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. -------------- next part -------------- A non-text attachment was scrubbed... Name: time to stability Vs samp freq.jpg Type: image/jpeg Size: 96639 bytes Desc: not available URL: <https://emu.freenetproject.org/pipermail/tech/attachments/20060820/de341955/attachment.jpg> -------------- next part --------------
