skip to main content
10.1145/3321408.3321601acmotherconferencesArticle/Chapter ViewAbstractPublication Pagesacm-turcConference Proceedingsconference-collections
research-article

Transport complexity of data dissemination in large-scale online social networks

Published: 17 May 2019 Publication History

Abstract

In this paper, we aim to measure the transport difficulty of data dissemination in online social networks (OSNs). We focus on a usual type of interest-driven social sessions in OSNs, called Social-InterestCast, under which users autonomously determine whether to view the content from their followees depending on their interest. We define the fundamental limit of transport load as a new metric, called transport complexity, i.e., the minimally required transport load for an OSN in a given carrier network. We derive the transport complexity for Social-InterestCast sessions in a large-scale OSN in the carrier network with optimal communication architecture. The results can act as the common lower bounds on transport load for Social-InterestCast in any carrier networks. To the best of our knowledge, this is the first work to measure the transport difficulty for data dissemination in OSNs by modeling session patterns with the interest-driven characteristics.

References

[1]
C. Wang, S. Tang, L. Yang, Y. Guo, F. Li, and C. Jiang, "Modeling data dissemination in online social networks: A geographical perspective on bounding network traffic load," in Proc. ACM MobiHoc 2014.
[2]
C. Wang, Z. Zhang, J. Zhou, Y. He, J. Cui, and C. Jiang, "Modeling interest-driven data dissemination in online social networks," in Proc. IEEE MSN 2016.
[3]
J. Bao, Y. Zheng, and M. F. Mokbel, "Location-based and preference-aware recommendation using sparse geo-social networking data," Gis, pp. 199--208, 2012.
[4]
"Shareaholic's search traffic vs. social referrals report," https://blog.shareaholic.com/search-traffic-social-referrals-12-2013/.
[5]
S. A. Myers, C. Zhu, and J. Leskovec, "Information diffusion and external influence in networks," in Proc. ACM SIGKDD 2012.
[6]
X. Chen, B. Proulx, X. Gong, and J. Zhang, "Social trust and social reciprocity based cooperative D2D communications," in Proc. ACM MobiHoc 2013.
[7]
K.-C. Chen, M. Chiang, and H. V. Poor, "From technological networks to social networks." IEEE Journal on Selected Areas in Communications, vol. 31, no. 31, pp. 548--572, 2013.
[8]
R. Perera, S. Anand, K. Subbalakshmi, and R. Chandramouli, "Twitter analytics: Architecture, tools and analysis," in Proc. IEEE MILCOM 2010.
[9]
G. Alfano, M. Garetto, and E. Leonardi, "Capacity scaling of wireless networks with inhomogeneous node density: Upper bounds," IEEE Journal on Selected Areas in Communications, vol. 27, no. 7, pp. 1147--1157, 2009.
[10]
C. Wang, J. Zhou, and B. Yang, "From footprint to friendship: Modeling user followership in mobile social networks from check-in data," in Proc. ACM SIGIR 2017.
[11]
C. Wang, Z. Zhang, J. Zhou, Y. He, J. Cui, and C. Jiang, "Measuring transport difficulty of data dissemination in large-scale online social networks: An interest-driven case," CoRR, vol. abs/1304.6459, 2013. {Online}. Available: http://arxiv.org/abs/1304.6459

Index Terms

  1. Transport complexity of data dissemination in large-scale online social networks

    Recommendations

    Comments

    Information & Contributors

    Information

    Published In

    cover image ACM Other conferences
    ACM TURC '19: Proceedings of the ACM Turing Celebration Conference - China
    May 2019
    963 pages
    ISBN:9781450371582
    DOI:10.1145/3321408
    Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

    Publisher

    Association for Computing Machinery

    New York, NY, United States

    Publication History

    Published: 17 May 2019

    Permissions

    Request permissions for this article.

    Check for updates

    Author Tags

    1. data dissemination
    2. fundamental limits
    3. online social networks
    4. scaling behavior
    5. transport load

    Qualifiers

    • Research-article

    Funding Sources

    • the Na- tional Natural Science Foundation of China (NSFC)

    Conference

    ACM TURC 2019

    Contributors

    Other Metrics

    Bibliometrics & Citations

    Bibliometrics

    Article Metrics

    • 0
      Total Citations
    • 49
      Total Downloads
    • Downloads (Last 12 months)2
    • Downloads (Last 6 weeks)0
    Reflects downloads up to 16 Feb 2025

    Other Metrics

    Citations

    View Options

    Login options

    View options

    PDF

    View or Download as a PDF file.

    PDF

    eReader

    View online with eReader.

    eReader

    Figures

    Tables

    Media

    Share

    Share

    Share this Publication link

    Share on social media