Online Social Networks (OSNs) are becoming more and more popular on the Web. Distributed Online Social Networks (DOSNs) are OSNs which do not exploit a central server for storing users data and enable users to have more control on their prole content, ensuring a higher level of privacy. In a DOSN there are some challenges to face. One of the most important challenges is the data availability problem when a user is oine. In this paper we propose DiDuSoNet, a novel P2P Distributed Online Social Network where users can exercise full access control on their data. Our system exploits trust relationships for providing a set of important social services, such as trustness, information diusion, and data availability. In this paper we show how our system manages the problem of data availability by proposing a new P2P dynamic trusted storage approach. By following the Dunbar concept, our system stores the data of a user only on a restricted number of friends which have regular contacts with him/her. Dierently from other approaches, nodes chosen to keep data replicas are not statically dened but dynamically change according to users churn. In according to our previous work, we use only 2 online prole replicas at time. By using real Facebook data traces we prove that our approach oers high availability

DiDuSoNet: A P2P architecture for Ditributed Dunbar-based Social Networks,

Guidi, Barbara;De Salve, Andrea;Ricci, Laura
2016-01-01

Abstract

Online Social Networks (OSNs) are becoming more and more popular on the Web. Distributed Online Social Networks (DOSNs) are OSNs which do not exploit a central server for storing users data and enable users to have more control on their prole content, ensuring a higher level of privacy. In a DOSN there are some challenges to face. One of the most important challenges is the data availability problem when a user is oine. In this paper we propose DiDuSoNet, a novel P2P Distributed Online Social Network where users can exercise full access control on their data. Our system exploits trust relationships for providing a set of important social services, such as trustness, information diusion, and data availability. In this paper we show how our system manages the problem of data availability by proposing a new P2P dynamic trusted storage approach. By following the Dunbar concept, our system stores the data of a user only on a restricted number of friends which have regular contacts with him/her. Dierently from other approaches, nodes chosen to keep data replicas are not statically dened but dynamically change according to users churn. In according to our previous work, we use only 2 online prole replicas at time. By using real Facebook data traces we prove that our approach oers high availability
Guidi, Barbara; Amft, Tobias; De Salve, Andrea; Graffi, Kalman; Ricci, Laura
File in questo prodotto:
Non ci sono file associati a questo prodotto.

I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.

Utilizza questo identificativo per citare o creare un link a questo documento: https://hdl.handle.net/11568/766220
Citazioni
  • ???jsp.display-item.citation.pmc??? ND
  • Scopus 49
  • ???jsp.display-item.citation.isi??? 36
social impact