{"title":"A Flow Attack Strategy based on Critical Links for Cyber-attack","authors":"Jiming Qi, Jiazheng Zhang, Qingxia Liu, Bang Wang","doi":"10.1109/TrustCom56396.2022.00126","DOIUrl":null,"url":null,"abstract":"Whether it be congestion control in cities or massive access in the Internet, these dynamic behaviors can be abstracted as flow demand between origin-destination node pairs (OD pairs) in the network. Links in complex systems are with notable heterogeneity, which means the volume of flow varies greatly, resulting in some critical links being more likely to congest under the flow attack, reducing the service capability of the system, and even causing network collapses. To explore how flow dynamics influences the network functionality and stability under congestion, we propose a link-based flow attack strategy that significantly degrades the service capability between OD pairs. In this approach, we first extract the routing paths and score the vulnerability of links between OD pairs, then an attack flow allocation rule based on critical links is designed to efficiently attack the target flow between OD pairs. Experiments on real-world networks show that the proposed strategy can quickly identify critical links and accurately attack the target flow. Besides, the proposed method provides positive and unique insights for defense strategy and network topology optimization.","PeriodicalId":276379,"journal":{"name":"2022 IEEE International Conference on Trust, Security and Privacy in Computing and Communications (TrustCom)","volume":"2 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2022-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2022 IEEE International Conference on Trust, Security and Privacy in Computing and Communications (TrustCom)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/TrustCom56396.2022.00126","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0
Abstract
Whether it be congestion control in cities or massive access in the Internet, these dynamic behaviors can be abstracted as flow demand between origin-destination node pairs (OD pairs) in the network. Links in complex systems are with notable heterogeneity, which means the volume of flow varies greatly, resulting in some critical links being more likely to congest under the flow attack, reducing the service capability of the system, and even causing network collapses. To explore how flow dynamics influences the network functionality and stability under congestion, we propose a link-based flow attack strategy that significantly degrades the service capability between OD pairs. In this approach, we first extract the routing paths and score the vulnerability of links between OD pairs, then an attack flow allocation rule based on critical links is designed to efficiently attack the target flow between OD pairs. Experiments on real-world networks show that the proposed strategy can quickly identify critical links and accurately attack the target flow. Besides, the proposed method provides positive and unique insights for defense strategy and network topology optimization.