Low Stretch between Nearby
Kirsten Hildrum, John Kubiatowicz, and Jeremy Stribling
U.C. Berkeley Technical
A decentralized object location and routing data structure (or
DOLR) locates copies of objects in peer-to-peer networks. An efficient
DOLR finds nearby copies of objects when possible. The measure of
efficiency is stretch, the ratio of the distance traveled to find an
object to the distance to the closest copy. Previous empirical work has
shown that achieving low stretch is more difficult when objects are
nearby, and here we give one reason why this is the case.
Second, one of the important primitives for building a DOLR is finding
a nearby peer in the peer-to-peer network. We compare two techniques
for finding the nearest neighbor in a peer-to-peer network.
Postscript (1.2M), Compressed
PostScript (282K) ]
Last modified on 08/22/2004 by Kris Hildrum.