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
Making gnutella-like P2P systems scalable
Proceedings of the 2003 conference on Applications, technologies, architectures, and protocols for computer communications
XQuery: a query language for XML
Proceedings of the 2003 ACM SIGMOD international conference on Management of data
Measuring and analyzing the characteristics of Napster and Gnutella hosts
Multimedia Systems
Semantic Small World: An Overlay Network for Peer-to-Peer Search
ICNP '04 Proceedings of the 12th IEEE International Conference on Network Protocols
Decentralized Schemes for Size Estimation in Large and Dynamic Groups
NCA '05 Proceedings of the Fourth IEEE International Symposium on Network Computing and Applications
Search with Probabilistic Guarantees in Unstructured Peer-to-Peer Networks
P2P '05 Proceedings of the Fifth IEEE International Conference on Peer-to-Peer Computing
Distributed Uniform Sampling in Unstructured Peer-to-Peer Networks
HICSS '06 Proceedings of the 39th Annual Hawaii International Conference on System Sciences - Volume 09
Peer counting and sampling in overlay networks: random walk methods
Proceedings of the twenty-fifth annual ACM symposium on Principles of distributed computing
P2PGrid: integrating P2P networks into the Grid environment: Research Articles
Concurrency and Computation: Practice & Experience - Autonomous Grid Computing
Flashback: A Peer-to-PeerWeb Server for Flash Crowds
ICDCS '07 Proceedings of the 27th International Conference on Distributed Computing Systems
Bubblestorm: resilient, probabilistic, and exhaustive peer-to-peer search
Proceedings of the 2007 conference on Applications, technologies, architectures, and protocols for computer communications
DistriWiki:: a distributed peer-to-peer wiki network
Proceedings of the 2007 international symposium on Wikis
RaWMS - Random Walk Based Lightweight Membership Service for Wireless Ad Hoc Networks
ACM Transactions on Computer Systems (TOCS)
Efficient multi-keyword search over p2p web
Proceedings of the 17th international conference on World Wide Web
Difficulty-Aware Hybrid Search in Peer-to-Peer Networks
IEEE Transactions on Parallel and Distributed Systems
The case for a hybrid p2p search infrastructure
IPTPS'04 Proceedings of the Third international conference on Peer-to-Peer Systems
Tapestry: a resilient global-scale overlay for service deployment
IEEE Journal on Selected Areas in Communications
| Hi-index | 0.00 |
Successful search and versatile query support are two important requirements for peer-to-peer (P2P) search applications. Replication strategy is an effective approach to improve the search performance of unstructured P2P systems. However, existing replication strategies either adapt only to popular queries or incur excessive replication cost for unpopular queries. In this work, we propose HRS, a hybrid replication strategy to improve the search performance of unstructured P2P networks. By combining a query popularity independent strategy with the square-root strategy, HRS can effectively and efficiently handle both kind of queries, popular or not. We evaluate this design through mathematical proof and comprehensive simulations. Results show that HRS outperforms existing replication-based search paradigms in terms of search performance and resource consummation.