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 the objects are nearby, and here we give one reason why that is the case.
Second, one of the primitives used 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.
Title
Low Stretch between Nearby Peers
Published
2004-06-01
Full Collection Name
Electrical Engineering & Computer Sciences Technical Reports
Other Identifiers
CSD-04-1328
Type
Text
Extent
7 p
Archive
The Engineering Library
Usage Statement
Researchers may make free and open use of the UC Berkeley Library’s digitized public domain materials. However, some materials in our online collections may be protected by U.S. copyright law (Title 17, U.S.C.). Use or reproduction of materials protected by copyright beyond that allowed by fair use (Title 17, U.S.C. § 107) requires permission from the copyright owners. The use or reproduction of some materials may also be restricted by terms of University of California gift or purchase agreements, privacy and publicity rights, or trademark law. Responsibility for determining rights status and permissibility of any use or reproduction rests exclusively with the researcher. To learn more or make inquiries, please see our permissions policies (https://www.lib.berkeley.edu/about/permissions-policies).
