摘要
随着在线社交网络(Online Social Network,OSN)的快速发展,OSN蠕虫已经成为最具威胁的网络安全问题之一.为了防止OSN蠕虫的快速传播,文中提出了一种基于社团并行发现的OSN蠕虫抑制方法.首先将分布式图计算框架Pregel和基于标签传播的社团发现算法(Label Propagation Algorithm,LPA)相结合,提出了一种能够处理大规模OSN网络社团发现问题的并行LPA算法(Parallel LPA,PLPA).其次,文中在PLPA算法的基础上给出了3种社团关键节点的选取策略,并提出了相应的OSN蠕虫抑制方法.最后,通过在两组真实数据集上进行的社团并行发现及OSN蠕虫抑制仿真实验证明了文中方法的有效性.
With the rapid development of Online Social Networks (OSNs), worms propagating in these networks have become one of the most threatening security problems. To contain these rapidly spreading worms, in this paper, we propose a defensive measure which is based on parallel community detection in OSNs. Specifically, according to the Pregel data-processing infrastructure, we implement a new parallel version of label propagation algorithm (PLPA) that is capable of quickly finding communities in OSNs owning millions of users. And then we give three definitions for the influential users to whom we will first distribute patches to contain the propagation of OSN worms. To evaluate the performance of our approaches we test them on our simulating framework with two large-scale OSN datasets and analyze the experimental results which can show the effectiveness of our approaches.
出处
《计算机学报》
EI
CSCD
北大核心
2015年第4期846-858,共13页
Chinese Journal of Computers
基金
国家"九七三"重点基础研究发展规划项目基金(2012CB315804)
国家自然科学基金(61073179)
国家自然科学基金重大研究计划(91118006)
北京市自然科学基金(4122086)~~
关键词
社团并行发现
在线社交网络
蠕虫抑制
社会计算
社交网络
parallel community detection
online social network
worm containment
social computing
social network