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
[15] Peer-to-Peer Architecture Case Study: Gnutella Network
P2P '01 Proceedings of the First International Conference on Peer-to-Peer Computing
A Quorum-Based Protocol for Searching Objects in Peer-to-Peer Networks
IEEE Transactions on Parallel and Distributed Systems
| Hi-index | 0.00 |
Search problem, which is to identify the peer that has a target resource object, is an important problem in Peer-to-Peer (P2P) file sharing systems. Since P2P systems maintain large and dynamic sets of peers, the search protocol is desired to be scalable and adaptive. In this paper we propose a new P2P search protocol, called Adaptive Randomized Search Protocol (ARSP), which is an efficient extension of the Quorum-Based Protocol for Searching Objects in Peer-to-Peer Networks. ARSP minimizes the communication cost of the protocol by popularity-based index dissemination of objects. The protocol works in a self-adaptive manner: it automatically adapts to the dynamics of network environments.