Applying hebbian theory to enhance search performance in unstructured social-like peer-to-peer networks

Chester S.J. Huang, Stephen J.H. Yang, Addison Y.S. Su

Research output: Contribution to journalArticlepeer-review

2 Scopus citations

Abstract

Unstructured peer-to-peer (p2p) networks usually employ flooding search algorithms to locate resources. However, these algorithms often require a large storage overhead or generate massive network traffic. To address this issue, previous researchers explored the possibility of building efficient p2p networks by clustering peers into communities based on their social relationships, creating social-like p2p networks. This study proposes a social relationship p2p network that uses a measure based on Hebbian theory to create a social relation weight. The contribution of the study is twofold. First, using the social relation weight, the query peer stores and searches for the appropriate response peers in social-like p2p networks. Second, this study designs a novel knowledge index mechanism that dynamically adapts social relationship p2p networks. The results show that the proposed social relationship p2p network improves search performance significantly, compared with existing approaches.

Original languageEnglish
Pages (from-to)591-601
Number of pages11
JournalETRI Journal
Volume34
Issue number4
DOIs
StatePublished - Aug 2012

Keywords

  • P2P query routing
  • Semantic search
  • Social networks

Fingerprint

Dive into the research topics of 'Applying hebbian theory to enhance search performance in unstructured social-like peer-to-peer networks'. Together they form a unique fingerprint.

Cite this