Randomized algorithms
ACM Transactions on Information Systems (TOIS)
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
Modern Information Retrieval
An adaptive peer-to-peer network for distributed caching of OLAP results
Proceedings of the 2002 ACM SIGMOD international conference on Management of data
A local search mechanism for peer-to-peer networks
Proceedings of the eleventh international conference on Information and knowledge management
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
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
Enhancing P2P file-sharing with an internet-scale query processor
VLDB '04 Proceedings of the Thirtieth international conference on Very large data bases - Volume 30
Efficient peer-to-peer keyword searching
Proceedings of the ACM/IFIP/USENIX 2003 International Conference on Middleware
Quickly routing searches without having to move content
IPTPS'05 Proceedings of the 4th international conference on Peer-to-Peer Systems
An Effective P2P Search Scheme to Exploit File Sharing Heterogeneity
IEEE Transactions on Parallel and Distributed Systems
Optimal proactive caching in peer-to-peer network: analysis and application
Proceedings of the sixteenth ACM conference on Conference on information and knowledge management
Scalable tag search in social network applications
Computer Communications
Exploiting parallelism in the design of peer-to-peer overlays
Computer Communications
Self-managed topologies in P2P networks
Computer Networks: The International Journal of Computer and Telecommunications Networking
IPBGA: a hybrid P2P based grid architecture by using information pool protocol
The Journal of Supercomputing
On the feasibility of unstructured peer-to-peer information retrieval
ICTIR'11 Proceedings of the Third international conference on Advances in information retrieval theory
Review: A survey on content-centric technologies for the current Internet: CDN and P2P solutions
Computer Communications
STAIRS: Towards efficient full-text filtering and dissemination in DHT environments
The VLDB Journal — The International Journal on Very Large Data Bases
Query Adaptation Techniques in Temporal-DHT for P2P Media Streaming Applications
International Journal of Multimedia Data Engineering & Management
Hi-index | 0.00 |
Unstructured peer-to-peer networks are frequently used as the overlay in various middleware toolkits for emerging applications, from content discovery to query result caching to distributed collaboration. Often it is assumed that unstructured networks will form a power-law topology; however, a power-law structure is not the best topology for an unstructured network. In this paper, we introduce the square-root topology, and show that this topology significantly improves routing performance compared to power-law networks. In the square-root topology, the degree of a peer is proportional to the square root of the popularity of the content at the peer. Our analysis shows that this topology is optimal for random walk searches. We also present simulation results to demonstrate that the square-root topology is better, by up to a factor of two, than a power-law topology for other types of search techniques besides random walks. We then describe a decentralized algorithm for forming a square-root topology, and evaluate its effectiveness in constructing efficient networks using both simulations and experiments with our implemented prototype. Our results show that the square-root topology can provide a significant performance improvement over power-law topologies and other topology types.