A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2005; you can also visit the original URL.
The file type is application/pdf
.
Efficient Peer-to-Peer Lookup Based on a Distributed Trie
[chapter]
2002
Lecture Notes in Computer Science
Two main approaches have been taken for distributed key/value lookup operations in peer-to-peer systems: broadcast searches [1, 2] and location-deterministic algorithms [5, 6, 7, 9] . We describe a third alternative based on a distributed trie. This algorithm functions well in a very dynamic, hostile environment, offering security benefits over prior proposals. Our approach takes advantage of working-set temporal locality and global key/value distribution skews due to content popularity. Peers
doi:10.1007/3-540-45748-8_6
fatcat:bw7eumexlngi7dkp7v6mybmhzq