TY - CONF
T1 - Distributed Coverage of Ego Networks in F2F Online Social Networks
AU - De Salve, Andrea
AU - Mori, Paolo
AU - Guidi, Barbara
AU - Salve, Andrea De
AU - Ricci, Laura
PY - 2016
Y1 - 2016
N2 - Although most online social networks rely on a centralized infrastructure, several proposals of Distributed Online Social Networks (DOSNs) have been recently presented. Since in DOSNs user profiles are stored on the peers of the users belonging to the network, one of the main challenges comes from guaranteeing the profile availability when the owner of the data is not online. In this paper, we propose a DOSN based on a friend-to-friend P2P overlay where the user's data is stored only on friend peers. Our approach is based on the ego-network concept, which models the social network from the local point of view of a single user. We propose a distributed algorithm which is based on the notion of coverage of the ego-network, assures that users store their data only on the peers of their friends, that each online user can retrieve the private data of its offline friends through a common online friend. We formalize this as a Neighbour Dominating Set problem. A set of experimental results conducted on real Facebook dataset show the effectiveness of our approach.
AB - Although most online social networks rely on a centralized infrastructure, several proposals of Distributed Online Social Networks (DOSNs) have been recently presented. Since in DOSNs user profiles are stored on the peers of the users belonging to the network, one of the main challenges comes from guaranteeing the profile availability when the owner of the data is not online. In this paper, we propose a DOSN based on a friend-to-friend P2P overlay where the user's data is stored only on friend peers. Our approach is based on the ego-network concept, which models the social network from the local point of view of a single user. We propose a distributed algorithm which is based on the notion of coverage of the ego-network, assures that users store their data only on the peers of their friends, that each online user can retrieve the private data of its offline friends through a common online friend. We formalize this as a Neighbour Dominating Set problem. A set of experimental results conducted on real Facebook dataset show the effectiveness of our approach.
KW - 1707
KW - Artificial Intelligence
KW - Computer Networks and Communications
KW - Computer Science Applications1707 Computer Vision and Pattern Recognition
KW - Data Availability
KW - Distributed Online Social Networks
KW - Friend-to-friend networks
KW - P2P
KW - 1707
KW - Artificial Intelligence
KW - Computer Networks and Communications
KW - Computer Science Applications1707 Computer Vision and Pattern Recognition
KW - Data Availability
KW - Distributed Online Social Networks
KW - Friend-to-friend networks
KW - P2P
UR - http://hdl.handle.net/10447/354903
M3 - Other
SP - 423
EP - 431
ER -