Reducing query overhead through route learning in unstructured peer-to-peer network

Simple item page
buir.contributor.authorÇıracı, Salim
buir.contributor.authorUlusoy, Özgür
buir.contributor.orcidÇıracı, Salim|0000-0001-8023-9860
dc.citation.epage567en_US
dc.citation.issueNumber3en_US
dc.citation.spage550en_US
dc.citation.volumeNumber32en_US
dc.contributor.authorÇıracı, Salimen_US
dc.contributor.authorKörpeoǧlu, İ.en_US
dc.contributor.authorUlusoy, Özgüren_US
dc.date.accessioned2016-02-08T10:04:24Z
dc.date.available2016-02-08T10:04:24Z
dc.date.issued2009-05en_US
dc.departmentDepartment of Computer Engineeringen_US
dc.description.abstractIn 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.en_US
dc.identifier.doi10.1016/j.jnca.2008.09.001en_US
dc.identifier.issn1084-8045
dc.identifier.urihttp://hdl.handle.net/11693/22760
dc.language.isoEnglishen_US
dc.publisherAcademic Pressen_US
dc.relation.isversionofhttp://dx.doi.org/10.1016/j.jnca.2008.09.001en_US
dc.source.titleJournal of Network and Computer Applicationsen_US
dc.subjectP2P networksen_US
dc.subjectP2P query routingen_US
dc.subjectParzen windows estimationen_US
dc.subjectQuery cachingen_US
dc.subjectUnstructureden_US
dc.subjectClient server computer systemsen_US
dc.subjectQuery processingen_US
dc.subjectTelecommunication networksen_US
dc.subjectQuery cachingen_US
dc.titleReducing query overhead through route learning in unstructured peer-to-peer networken_US
dc.typeArticleen_US
Files
Original bundle
Now showing 1 - 1 of 1
Thumbnail Image
Name:
Reducing query overhead through route learning in unstructured peer-to-peer network.pdf
Size:
1.65 MB
Format:
Adobe Portable Document Format
Description:
Full printable version
Download
Collections
Department of Computer Engineering