Managing gigabytes (2nd ed.): compressing and indexing documents and images
Managing gigabytes (2nd ed.): compressing and indexing documents and images
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
A local search mechanism for peer-to-peer networks
Proceedings of the eleventh international conference on Information and knowledge management
Probabilistic scalable P2P resource location services
ACM SIGMETRICS Performance Evaluation Review
Complex Queries in DHT-based Peer-to-Peer Networks
IPTPS '01 Revised Papers from the First International Workshop on Peer-to-Peer Systems
NeuroGrid: Semantically Routing Queries in Peer-to-Peer Networks
Revised Papers from the NETWORKING 2002 Workshops on Web Engineering and Peer-to-Peer Computing
Improving Search in Peer-to-Peer Networks
ICDCS '02 Proceedings of the 22 nd International Conference on Distributed Computing Systems (ICDCS'02)
Tracing a Large-Scale Peer to Peer System: An Hour in the Life of Gnutella
CCGRID '02 Proceedings of the 2nd IEEE/ACM International Symposium on Cluster Computing and the Grid
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
Fast and low-cost search schemes by exploiting localities in P2P networks
Journal of Parallel and Distributed Computing
A Search Theoretical Approach to P2P Networks: Analysis of Learning
AICT-ICIW '06 Proceedings of the Advanced Int'l Conference on Telecommunications and Int'l Conference on Internet and Web Applications and Services
Exploiting semantic clustering in the eDonkey P2P network
Proceedings of the 11th workshop on ACM SIGOPS European workshop
Distributed Data Mining in Peer-to-Peer Networks
IEEE Internet Computing
Characterizing gnutella network properties for peer-to-peer network simulation
ISCIS'05 Proceedings of the 20th international conference on Computer and Information Sciences
AP2PC'03 Proceedings of the Second international conference on Agents and Peer-to-Peer Computing
Performance Analysis and Improvement Content Discovery Protocols Over Vehicular Networks
Wireless Personal Communications: An International Journal
Modeling and optimizing Random Walk content discovery protocol over mobile ad-hoc networks
Performance Evaluation
| Hi-index | 0.00 |
In unstructured peer-to-peer networks, such as Gnutella, peers propagate query messages towards the resource holders by flooding them through the network. This is, however, a costly operation since it consumes node and link resources excessively and often unnecessarily. There is no reason, for example, for a peer to receive a query message if the peer has no matching resource or is not on the path to a peer holding a matching resource. In this paper, we present a solution to this problem, which we call Route Learning, aiming to reduce query traffic in unstructured peer-to-peer networks. In Route Learning, peers try to identify the most likely neighbors through which replies can be obtained to submitted queries. In this way, a query is forwarded only to a subset of the neighbors of a peer, or it is dropped if no neighbor, likely to reply, is found. The scheme also has mechanisms to cope with variations in user submitted queries, like changes in the keywords. The scheme can also evaluate the route for a query for which it is not trained. We show through simulation results that when compared to a pure flooding based querying approach, our scheme reduces bandwidth overhead significantly without sacrificing user satisfaction.