Author:
Zhao Wendian,Wang Yu,Liang Liang,Liu Daowei,Ji Xinyang
Abstract
<abstract><p>Inter-domain routing systems are important complex networks on the Internet. It has been paralyzed several times in recent years. The researchers pay close attention to the damage strategy of inter-domain routing systems and think it is related to the attacker's behavior. The key to the damage strategy is knowing how to select the optimal attack node group. In the process of selecting nodes, the existing research seldom considers the attack cost, and there are some problems, such as an unreasonable definition of attack cost and an unclear optimization effect. To solve the above problems, we designed an algorithm to generate damage strategies for inter-domain routing systems based on multi-objective optimization (PMT). We transformed the damage strategy problem into a double-objective optimization problem and defined the attack cost related to the degree of nonlinearity. In PMT, we proposed an initialization strategy based on a network partition and a node replacement strategy based on partition search. Compared with the existing five algorithms, the experimental results proved the effectiveness and accuracy of PMT.</p></abstract>
Publisher
American Institute of Mathematical Sciences (AIMS)
Subject
Applied Mathematics,Computational Mathematics,General Agricultural and Biological Sciences,Modeling and Simulation,General Medicine
Reference36 articles.
1. J. Cowie, A. Ogielski, B. Premore, Y. Yuan, Global Routing Instabilities Triggered by Code Red ii and Nimda Worm Attacks, Tech. Rep., Renesys Corporation, 2001.
2. R. Durairajan, Robustness and the internet: A geographic fiber-optic infrastructure perspective, in Geographies of the Internet, Routledge, (2020), 47–62.
3. P. Bonacich, Factoring and weighting approaches to status scores and clique identification, J. Math. Sociol., 2 (1972), 113–120.
4. L. Freeman, A set of measures of centrality based upon betweenness, Sociometry, (1977), 35–41.
5. Y. Ruan, J. Tang, Y. Hu, H. Wang, L. Bai, Efficient algorithm for the identification of node significance in complex network, IEEE Access, 8 (2020), 28947–28955. https://doi.org/10.1109/ACCESS.2020.2972107
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献