摘要： 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. 出版者： 한국전자통신연구원 出版日期： 2012-08 出處： ETRI Journal, 2012, 34(4), , pp.591-601 版權： 2012 ETRI 識別號： ISSN: 1225-6463 識別號： ISSN: 2233-7326 識別號： EISSN: 2233-7326 識別號： DOI: 10.4218/etrij.12.0111.0588
