| Summary: | In this paper, we propose a query based query routing approach for unstructured peer-to-peer network. We consider two parameters to be used to selectively route query in the network. The parameters are based on the recent past query and the similarity of the past query with the query to be routed. The objective of our approach is to have a low cost but effective routing approach in unstructured peer-to-peer networks. Our approach also includes the method to take into account, the content of the query in which the query similarity is calculated as well as the query hits to determine connection reliability. Simulation results proved that our approach showed efficiency in terms of query time and network load over Most Query Hits query routing approach proposed by Yang & Molina [1], which also uses past query information for routing queries in unstructured peer-to-peer network.
|
|---|