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

S. Ciraci, Ibrahim Körpeoglu, Özgür Ulusoy

    Research output: Contribution to journalArticleAcademicpeer-review

    14 Citations (Scopus)

    Abstract

    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.
    Original languageUndefined
    Article number10.1016/j.jnca.2008.09.001
    Pages (from-to)550-567
    Number of pages18
    JournalJournal of network and computer applications
    Volume32
    Issue number3
    DOIs
    Publication statusPublished - May 2009

    Keywords

    • EWI-17669
    • P2P networks
    • P2P query routing
    • IR-70342
    • Query caching
    • Unstructured
    • METIS-266509
    • Parzen Windows estimation

    Cite this