In most peer-to-peer systems, edge resources self-organize into overlay networks. At the core of Freenet-style peer-to-peer systems are insert and request algorithms that dynamically change the overlay network and replicate files on demand.

We run simulations to test how effective these algorithms are at improving the performance of subsequent queries. Motivated by the observation that the performance of the original Freenet algorithms improves less rapidly with a (more realistic) ratio of 99 requests to 1 insert than with an equal number of requests and insert, we design and test a wide range of new request algorithms that pass word of success to neighboring nodes and add additional edges to the overlay network. Our results show that performance is sensitive to (1) where to add edges and (2) how many edges to add. In comparison to the original request algorithm, our best new algorithm is able to reduce average request pathlength by up to a factor of 22.37.