A Flow Attack Strategy based on Critical Links for Cyber-attack

Jiming Qi, Jiazheng Zhang, Qingxia Liu, Bang Wang
{"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.
一种基于关键环节的网络攻击流策略
无论是城市的拥塞控制还是互联网的海量接入,这些动态行为都可以抽象为网络中出发地节点对(OD对)之间的流量需求。复杂系统中的链路具有明显的异构性,这意味着流量的大小变化很大,导致一些关键链路在流量攻击下更容易发生拥塞,降低系统的服务能力,甚至导致网络崩溃。为了探讨拥塞情况下流量动力学对网络功能和稳定性的影响,我们提出了一种基于链路的流量攻击策略,该策略显著降低了OD对之间的服务能力。该方法首先提取路由路径,对OD对之间链路的脆弱性进行评分,然后设计基于关键链路的攻击流分配规则,对OD对之间的目标流进行有效攻击。在真实网络上的实验表明,该策略能够快速识别关键环节,准确地攻击目标流。此外,该方法为防御策略和网络拓扑优化提供了积极而独特的见解。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信