SocialCDN: Caching techniques for distributed social networks

Lu Han, Magdalena Punceva, Badri Nath, Shanmugavelayutham Muthukrishnan, Liviu Iftode

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

    Abstract

    Distributed online social networks (DOSN) have been proposed as an alternative to centralized Online Social Networks (OSN). In contrast to centralized OSN, DOSNs do not have central repository of all user data, neither impose control regarding how users data will be accessed. Therefore, users can keep control of their private data and are not at the mercy of the social network providers. However, one of the main problems in DOSNs is how to efficiently disseminate social updates among peers. In our previous work, we proposed Social Caches for social updates dissemination in DOSN. However, the selection of social caches requires knowledge about the entire social graph. In this paper, we propose four fully distributed social cache selection algorithms, and evaluate their performance on five well known graphs. Using simulations we show that these algorithms perform almost as good as the centralized best known approximation algorithm would do. These distributed caching techniques can be used as a basis for various applications such as those that represent fusions of social and vehicular networks.

    Original languageEnglish (US)
    Title of host publication2012 IEEE 12th International Conference on Peer-to-Peer Computing, P2P 2012
    Pages191-202
    Number of pages12
    DOIs
    StatePublished - Dec 5 2012
    Event2012 IEEE 12th International Conference on Peer-to-Peer Computing, P2P 2012 - Tarragona, Spain
    Duration: Sep 3 2012Sep 5 2012

    Publication series

    Name2012 IEEE 12th International Conference on Peer-to-Peer Computing, P2P 2012

    Other

    Other2012 IEEE 12th International Conference on Peer-to-Peer Computing, P2P 2012
    CountrySpain
    CityTarragona
    Period9/3/129/5/12

    Fingerprint

    Approximation algorithms
    Fusion reactions

    ASJC Scopus subject areas

    • Software

    Cite this

    Han, L., Punceva, M., Nath, B., Muthukrishnan, S., & Iftode, L. (2012). SocialCDN: Caching techniques for distributed social networks. In 2012 IEEE 12th International Conference on Peer-to-Peer Computing, P2P 2012 (pp. 191-202). [6335799] (2012 IEEE 12th International Conference on Peer-to-Peer Computing, P2P 2012). https://doi.org/10.1109/P2P.2012.6335799

    SocialCDN : Caching techniques for distributed social networks. / Han, Lu; Punceva, Magdalena; Nath, Badri; Muthukrishnan, Shanmugavelayutham; Iftode, Liviu.

    2012 IEEE 12th International Conference on Peer-to-Peer Computing, P2P 2012. 2012. p. 191-202 6335799 (2012 IEEE 12th International Conference on Peer-to-Peer Computing, P2P 2012).

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

    Han, L, Punceva, M, Nath, B, Muthukrishnan, S & Iftode, L 2012, SocialCDN: Caching techniques for distributed social networks. in 2012 IEEE 12th International Conference on Peer-to-Peer Computing, P2P 2012., 6335799, 2012 IEEE 12th International Conference on Peer-to-Peer Computing, P2P 2012, pp. 191-202, 2012 IEEE 12th International Conference on Peer-to-Peer Computing, P2P 2012, Tarragona, Spain, 9/3/12. https://doi.org/10.1109/P2P.2012.6335799
    Han L, Punceva M, Nath B, Muthukrishnan S, Iftode L. SocialCDN: Caching techniques for distributed social networks. In 2012 IEEE 12th International Conference on Peer-to-Peer Computing, P2P 2012. 2012. p. 191-202. 6335799. (2012 IEEE 12th International Conference on Peer-to-Peer Computing, P2P 2012). https://doi.org/10.1109/P2P.2012.6335799
    Han, Lu ; Punceva, Magdalena ; Nath, Badri ; Muthukrishnan, Shanmugavelayutham ; Iftode, Liviu. / SocialCDN : Caching techniques for distributed social networks. 2012 IEEE 12th International Conference on Peer-to-Peer Computing, P2P 2012. 2012. pp. 191-202 (2012 IEEE 12th International Conference on Peer-to-Peer Computing, P2P 2012).
    @inproceedings{7c39fdd344af41b389a891f1fb91aa19,
    title = "SocialCDN: Caching techniques for distributed social networks",
    abstract = "Distributed online social networks (DOSN) have been proposed as an alternative to centralized Online Social Networks (OSN). In contrast to centralized OSN, DOSNs do not have central repository of all user data, neither impose control regarding how users data will be accessed. Therefore, users can keep control of their private data and are not at the mercy of the social network providers. However, one of the main problems in DOSNs is how to efficiently disseminate social updates among peers. In our previous work, we proposed Social Caches for social updates dissemination in DOSN. However, the selection of social caches requires knowledge about the entire social graph. In this paper, we propose four fully distributed social cache selection algorithms, and evaluate their performance on five well known graphs. Using simulations we show that these algorithms perform almost as good as the centralized best known approximation algorithm would do. These distributed caching techniques can be used as a basis for various applications such as those that represent fusions of social and vehicular networks.",
    author = "Lu Han and Magdalena Punceva and Badri Nath and Shanmugavelayutham Muthukrishnan and Liviu Iftode",
    year = "2012",
    month = "12",
    day = "5",
    doi = "10.1109/P2P.2012.6335799",
    language = "English (US)",
    isbn = "9781467328623",
    series = "2012 IEEE 12th International Conference on Peer-to-Peer Computing, P2P 2012",
    pages = "191--202",
    booktitle = "2012 IEEE 12th International Conference on Peer-to-Peer Computing, P2P 2012",

    }

    TY - GEN

    T1 - SocialCDN

    T2 - Caching techniques for distributed social networks

    AU - Han, Lu

    AU - Punceva, Magdalena

    AU - Nath, Badri

    AU - Muthukrishnan, Shanmugavelayutham

    AU - Iftode, Liviu

    PY - 2012/12/5

    Y1 - 2012/12/5

    N2 - Distributed online social networks (DOSN) have been proposed as an alternative to centralized Online Social Networks (OSN). In contrast to centralized OSN, DOSNs do not have central repository of all user data, neither impose control regarding how users data will be accessed. Therefore, users can keep control of their private data and are not at the mercy of the social network providers. However, one of the main problems in DOSNs is how to efficiently disseminate social updates among peers. In our previous work, we proposed Social Caches for social updates dissemination in DOSN. However, the selection of social caches requires knowledge about the entire social graph. In this paper, we propose four fully distributed social cache selection algorithms, and evaluate their performance on five well known graphs. Using simulations we show that these algorithms perform almost as good as the centralized best known approximation algorithm would do. These distributed caching techniques can be used as a basis for various applications such as those that represent fusions of social and vehicular networks.

    AB - Distributed online social networks (DOSN) have been proposed as an alternative to centralized Online Social Networks (OSN). In contrast to centralized OSN, DOSNs do not have central repository of all user data, neither impose control regarding how users data will be accessed. Therefore, users can keep control of their private data and are not at the mercy of the social network providers. However, one of the main problems in DOSNs is how to efficiently disseminate social updates among peers. In our previous work, we proposed Social Caches for social updates dissemination in DOSN. However, the selection of social caches requires knowledge about the entire social graph. In this paper, we propose four fully distributed social cache selection algorithms, and evaluate their performance on five well known graphs. Using simulations we show that these algorithms perform almost as good as the centralized best known approximation algorithm would do. These distributed caching techniques can be used as a basis for various applications such as those that represent fusions of social and vehicular networks.

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

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

    U2 - 10.1109/P2P.2012.6335799

    DO - 10.1109/P2P.2012.6335799

    M3 - Conference contribution

    SN - 9781467328623

    T3 - 2012 IEEE 12th International Conference on Peer-to-Peer Computing, P2P 2012

    SP - 191

    EP - 202

    BT - 2012 IEEE 12th International Conference on Peer-to-Peer Computing, P2P 2012

    ER -