Social butterfly: Social caches for distributed social networks

Lu Han, Badri Nath, Liviu Iftode, Shanmugavelayutham Muthukrishnan

    Research output: Chapter in Book/Report/Conference proceedingConference contribution

    Abstract

    A distributed architecture for implementing online social networks (OSNs) can overcome several disadvantages of the now popular centralized online social networks such as Facebook 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 peerto- 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.

    Original languageEnglish (US)
    Title of host publicationProceedings - 2011 IEEE International Conference on Privacy, Security, Risk and Trust and IEEE International Conference on Social Computing, PASSAT/SocialCom 2011
    Pages81-86
    Number of pages6
    DOIs
    StatePublished - Dec 1 2011
    Event2011 IEEE International Conference on Privacy, Security, Risk and Trust, PASSAT 2011 and 2011 IEEE International Conference on Social Computing, SocialCom 2011 - Boston, MA, United States
    Duration: Oct 9 2011Oct 11 2011

    Publication series

    NameProceedings - 2011 IEEE International Conference on Privacy, Security, Risk and Trust and IEEE International Conference on Social Computing, PASSAT/SocialCom 2011

    Conference

    Conference2011 IEEE International Conference on Privacy, Security, Risk and Trust, PASSAT 2011 and 2011 IEEE International Conference on Social Computing, SocialCom 2011
    CountryUnited States
    CityBoston, MA
    Period10/9/1110/11/11

    Fingerprint

    Data privacy
    Communication

    ASJC Scopus subject areas

    • Hardware and Architecture
    • Safety, Risk, Reliability and Quality

    Cite this

    Han, L., Nath, B., Iftode, L., & Muthukrishnan, S. (2011). Social butterfly: Social caches for distributed social networks. In Proceedings - 2011 IEEE International Conference on Privacy, Security, Risk and Trust and IEEE International Conference on Social Computing, PASSAT/SocialCom 2011 (pp. 81-86). [6113098] (Proceedings - 2011 IEEE International Conference on Privacy, Security, Risk and Trust and IEEE International Conference on Social Computing, PASSAT/SocialCom 2011). https://doi.org/10.1109/PASSAT/SocialCom.2011.105

    Social butterfly : Social caches for distributed social networks. / Han, Lu; Nath, Badri; Iftode, Liviu; Muthukrishnan, Shanmugavelayutham.

    Proceedings - 2011 IEEE International Conference on Privacy, Security, Risk and Trust and IEEE International Conference on Social Computing, PASSAT/SocialCom 2011. 2011. p. 81-86 6113098 (Proceedings - 2011 IEEE International Conference on Privacy, Security, Risk and Trust and IEEE International Conference on Social Computing, PASSAT/SocialCom 2011).

    Research output: Chapter in Book/Report/Conference proceedingConference contribution

    Han, L, Nath, B, Iftode, L & Muthukrishnan, S 2011, Social butterfly: Social caches for distributed social networks. in Proceedings - 2011 IEEE International Conference on Privacy, Security, Risk and Trust and IEEE International Conference on Social Computing, PASSAT/SocialCom 2011., 6113098, Proceedings - 2011 IEEE International Conference on Privacy, Security, Risk and Trust and IEEE International Conference on Social Computing, PASSAT/SocialCom 2011, pp. 81-86, 2011 IEEE International Conference on Privacy, Security, Risk and Trust, PASSAT 2011 and 2011 IEEE International Conference on Social Computing, SocialCom 2011, Boston, MA, United States, 10/9/11. https://doi.org/10.1109/PASSAT/SocialCom.2011.105
    Han L, Nath B, Iftode L, Muthukrishnan S. Social butterfly: Social caches for distributed social networks. In Proceedings - 2011 IEEE International Conference on Privacy, Security, Risk and Trust and IEEE International Conference on Social Computing, PASSAT/SocialCom 2011. 2011. p. 81-86. 6113098. (Proceedings - 2011 IEEE International Conference on Privacy, Security, Risk and Trust and IEEE International Conference on Social Computing, PASSAT/SocialCom 2011). https://doi.org/10.1109/PASSAT/SocialCom.2011.105
    Han, Lu ; Nath, Badri ; Iftode, Liviu ; Muthukrishnan, Shanmugavelayutham. / Social butterfly : Social caches for distributed social networks. Proceedings - 2011 IEEE International Conference on Privacy, Security, Risk and Trust and IEEE International Conference on Social Computing, PASSAT/SocialCom 2011. 2011. pp. 81-86 (Proceedings - 2011 IEEE International Conference on Privacy, Security, Risk and Trust and IEEE International Conference on Social Computing, PASSAT/SocialCom 2011).
    @inproceedings{2d91c2c7a8ba4336a53603a7e63ad635,
    title = "Social butterfly: Social caches for distributed social networks",
    abstract = "A distributed architecture for implementing online social networks (OSNs) can overcome several disadvantages of the now popular centralized online social networks such as Facebook 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 peerto- 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.",
    author = "Lu Han and Badri Nath and Liviu Iftode and Shanmugavelayutham Muthukrishnan",
    year = "2011",
    month = "12",
    day = "1",
    doi = "10.1109/PASSAT/SocialCom.2011.105",
    language = "English (US)",
    isbn = "9780769545783",
    series = "Proceedings - 2011 IEEE International Conference on Privacy, Security, Risk and Trust and IEEE International Conference on Social Computing, PASSAT/SocialCom 2011",
    pages = "81--86",
    booktitle = "Proceedings - 2011 IEEE International Conference on Privacy, Security, Risk and Trust and IEEE International Conference on Social Computing, PASSAT/SocialCom 2011",

    }

    TY - GEN

    T1 - Social butterfly

    T2 - Social caches for distributed social networks

    AU - Han, Lu

    AU - Nath, Badri

    AU - Iftode, Liviu

    AU - Muthukrishnan, Shanmugavelayutham

    PY - 2011/12/1

    Y1 - 2011/12/1

    N2 - A distributed architecture for implementing online social networks (OSNs) can overcome several disadvantages of the now popular centralized online social networks such as Facebook 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 peerto- 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.

    AB - A distributed architecture for implementing online social networks (OSNs) can overcome several disadvantages of the now popular centralized online social networks such as Facebook 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 peerto- 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.

    UR - http://www.scopus.com/inward/record.url?scp=84856174643&partnerID=8YFLogxK

    UR - http://www.scopus.com/inward/citedby.url?scp=84856174643&partnerID=8YFLogxK

    U2 - 10.1109/PASSAT/SocialCom.2011.105

    DO - 10.1109/PASSAT/SocialCom.2011.105

    M3 - Conference contribution

    AN - SCOPUS:84856174643

    SN - 9780769545783

    T3 - Proceedings - 2011 IEEE International Conference on Privacy, Security, Risk and Trust and IEEE International Conference on Social Computing, PASSAT/SocialCom 2011

    SP - 81

    EP - 86

    BT - Proceedings - 2011 IEEE International Conference on Privacy, Security, Risk and Trust and IEEE International Conference on Social Computing, PASSAT/SocialCom 2011

    ER -