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

Yoji YAMATO; Hiroshi SUNAGA

doi:10.1093/ietcom/e89-b.9.2309

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

Yoji YAMATO, Hiroshi SUNAGA

Full Text Views

0

Cite this

Summary :

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.

Publication: IEICE TRANSACTIONS on Communications Vol.E89-B No.9 pp.2309-2318

Publication Date: 2006/09/01

Publicized

Online ISSN: 1745-1345

DOI: 10.1093/ietcom/e89-b.9.2309

Type of Manuscript: Special Section PAPER (Special Section on Networking Technologies for Overlay Networks)

Category

Cite this

Copy

Yoji YAMATO, Hiroshi SUNAGA, "Peer-to-Peer Non-document Content Searching Method Using User Evaluation of Semantic Vectors" in IEICE TRANSACTIONS on Communications, vol. E89-B, no. 9, pp. 2309-2318, September 2006, doi: 10.1093/ietcom/e89-b.9.2309.
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.
URL: https://global.ieice.org/en_transactions/communications/10.1093/ietcom/e89-b.9.2309/_p

Copy

@ARTICLE{e89-b_9_2309,
author={Yoji YAMATO, Hiroshi SUNAGA, },
journal={IEICE TRANSACTIONS on Communications},
title={Peer-to-Peer Non-document Content Searching Method Using User Evaluation of Semantic Vectors},
year={2006},
volume={E89-B},
number={9},
pages={2309-2318},
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.},
keywords={},
doi={10.1093/ietcom/e89-b.9.2309},
ISSN={1745-1345},
month={September},}

Copy

TY - JOUR
TI - Peer-to-Peer Non-document Content Searching Method Using User Evaluation of Semantic Vectors
T2 - IEICE TRANSACTIONS on Communications
SP - 2309
EP - 2318
AU - Yoji YAMATO
AU - Hiroshi SUNAGA
PY - 2006
DO - 10.1093/ietcom/e89-b.9.2309
JO - IEICE TRANSACTIONS on Communications
SN - 1745-1345
VL - E89-B
IS - 9
JA - IEICE TRANSACTIONS on Communications
Y1 - September 2006
AB - 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.
ER -