An approach to generate damage strategies for inter-domain routing systems based on multi-objective optimization

Wendian Zhao; Yu Wang; Liang Liang; Daowei Liu; Xinyang Ji; Wendian Zhao; Yu Wang; Liang Liang; Daowei Liu; Xinyang Ji

doi:10.3934/mbe.2023495

Mathematical Biosciences and Engineering

2023, Volume 20, Issue 6: 11176-11195. doi: 10.3934/mbe.2023495

Previous Article Next Article

Research article Special Issues

An approach to generate damage strategies for inter-domain routing systems based on multi-objective optimization

Chinese People's Liberation Army 63893 Troops, Luoyang 471000, China

Academic Editor: Regino Criado Herrero

Received: 24 October 2022 Revised: 24 March 2023 Accepted: 02 April 2023 Published: 25 April 2023

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.
- inter-domain routing systems,
- complex networks,
- damage strategy,
- optimal attack node group,
- multi-objective optimization
Citation: Wendian Zhao, Yu Wang, Liang Liang, Daowei Liu, Xinyang Ji. An approach to generate damage strategies for inter-domain routing systems based on multi-objective optimization[J]. Mathematical Biosciences and Engineering, 2023, 20(6): 11176-11195. doi: 10.3934/mbe.2023495

Related Papers:

Abstract

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.

References

[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 doi: 10.1109/ACCESS.2020.2972107
[6]	J. Liu, Q. Xiong, W. Shi, X. Shi, K. Wang, Evaluating the importance of nodes in complex networks, Physica A, 452 (2016), 209–219. https://doi.org/10.48550/arXiv.2111.13585 doi: 10.48550/arXiv.2111.13585
[7]	W. Zhao, Y. Wang, X. Xiong, F. Yang, Finding key nodes in complex networks: An edge and local partition approach, in 2020 IEEE 6th International Conference on Computer and Communications (ICCC), (2020), 1053–1057. https://doi.org/10.1109/ICCC51575.2020.9345096
[8]	C. Fan, L. Zeng, Y. Sun, Y. Y. Liu, Finding key players in complex networks through deep reinforcement learning, Nat. Mach. Intell., 2 (2020), 317–324. https://doi.org/10.1038/s42256-020-0177-2 doi: 10.1038/s42256-020-0177-2
[9]	L. Zhang, J. Xia, F. Cheng, J. Qiu, X. Zhang, Multi-objective optimization of critical node detection based on cascade model in complex networks, IEEE Trans. Network Sci. Eng., 7 (2020), 2052–2066. https://doi.org/10.1109/TNSE.2020.2972980 doi: 10.1109/TNSE.2020.2972980
[10]	J. Qin, H. Wu, Y. F. Yi, B. Zheng, Effectiveness of attack strategies of complex networks with cost, Trans. Beijing Inst. Technol., 33 (2013), 67–72.
[11]	X. Wang, S. Guan, C. H. Lai, Protecting infrastructure networks from cost-based attacks, New J. Phys., 11 (2009), 033006. https://doi.org/10.1088/1367-2630/11/3/033006 doi: 10.1088/1367-2630/11/3/033006
[12]	J. Tan, H. Wu, Y. Yi, B. Zheng, Research on the effectiveness of complex network attack strategy under cost, Trans. Beijing Inst. Technol., 33 (2013), 67–72. https://doi.org/10.15918/j.tbit1001-0645.2013.01.008 doi: 10.15918/j.tbit1001-0645.2013.01.008
[13]	D. Ye, W. Jun, Optimal attack strategy based on limited cost model on complex network, in 2015 IEEE International Conference on Systems, Man, and Cybernetics, IEEE, (2015), 105–108. https://doi.org/10.1109/SMC.2015.31
[14]	E. Wang, Y. Wang, P. Qu, Analysis of the effectiveness of cost based side attack strategy in complex networks, Syst. Eng. Electron. Technol., 40 (2018), 919–926.
[15]	W. Wang, Q. Cai, Y. Sun, H. He, Risk-aware attacks and catastrophic cascading failures in us power grid, in 2011 IEEE Global Telecommunications Conference–GLOBECOM 2011, IEEE, (2011), 1–6. https://doi.org/10.1109/GLOCOM.2011.6133788
[16]	Y. Zhu, J. Yan, Y. Sun, H. He, Revealing cascading failure vulnerability in power grids using risk-graph, IEEE Trans. Parallel Distrib. Syst., 25 (2014), 3274–3284. https://doi.org/10.1109/TPDS.2013.2295814 doi: 10.1109/TPDS.2013.2295814
[17]	M. Wang, Y. Xiang, L. Wang, Identification of critical contingencies using solution space pruning and intelligent search, Electr. Power Syst. Res., 149 (2017), 220–229. https://doi.org/10.1016/J.EPSR.2017.04.027 doi: 10.1016/J.EPSR.2017.04.027
[18]	Y. Zhao, B. Cai, H. H. S. Kang, Y. Liu, Cascading failure analysis of multistate loading dependent systems with application in an overloading piping network, Reliab. Eng. Syst. Saf., 231 (2023), 109007. https://doi.org/10.1016/j.ress.2022.109007 doi: 10.1016/j.ress.2022.109007
[19]	W. Huang, B. Zhou, Y. Yu, D. Yin, Vulnerability analysis of road network for dangerous goods transportation considering intentional attack: Based on cellular automata, Reliab. Eng. Syst. Saf., 214 (2021), 107779. https://doi.org/10.1016/j.ress.2021.107779 doi: 10.1016/j.ress.2021.107779
[20]	J. Zhou, W. Zheng, D. Wang, D. W. Coit, A resilient network recovery framework against cascading failures with deep graph learning, in Proceedings of the Institution of Mechanical Engineers, Part O: Journal of Risk and Reliability, (2022), 1748006X221128869. https://doi.org/10.1177/1748006X221128869
[21]	J. Zhou, D. W. Coit, F. A. Felder, D. Wang, Resiliency-based restoration optimization for dependent network systems against cascading failures, Reliab. Eng. Syst. Saf., 207 (2021), 107383. https://doi.org/10.1016/j.ress.2020.107383 doi: 10.1016/j.ress.2020.107383
[22]	W. Zhao, Y. Wang, X. Xiong, Y. Li, Cfm-rfm: A cascading failure model for inter-domain routing systems with the recovery feedback mechanism, Information, 12 (2021), 247. https://doi.org/10.3390/info12060247 doi: 10.3390/info12060247
[23]	W. Deng, J. Xu, X. Z. Gao, H. Zhao, An enhanced msiqde algorithm with novel multiple strategies for global optimization problems, IEEE Trans. Syst. Man Cybern. Syst., 52 (2022), 1578–1587. https://doi.org/10.1109/TSMC.2020.3030792 doi: 10.1109/TSMC.2020.3030792
[24]	Y. Song, X. Cai, X. Zhou, B. Zhang, H. Chen, Y. Li, et al., Dynamic hybrid mechanism-based differential evolution algorithm and its application, Expert Syst. Appl., 213 (2023), 118834. https://doi.org/10.1016/j.eswa.2022.118834 doi: 10.1016/j.eswa.2022.118834
[25]	W. Deng, H. Ni, Y. Liu, H. Chen, H. Zhao, An adaptive differential evolution algorithm based on belief space and generalized opposition-based learning for resource allocation, Appl. Soft Comput., 127 (2022), 109419. https://doi.org/10.1016/j.asoc.2022.109419 doi: 10.1016/j.asoc.2022.109419
[26]	W. Deng, L. Zhang, X. Zhou, Y. Zhou, Y. Sun, W. Zhu, et al., Multi-strategy particle swarm and ant colony hybrid optimization for airport taxiway planning problem, Inf. Sci., 612 (2022), 576–593. https://doi.org/10.1016/j.ins.2022.08.115 doi: 10.1016/j.ins.2022.08.115
[27]	H. Zhao, J. Liu, H. Chen, J. Chen, Y. Li, J. Xu, et al., Intelligent diagnosis using continuous wavelet transform and gauss convolutional deep belief network, IEEE Trans. Reliab., (2022), 1–11. https://doi.org/10.1109/TR.2022.3180273
[28]	C. Hong, X. B. Cao, W. B. Du, J. Zhang, The effect of attack cost on network robustness, Phys. Scr., 87 (2013), 55801. https://doi.org/10.1088/0031-8949/87/05/055801 doi: 10.1088/0031-8949/87/05/055801
[29]	J. D. Schaffer, Multiple objective optimization with vector evaluated genetic algorithms, in ICGA, 1985.
[30]	D. E. Goldberg, K. Deb, A comparative analysis of selection schemes used in genetic algorithms, Found. Genet. Algorithms, 1 (1991), 69–93. https://doi.org/10.1016/B978-0-08-050684-5.50008-2 doi: 10.1016/B978-0-08-050684-5.50008-2
[31]	N. Srinivas, K. Deb, Muiltiobjective optimization using nondominated sorting in genetic algorithms, Evol. Comput., 2 (1994), 221–248.
[32]	K. Deb, S. Agrawal, A. Pratap, T. Meyarivan, A fast and elitist multiobjective genetic algorithm: Nsga-ii, IEEE Trans. Evol. Comput., 6 (2002), 182–197.
[33]	CAIDA, The Caida AS Relationships Dataset, 2022. Available from: http://www.caida.org/data/active/as-relationships.
[34]	L. Hong, Technique of evaluating as importance based on preferred route, J. Software, 23 (2012), 2388–2400.
[35]	H. H. Zhu, H. Qiu, J. H. Zhu, Z. Y. Zeng, Spreading dynamics based key nodes identification in inter-domain routing system, Chin. J. Network Inf. Secur., 5 (2018), 9.
[36]	W. Zhao, Y. Wang, X. Xiong, M. Wang, DSCT: A damage strategy for inter-domain routing system considering cost and based on topsis, in 2021 4th International Conference on Data Science and Information Technology, (2021), 218–225. https://doi.org/10.1145/3478905.3478949

Reader Comments

Your name:*

Email:*
© 2023 the Author(s), licensee AIMS Press. This is an open access article distributed under the terms of the Creative Commons Attribution License (http://creativecommons.org/licenses/by/4.0)