Search and replication in unstructured peer-to-peer networks
ICS '02 Proceedings of the 16th international conference on Supercomputing
A local search mechanism for peer-to-peer networks
Proceedings of the eleventh international conference on Information and knowledge management
Routing Indices For Peer-to-Peer Systems
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
Adaptive Probabilistic Search for Peer-to-Peer Networks
P2P '03 Proceedings of the 3rd International Conference on Peer-to-Peer Computing
Making Search Efficient on Gnutella-Like P2P Systems
IPDPS '05 Proceedings of the 19th IEEE International Parallel and Distributed Processing Symposium (IPDPS'05) - Papers - Volume 01
| Hi-index | 0.00 |
Peer-to-peer (P2P) networking is designed for sharing resources at the edge of the Internet. Searching in file-sharing P2P networks has been an important research topic, and it has drawn significant attention recently. Hints can be utilized to improve query success rates. Determining how to efficiently and effectively propagate hints is a challenging issue. In this paper, we propose a searching protocol called HS-SDBF (Hint-based Search by Scope Decay Bloom Filter) that addresses this issue. HS-SDBF uses a data structure named SDBF (Scope Decay Bloom Filter) to represent and propagate probabilistic hints. Compared to existing proactive schemes, HS-SDBF can answer many more queries successfully at a lower amortized cost considering both the query traffic and hint propagation traffic. The experimental results support the performance improvement of our protocol.