Reducing query overhead through route learning in unstructured peer-to-peer network |
| |
| Authors: | Selim Ciraci ?brahim Körpeogˇlu Özgür Ulusoy |
| |
| Affiliation: | 1. The Department of Neonatology, Edmond and Lily Safra Medical Center, Tel Hashomer, Israel;2. The Thrombosis Unit and National Hemophilia Center, Tel Hashomer, Israel;3. The Department of Pediatric Hematology, Soroka Medical Center, Beer Sheba, Israel;4. The Sackler Medical School, Tel Aviv University, Israel;1. Institute for Research in Child Development, School of Psychology, University of East London, London, UK;2. Centre for Brain and Cognitive Development, Birkbeck, University of London, London, UK;3. Neurocognitive Development Lab, Faculty of Psychology, University of Warsaw, Warsaw, Poland;4. Faculty of Science & Technology, Department of Psychology, University of Westminster, London, UK;1. Department of Mathematics & Statistics, Riphah International University Islamabad, Pakistan;2. Department of Mathematics, Quaid-I-Azam University, Islamabad 44000, Pakistan |
| |
| 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. |
| |
| Keywords: | |
| 本文献已被 ScienceDirect 等数据库收录！ |
|
