Chord: A scalable peer-to-peer lookup service for internet applications
Proceedings of the 2001 conference on Applications, technologies, architectures, and protocols for computer communications
A scalable content-addressable network
Proceedings of the 2001 conference on Applications, technologies, architectures, and protocols for computer communications
Search and replication in unstructured peer-to-peer networks
ICS '02 Proceedings of the 16th international conference on Supercomputing
Viceroy: a scalable and dynamic emulation of the butterfly
Proceedings of the twenty-first annual symposium on Principles of distributed computing
Brief announcement: an overview of the content-addressable network D2B
Proceedings of the twenty-second annual symposium on Principles of distributed computing
LAND: stretch (1 + ε) locality-aware networks for DHTs
SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
Exploiting Semantic Proximity in Peer-to-Peer Content Searching
FTDCS '04 Proceedings of the 10th IEEE International Workshop on Future Trends of Distributed Computing Systems
Percolation Search in Power Law Networks: Making Unstructured Peer-to-Peer Networks Scalable
P2P '04 Proceedings of the Fourth International Conference on Peer-to-Peer Computing
Exploiting semantic clustering in the eDonkey P2P network
Proceedings of the 11th workshop on ACM SIGOPS European workshop
Statistical analysis of a p2p query graph based on degrees and their time-evolution
IWDC'04 Proceedings of the 6th international conference on Distributed Computing
Clustering in p2p exchanges and consequences on performances
IPTPS'05 Proceedings of the 4th international conference on Peer-to-Peer Systems
Clustering in peer-to-peer file sharing workloads
IPTPS'04 Proceedings of the Third international conference on Peer-to-Peer Systems
Non-searchability of random scale-free graphs
Proceedings of the twenty-sixth annual ACM symposium on Principles of distributed computing
Rappel: Exploiting interest and network locality to improve fairness in publish-subscribe systems
Computer Networks: The International Journal of Computer and Telecommunications Networking
The effect of power-law degrees on the navigability of small worlds: [extended abstract]
Proceedings of the 28th ACM symposium on Principles of distributed computing
A Least-Resistance Path in Reasoning about Unstructured Overlay Networks
Euro-Par '09 Proceedings of the 15th International Euro-Par Conference on Parallel Processing
Non-searchability of random power-law graphs
OPODIS'07 Proceedings of the 11th international conference on Principles of distributed systems
Small-world networks: from theoretical bounds to practical systems
OPODIS'07 Proceedings of the 11th international conference on Principles of distributed systems
A peer-to-peer recommender system for self-emerging user communities based on gossip overlays
Journal of Computer and System Sciences
| Hi-index | 0.00 |
It was recently observed that the user interests in P2P systems possess clustering properties that can be used to reduce the amount of traffic of flooding-based search strategies. It was also observed that the user interests possess scale-free properties that can be used for the design of routing-based search strategies. In this paper, we show that the combination of these two properties enables the design of an efficient and simple fully decentralized search strategy. This search strategy is simple in the sense that it does not require maintaining any structured overlay network topology connecting the peers. It is efficient in the sense that simulations processed on real-world traces show that lookups perform in logarithmic expected number of steps.