Interest-based peer selection in P2P network

Harry Chiou, Addison Su, Stephen Yang

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

4 Scopus citations

Abstract

Currently most distributed peer-to-peer network systems send to other peers when users' query request, but their search result is a great deal of needless answer as gap between their search goal and their information need. It is because each peers own different interest domain knowledge. However, we purpose interest-based peer selection in order to rank best peers under the user context with content retrieval tasks. Generally speaking, providers may be best peers what user want find. Providers can satisfy users' information need, if we figure out providers what are user search goal. Based on ACM domain knowledge, we propose reference ontology in order to calculate the semantic similarity under each peer preferences, and rank best peers. Feedback data is updated ontological user profile by user activities and content retrieval tasks. Our approach can satisfy users' information need and reduce their search time-consuming.

Original languageEnglish
Title of host publication2008 IEEE International Conference on Sensor Networks, Ubiquitous, and Trustworthy Computing, SUTC 2008
Pages549-554
Number of pages6
DOIs
StatePublished - 2008
Event2008 IEEE International Conference on Sensor Networks, Ubiquitous, and Trustworthy Computing, SUTC 2008 - Taichung, Taiwan
Duration: 11 Jun 200813 Jun 2008

Publication series

NameProceedings - IEEE International Conference on Sensor Networks, Ubiquitous, and Trustworthy Computing

Conference

Conference2008 IEEE International Conference on Sensor Networks, Ubiquitous, and Trustworthy Computing, SUTC 2008
Country/TerritoryTaiwan
CityTaichung
Period11/06/0813/06/08

Keywords

  • ACM
  • Interest
  • JXTA
  • Peer selection
  • Similarity

Fingerprint

Dive into the research topics of 'Interest-based peer selection in P2P network'. Together they form a unique fingerprint.

Cite this