Towards robust and scalable peer-to-peer social networks

Peer-to-peer Online Social Networks (OSNs) promise to combine the functionalities of centralized OSNs with the good properties of peer-to-peer systems. However, in time, the number of connections between users of OSNs grows super-linearly in the number of users: the average node degree increases with the overall system size. In large-scale settings, mapping each friendship relation into an overlay link will thus overwhelm popular nodes. We propose simple techniques to build and maintain the peer-to-peer OSN overlay while significantly shifting node degrees towards lower ranges. We evaluate our algorithms using real large-scale datasets, and show that they can disseminate information efficiently while controlling node degrees, even in the presence of high churn.

[1]  Amit P. Sheth,et al.  Privacy-Aware and Scalable Content Dissemination in Distributed Social Networks , 2011, SEMWEB.

[2]  Sonja Buchegger,et al.  PeerSoN: P2P social networking: early experiences and insights , 2009, SNS '09.

[3]  Alberto Montresor,et al.  Efficient dissemination in decentralized social networks , 2011, 2011 IEEE International Conference on Peer-to-Peer Computing.

[4]  Christos Faloutsos,et al.  Graphs over time: densification laws, shrinking diameters and possible explanations , 2005, KDD '05.

[5]  Yoav Tock,et al.  SpiderCast: a scalable interest-aware overlay for topic-based pub/sub communication , 2007, DEBS '07.

[6]  Rajesh Sharma,et al.  GoDisco: Selective Gossip Based Dissemination of Information in Social Community Based Overlays , 2011, ICDCN.

[7]  Refik Molva,et al.  Safebook: A privacy-preserving online social network leveraging on real-life trust , 2009, IEEE Communications Magazine.

[8]  Karl Aberer,et al.  Privacy-Aware and Highly-Available OSN Profiles , 2010, 2010 19th IEEE International Workshops on Enabling Technologies: Infrastructures for Collaborative Enterprises.

[9]  Sonja Buchegger,et al.  A case for P2P infrastructure for social networks - opportunities & challenges , 2009, 2009 Sixth International Conference on Wireless On-Demand Network Systems and Services.

[10]  Michael Backes,et al.  A Security API for Distributed Social Networks , 2011, NDSS.

[11]  Anne-Marie Kermarrec,et al.  The Gossple Anonymous Social Network , 2010, Middleware.

[12]  Marco Rosa,et al.  Four degrees of separation , 2011, WebSci '12.

[13]  Lars Backstrom,et al.  The Anatomy of the Facebook Social Graph , 2011, ArXiv.

[14]  Amir H. Payberah,et al.  Vitis: A Gossip-based Hybrid Overlay for Internet-scale Publish/Subscribe Enabling Rendezvous Routing in Unstructured Overlay Networks , 2011, 2011 IEEE International Parallel & Distributed Processing Symposium.

[15]  Ben Y. Zhao,et al.  User interactions in social networks and their implications , 2009, EuroSys '09.

[16]  Christos Faloutsos,et al.  Graph evolution: Densification and shrinking diameters , 2006, TKDD.

[17]  Bobby Bhattacharjee,et al.  Persona: an online social network with user-defined privacy , 2009, SIGCOMM '09.

[18]  Yoav Tock,et al.  Magnet: practical subscription clustering for Internet-scale publish/subscribe , 2010, DEBS '10.

[19]  Ralf Steinmetz,et al.  LifeSocial.KOM: A P2P-Based Platform for Secure Online Social Networks , 2010, 2010 IEEE Tenth International Conference on Peer-to-Peer Computing (P2P).

[20]  Peter Triantafillou,et al.  eXO: Decentralized Autonomous Scalable Social Networking , 2011, CIDR.