Reducing query overhead through route learning in unstructured peer-to-peer network
Journal of Network and Computer Applications
550 - 567
Item Usage Stats
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. © 2008 Elsevier Ltd. All rights reserved.
P2P query routing
Parzen windows estimation
Client server computer systems
Published Version (Please cite this version)http://dx.doi.org/10.1016/j.jnca.2008.09.001
Showing items related by title, author, creator and subject.
Şaykol, E.; Güdükbay, Uğur; Ulusoy, Özgür (Elsevier, 2005)Considering the fact that querying by low-level object features is essential in image and video data, an efficient approach for querying and retrieval by shape and color is proposed. The approach employs three specialized ...
Static index pruning in web search engines: combining term and document popularities with query views Altingovde, I. S.; Ozcan, R.; Ulusoy, O. (Association for Computing Machinery, 2012)Static index pruning techniques permanently remove a presumably redundant part of an inverted file, to reduce the file size and query processing time. These techniques differ in deciding which parts of an index can be ...
Altıngövde, İ. Ş.; Blanco, R.; Cambazoğlu, B. B.; Özcan, Rıfat; Sarıgil, Erdem; Ulusoy, Özgür (ACM, 2012-11)Despite the continuous efforts to improve the web search quality, a non-negligible fraction of user queries end up with very few or even no matching results in leading web search engines. In this work, we provide a detailed ...