Quick forwarding of queries to relevant peers in a hierarchical p2p file search system

  • Authors:
  • Tingting Qin;Qi Cao;Qiying Wei;Satoshi Fujita

  • Affiliations:
  • Graduate School of Engineering, Department of Information Engineering, Hiroshima University, Hiroshima, Japan;Graduate School of Engineering, Department of Information Engineering, Hiroshima University, Hiroshima, Japan;Graduate School of Engineering, Department of Information Engineering, Hiroshima University, Hiroshima, Japan;Graduate School of Engineering, Department of Information Engineering, Hiroshima University, Hiroshima, Japan

  • Venue:
  • ICA3PP'10 Proceedings of the 10th international conference on Algorithms and Architectures for Parallel Processing - Volume Part II
  • Year:
  • 2010

Quantified Score

Hi-index 0.00

Visualization

Abstract

In this paper, we propose a new file search scheme for a three-tier Peer-to-Peer (P2P) architecture. The proposed scheme consists of two parts. The first part determines a way of associating files held by each peer in the bottom layer to subservers in the middle layer, where each subserver plays the same role with the (centralized) server in conventional search engines such as Google and Yahoo!. The second part provides a way of forwarding a query received by the central server in the top layer to an appropriate subserver relevant to the query. The proposed scheme is based on the notion of “tags”, and a technique of priority sequence of tags is introduced to realize a quick forwarding of queries. The result of performance evaluation indicates that the number of tags which must be examined in forwarding a given query is bounded by a small constant.