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
Tapestry: a fault-tolerant wide-area application infrastructure
ACM SIGCOMM Computer Communication Review
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
BRITE: An Approach to Universal Topology Generation
MASCOTS '01 Proceedings of the Ninth International Symposium in Modeling, Analysis and Simulation of Computer and Telecommunication Systems
[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
A General Framework for Scalability and Performance Analysis of DHT Routing Systems
DSN '06 Proceedings of the International Conference on Dependable Systems and Networks
ATEC '06 Proceedings of the annual conference on USENIX '06 Annual Technical Conference
An End-to-End Solution to Scalable Unstructured P2P Networking
P2P '07 Proceedings of the Seventh IEEE International Conference on Peer-to-Peer Computing
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
Bittorrent is an auction: analyzing and improving bittorrent's incentives
Proceedings of the ACM SIGCOMM 2008 conference on Data communication
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
A proactive low-overhead file replication scheme for structured P2P content delivery networks
Journal of Parallel and Distributed Computing
Analysis of PPLive through active and passive measurements
IPDPS '09 Proceedings of the 2009 IEEE International Symposium on Parallel&Distributed Processing
A path-traceable query routing mechanism for search in unstructured peer-to-peer networks
Journal of Network and Computer Applications
Distributed and Parallel Databases
Dynamic TTL-Based Search in Unstructured Peer-to-Peer Networks
CCGRID '10 Proceedings of the 2010 10th IEEE/ACM International Conference on Cluster, Cloud and Grid Computing
Proactive replication and search for rare objects in unstructured peer-to-peer networks
WAIM'10 Proceedings of the 11th international conference on Web-age information management
Randomized load balancing strategies with churn resilience in peer-to-peer networks
Journal of Network and Computer Applications
iDARE: Proactive Data Replication Mechanism for P2P VoD System
CIT '10 Proceedings of the 2010 10th IEEE International Conference on Computer and Information Technology
Adaptive query-caching in peer-to-peer systems
NPC'05 Proceedings of the 2005 IFIP international conference on Network and Parallel Computing
Assisted Peer-to-Peer Search with Partial Indexing
IEEE Transactions on Parallel and Distributed Systems
Distributed caching in unstructured peer-to-peer file sharing networks
Computers and Electrical Engineering
| Hi-index | 0.00 |
Unstructured peer-to-peer (P2P) networks have become a very popular architecture for content distribution in large-scale and dynamic environments. The search efficiency problem in unstructured P2P networks has not been adequately addressed so far, especially concerning search for rare objects. In this paper, we propose a proactive replication strategy to improve search efficiency for rare objects. It uses an object-probing technique for peers to decide whether or not to establish replications for their objects when they join the network. This strategy can effectively increase the popularity of rare objects in order to enhance search efficiency. We also present a rare object search algorithm to reduce the overhead caused by the replication strategy. When a peer forwards a search request, the forward probability is calculated according to its neighbors' degrees and the number of neighbors' objects. Therefore, the search request is forwarded to the peers more likely containing target objects. Simulations show that our proactive replication strategy greatly improves 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.