Randomized algorithms
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
Replication strategies in unstructured peer-to-peer networks
Proceedings of the 2002 conference on Applications, technologies, architectures, and protocols for computer communications
Can Heterogeneity Make Gnutella Scalable?
IPTPS '01 Revised Papers from the First International Workshop on Peer-to-Peer Systems
Pastry: Scalable, Decentralized Object Location, and Routing for Large-Scale Peer-to-Peer Systems
Middleware '01 Proceedings of the IFIP/ACM International Conference on Distributed Systems Platforms Heidelberg
Super-peer-based routing and clustering strategies for RDF-based peer-to-peer networks
WWW '03 Proceedings of the 12th international conference on World Wide Web
Make it fresh, make it quick: searching a network of personal webservers
WWW '03 Proceedings of the 12th international conference on World Wide Web
Routing Indices For Peer-to-Peer Systems
ICDCS '02 Proceedings of the 22 nd International Conference on Distributed Computing Systems (ICDCS'02)
Improving Search in Peer-to-Peer Networks
ICDCS '02 Proceedings of the 22 nd International Conference on Distributed Computing Systems (ICDCS'02)
Making gnutella-like P2P systems scalable
Proceedings of the 2003 conference on Applications, technologies, architectures, and protocols for computer communications
Building Low-Diameter P2P Networks
FOCS '01 Proceedings of the 42nd IEEE symposium on Foundations of Computer Science
Measurement, modeling, and analysis of a peer-to-peer file-sharing workload
SOSP '03 Proceedings of the nineteenth ACM symposium on Operating systems principles
A content model for evaluating peer-to-peer searching techniques
Proceedings of the 5th ACM/IFIP/USENIX international conference on Middleware
Random walk based node sampling in self-organizing networks
ACM SIGOPS Operating Systems Review
An Effective P2P Search Scheme to Exploit File Sharing Heterogeneity
IEEE Transactions on Parallel and Distributed Systems
International Journal of Hybrid Intelligent Systems - HIS 2007
An optimal overlay topology for routing peer-to-peer searches
Proceedings of the ACM/IFIP/USENIX 2005 International Conference on Middleware
An Efficient Index Dissemination in Unstructured Peer-to-Peer Networks
IEICE - Transactions on Information and Systems
Employing Data Driven Random Membership Subset Algorithm for QoS-Aware Peer-to-Peer Streaming
FMN '09 Proceedings of the 2nd International Workshop on Future Multimedia Networking
Proceedings of the 28th ACM symposium on Principles of distributed computing
Structuring unstructured peer-to-peer networks
HiPC'07 Proceedings of the 14th international conference on High performance computing
A tight unconditional lower bound on distributed randomwalk computation
Proceedings of the 30th annual ACM SIGACT-SIGOPS symposium on Principles of distributed computing
Review: A survey on content-centric technologies for the current Internet: CDN and P2P solutions
Computer Communications
A Read-Only Distributed Hash Table
Journal of Grid Computing
An optimal overlay topology for routing peer-to-peer searches
Middleware'05 Proceedings of the ACM/IFIP/USENIX 6th international conference on Middleware
Efficient computation of distance sketches in distributed networks
Proceedings of the twenty-fourth annual ACM symposium on Parallelism in algorithms and architectures
Journal of the ACM (JACM)
| Hi-index | 0.01 |
A great deal of work has been done to improve peer-to-peer routing by strategically moving or replicating content. However, there are many applications for which a peer-to-peer architecture might be appropriate, but in which content movement is not feasible. We argue that even in such applications, progress can be made in developing techniques that ensure efficient searches. We present several such techniques. First, we show that organizing the network into a square-root topology, where peer degrees are proportional to the square root of the popularity of their content, provides much better performance than power-law networks. Second, we present routing optimizations based on the amount of content stored at peers, and tracking the “best” peers, that can further improve performance. These and other techniques can make searches efficient, even when content movement or replication is not feasible.