Hmmm. Sounds unscalable... Is it global horizons? Does it scale sublinearly?
On Mon, Jan 02, 2006 at 06:56:55PM +0000, Michael Rogers wrote: > I haven't had time to read it properly yet, but this paper describes an > alternative approach to scalable search in f2f networks: essentially you > take a random walk and then route towards the local minimum. With a > small number of parallel inserts and a small number of parallel requests > there's a good chance that one of the requests will end up in the same > local minimum as one of the inserts. > > It sounds similar to the 0.5 routing algorithm, but it doesn't require > path compression because it doesn't try to create global minima. > > http://www.cs.umd.edu/~ruggero/papers/podc05.pdf > > Cheers, > Michael -- 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/20060104/3175196b/attachment.pgp>
