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
[15] Peer-to-Peer Architecture Case Study: Gnutella Network
P2P '01 Proceedings of the First International Conference on Peer-to-Peer Computing
Search with Probabilistic Guarantees in Unstructured Peer-to-Peer Networks
P2P '05 Proceedings of the Fifth IEEE International Conference on Peer-to-Peer Computing
ATEC '06 Proceedings of the annual conference on USENIX '06 Annual Technical Conference
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
EAD: An Efficient and Adaptive Decentralized File Replication Algorithm in P2P File Sharing Systems
P2P '08 Proceedings of the 2008 Eighth International Conference on Peer-to-Peer Computing
Adaptive query-caching in peer-to-peer systems
NPC'05 Proceedings of the 2005 IFIP international conference on Network and Parallel Computing
Proactive replication for rare objects in unstructured peer-to-peer networks
Journal of Network and Computer Applications
Hi-index | 0.00 |
The search efficiency problem in unstructured peer-to-peer network has not been adequately addressed so far, especially concerning search for rare objects. In this paper, we propose a proactive replication strategy to improve the search efficiency for rare objects. It uses object probing technique for peers to decide whether to establish replications for their objects or not when they join the network. This strategy can effectively increase the popularity of rare objects so as to enhance the search efficiency. We also present a rare object search algorithm. When a peer forwards a search request, forward probability is calculated according to its neighbors' degree and the number of neighbors' objects. Therefore, the search request is forwarded to the peers more likely containing target objects. Simulations show that the proactive replication strategy greatly improves the search efficiency for rare objects with moderate communication overhead. The rare object search algorithm not only improves search efficiency for rare objects, but also achieves load balance in search.