Influence Evaluation of Centrality-Based Random Scanning Strategy on Early Worm Propagation Rate

被引:0
|
作者
Kown, Su-kyung [1 ]
Jang, Bongsoo [2 ]
Lee, Byoung-Dai [3 ]
Do, Younghae [4 ]
Baek, Hunki [5 ]
Choi, Yoon-Ho [1 ]
机构
[1] Pusan Natl Univ, Sch Elect Elect & Comp Engn, Busan, South Korea
[2] Ulsan Natl Inst Sci & Technol, Dept Math Sci, Ulsan, South Korea
[3] Kyonggi Univ, Dept Comp Sci, Suwon, South Korea
[4] Kyungpook Natl Univ, Dept Math, KNU Ctr Nonlinear Dynam, Daegu, South Korea
[5] Catholic Univ Daegu, Dept Math Educ, Daegu, South Korea
来源
INFORMATION SECURITY APPLICATIONS, WISA 2016 | 2017年 / 10144卷
基金
新加坡国家研究基金会;
关键词
Worm propagation; Centrality theory; Centrality-based random scanning strategy; Anonymity-based random scanning strategy;
D O I
10.1007/978-3-319-56549-1_8
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
Smart devices interconnected through Internet became one of everyday items. In particular, we are now able to access Internet anywhere and anytime with our smartphones. To support the ad-hoc access to Internet by using smartphones, the computer network structure has become more complex. Also, a certain network node is highly connected to support the diverse Internet services. In this paper, we note that when a node is infected by malicious programs, their propagation speeds from the node with a high level of centrality will be faster than those from the node with a low level of centrality, which identifies the most important nodes within a network. From experiments under diverse worm propagation parameters and the well-known network topologies, we evaluate the influence of Centrality-based random scanning strategy on early worm propagation rate. Therefore, we show that centrality-based random scanning strategy, where an initial infected node selects the victim based on the level of centrality, can make random scanning worms propagate rapidly compared to Anonymity-based random scanning strategy, where an initial infected node selects the victim uniformly.
引用
收藏
页码:90 / 101
页数:12
相关论文
共 50 条
  • [1] Analysis of the Propagation Pattern of a Worm with Random Scanning Strategy Based on Usage Rate of Network Bandwidth
    Ko, Kwang Sun
    Jang, Hyunsu
    Park, Byuong Woon
    Eom, Young Ik
    INFORMATION SECURITY AND CRYPTOLOGY - ISISC 2009, 2010, 5984 : 374 - 385
  • [2] Random Walks on Networks with Centrality-Based Stochastic Resetting
    Zelenkovski, Kiril
    Sandev, Trifce
    Metzler, Ralf
    Kocarev, Ljupco
    Basnarkov, Lasko
    ENTROPY, 2023, 25 (02)
  • [3] Connectivity of random graphs after centrality-based vertex removal
    van der Hofstad, Remco
    Pandey, Manish
    JOURNAL OF APPLIED PROBABILITY, 2024, 61 (03) : 967 - 998
  • [4] Attributed Graph Embedding with Random Walk Regularization and Centrality-Based Attention
    Yang, Yuxuan
    Han, Beibei
    Ran, Zanxi
    Gao, Min
    Wei, Yingmei
    MATHEMATICS, 2023, 11 (08)
  • [5] CenLP: A centrality-based label propagation algorithm for community detection in networks
    Sun, Heli
    Liu, Jiao
    Huang, Jianbin
    Wang, Guangtao
    Yang, Zhou
    Song, Qinbao
    Jia, Xiaolin
    PHYSICA A-STATISTICAL MECHANICS AND ITS APPLICATIONS, 2015, 436 : 767 - 780
  • [6] CNTE: A Node Centrality-Based Network Trust Evaluation Method
    Yuan, Xiang
    Sun, Qibo
    Li, Jinglin
    COLLABORATIVE COMPUTING: NETWORKING, APPLICATIONS AND WORKSHARING, COLLABORATECOM 2017, 2018, 252 : 186 - 196
  • [7] Evaluation of Congestion Aware Social Metrics for Centrality-Based Routing
    Islam, Muhammad Arshad
    Iqbal, Muhammad Azhar
    Aleem, Muhammad
    Halim, Zahid
    Srivastava, Gautam
    Lin, Jerry Chun-Wei
    WIRELESS COMMUNICATIONS & MOBILE COMPUTING, 2021, 2021
  • [8] Analysis and research on scanning strategy and propagation model of Internet worm
    Wang Sujun
    Li Jianping
    PROCEEDINGS OF THE INTERNATIONAL CONFERENCE INFORMATION COMPUTING AND AUTOMATION, VOLS 1-3, 2008, : 597 - +
  • [9] Self-similarity of complex networks under centrality-based node removal strategy
    陈单
    蔡德福
    苏厚胜
    Chinese Physics B, 2023, (09) : 688 - 694
  • [10] Easy as ABC: A Lightweight Centrality-Based Caching Strategy for Information-Centric IoT
    Pfender, Jakob
    Valera, Alvin
    Seah, Winston K. G.
    PROCEEDINGS OF THE 2019 CONFERENCE ON INFORMATION-CENTRIC NETWORKING (ICN '19), 2019, : 100 - 111