By Topic

Social Butterfly: Social Caches for Distributed Social Networks

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

4 Author(s)
Lu Han ; Dept. of Comput. Sci., Rutgers, State Univ. of New Jersey, Piscataway, NJ, USA ; Nath, B. ; Iftode, L. ; Muthukrishnan, S.

A distributed architecture for implementing online social networks (OSNs) can overcome several disadvantages of the now popular centralized online social networks such as Face book or Twitter. Owners of centralized OSNs control all of the individuals' data and associated policies on dissemination of data. Hence, individuals can hardly exert control of their personal data, resulting in serious potential privacy violations. Distributed OSNs, where each individual hosts their personal data, provide greater control of ownership of personal data. However, for distributed OSNs to be scalable, methods that optimize peer-to-peer data dissemination need to be developed. In this paper, we introduce Social Caches as a way to alleviate the peer-to-peer traffic that would ensue in a distributed OSNs. Social caches act as local bridges among friends for efficient information delivery. We provide a novel social communication model, Social Butterfly, for distributed OSNs that utilize social caches. We further formulate social cache selection as the Neighbor-Dominating Set Problem, and propose two algorithms to solve it: 1) Approximate NDS, and 2) Social Score algorithm. Performance evaluation based on real social traffic data shows that both algorithms reduce peer-to-peer social traffic by an order of magnitude.

Published in:

Privacy, Security, Risk and Trust (PASSAT) and 2011 IEEE Third Inernational Conference on Social Computing (SocialCom), 2011 IEEE Third International Conference on

Date of Conference:

9-11 Oct. 2011