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
Can Heterogeneity Make Gnutella Scalable?
IPTPS '01 Revised Papers from the First International Workshop on Peer-to-Peer Systems
Making gnutella-like P2P systems scalable
Proceedings of the 2003 conference on Applications, technologies, architectures, and protocols for computer communications
A study of scalable search algorithm on unstructured P2P system
Proceedings of the 2nd international conference on Scalable information systems
| Hi-index | 0.00 |
In the unstructured peer-to-peer networks, the network topology and the placement of files are largely unconstrained. Gnutella is one of the prominent unstructured P2P networks. The primitive search in Gnutella is flooding-based search and the search region is constrained by TTL value. The scheme produces too much traffic though with limited search region. In addition, many of the peers in Gnutella are free riders, which waste too much traffic without contribution. In this paper, we propose several retrieval schemes to unstructured P2P network to extend the search region but reduce the search traffic, and also balance the network load, so that can acquire the whole networks scalable.