大规模在线社交网络中数据传播的传输难度度量:一个基于网络驱动的案例
Measuring Transport Difficulty of Data Dissemination in Large-Scale Online Social Networks: An Interest-Driven Case
摘要:
在本文中,我们的目标是在网上社交网络(OSNs)的数据传播的形成模型,并测量所产生的数据流量的传输难度。我们专注于一种常见的类型的兴趣驱动的社交会话在OSN,称为\emph{Social-InterestCast},根据用户将自主地决定是否要查看他的followees根据他的兴趣的内容。由于涉及到用户的社会关系、用户的兴趣、内容语义等多个相互关联的因素,因此要弄清楚这种社交网络的形成机制是具有挑战性的。我们提出了一个四层的系统模型,包括物理层,社会层,内容层和会话层。通过该模型,我们成功地获得了社交媒体会话的地理分布,作为量化数据传输难度的前提条件。我们将\emph{transport load}的基本极限定义为一个新的度量,称为\emph{transport complexity},即,\emph{minimum required}在给定运营商网络上传输OSN负载。具体来说,我们得出的运输复杂性,在一个大规模的OSN的运营商网络与最佳的通信架构的社交网络会话。该结果可以作为在任何运营商网络上的社会广播的传输负载的共同下限。据我们所知,这是第一项通过对具有兴趣驱动特征的会话模式进行建模来衡量OSN中数据传播的传输难度的工作。
英文摘要:
In this paper, we aim to model the formation of data dissemination in online social networks (OSNs), and measure the transport difficulty of generated data traffic. We focus on a usual type of interest-driven social sessions in OSNs, called \emph{Social-InterestCast}, under which a user will autonomously determine whether to view the content from his followees depending on his interest. It is challenging to figure out the formation mechanism of such a Social-InterestCast, since it involves multiple interrelated factors such as users' social relationships, users' interests, and content semantics. We propose a four-layered system model, consisting of physical layer, social layer, content layer, and session layer. By this model we successfully obtain the geographical distribution of Social-InterestCast sessions, serving as the precondition for quantifying data transport difficulty. We define the fundamental limit of \emph{transport load} as a new metric, called \emph{transport complexity}, i.e., the \emph{minimum required} transport load for an OSN over a given carrier network. Specifically, we derive the transport complexity for Social-InterestCast sessions in a large-scale OSN over the carrier network with optimal communication architecture. The results can act as the common lower bounds on transport load for Social-InterestCast over 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.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。