RT Journal Article
T1 On exploiting social relationship and personal background for content discovery in P2P networks
A1 Han, Xiao
A1 Cuevas Rumín, Ángel
A1 Crespi, Noël
A1 Cuevas Rumín, Rubén
A1 Huang, Xiaodi
AB Content discovery is a critical issue in unstructured Peer-to-Peer (P2P) networks as nodes maintain only local network information. However, similarly without global information about human networks, one still can find specific persons via his/her friends by using social information. Therefore, in this paper, we investigate the problem of how social information (i.e., friends and background information) could benefit content discovery in P2P networks. We collect social information of 384,494 user profiles from Facebook, and build a social P2P network model based on the empirical analysis. In this model, we enrich nodes in P2P networks with social information and link nodes via their friendships. Each node extracts two types of social features – Knowledge and Similarity – and assigns more weight to the friends that have higher similarity and more knowledge. Furthermore, we present a novel content discovery algorithm which can explore the latent relationships among a node’s friends. A node computes stable scores for all its friends regarding their weight and the latent relationships. It then selects the top friends with higher scores to query content. Extensive experiments validate performance of the proposed mechanism. In particular, for personal interests searching, the proposed mechanism can achieve 100% of Search Success Rate by selecting the top 20 friends within two-hop. It also achieves 6.5 Hits on average, which improves 8x the performance of the compared methods.
PB Elsevier
SN 0167-739X
YR 2014
FD 2014-11
LK https://hdl.handle.net/10016/37395
UL https://hdl.handle.net/10016/37395
LA eng
NO This work has been funded by the European Union under the project eCOUSIN (EU-FP7-318398) and the project SITAC (ITEA2-11020). It also has been partially funded by the Spanish Government through the MINEC eeCONTENT project (TEC2011-29688-C02-02).
DS e-Archivo
RD 17 jul. 2024