Peer-to-Peer Non-document Content Searching Method Using User Evaluation of Semantic Vectors

Search this article

Abstract

With today's advances in peer-to-peer (P2P) techniques, a lot of non-document content has become searchable and usable. In the near future, since a huge amount of content will be distributed over the networks, not only index server searching but also P2P searching will become important because of its scalability and robustness. Typical P2P content searching services have some problems, such as low search precision ratio, significant increase in traffic and inundations of malicious content such as viruses. We propose a P2P content searching method in which a query is effectively forwarded only to peers that have indices of content semantically similar to the wanted content but not forwarded to the same peer repeatedly. It is based on the ideas of content addressable network (CAN) topology and a vector space method where vectors have a variable length. It maps non-document content to a vector space based on users' evaluations and manages the vector space or routes queries using the CAN topology control. The effectiveness of our method is shown by both analytical estimations and simulation experiments. The simulations clarified that our method is effective at improving the precision and recall ratios while reducing the amount of traffic compared with Gnutella flooding, the vector space method in which vector lengths are fixed (similar to the pSearch method), and Chord. In particular, when there was a lot of malicious content, our method exhibited a higher precision ratio than other methods.

Journal

References(17)*help

See more

Details 詳細情報について

  • CRID
    1573950402293575680
  • NII Article ID
    110007540939
  • NII Book ID
    AA10826261
  • ISSN
    09168516
  • Text Lang
    en
  • Data Source
    • CiNii Articles

Report a problem

Back to top