Please use this identifier to cite or link to this item:
|Title:||Protecting internet infrastructure against link flooding attacks : a techno-economic perspective||Authors:||Ma, Xiaobo
|Keywords:||Engineering::Computer science and engineering||Issue Date:||2019||Source:||Ma, X., Li, J., Tang, Y., An, B., & Guan, X. (2019). Protecting internet infrastructure against link flooding attacks : a techno-economic perspective. Information Sciences, 479, 486-502. doi:10.1016/j.ins.2018.04.050||Journal:||Information Sciences||Abstract:||As an emerging threat, link flooding attacks (LFAs) target and congest core links that constitute Internet routing infrastructure, hence posing a growing threat to networks worldwide. Mitigating and defeating LFAs is particularly challenging for two reasons. First, arising from the end-to-end communication from bots to public servers (e.g., Web servers), the attack traffic flows could be indistinguishable from legitimate ones, and even unobservable to the victim network surrounded by the target links. Therefore, typical flow-filtering countermeasures deployed at the network perimeter become invalid when handling LFAs. Second, the target link and the victim network belong to an autonomous system (AS) different from the source ASs where the attack traffic flows originate. These source ASs, however, have no idea the target link is under attack, whereas they are in charge of routing decisions and thus capable of mitigating LFAs by rerouting the attack traffic flows to bypass the target link. Therefore, inter-AS cooperation is indispensable to defeat LFAs. Unfortunately, the source ASs lack incentives to cooperate because the collateral damage of LFAs to them may be negligible, making it challenging to eradicate LFAs. In this paper, we make the first effort to cope with LFAs from a techno-economic perspective, for accelerating ISPs’ cooperation in defending against LFAs. We propose two novel mechanisms to mitigate LFAs by stimulating the inter-AS cooperation via incentive design and Nash bargaining. Experiments using Internet AS relationship data demonstrate the feasibility and effectiveness of our mechanisms.||URI:||https://hdl.handle.net/10356/142636||ISSN:||0020-0255||DOI:||10.1016/j.ins.2018.04.050||Rights:||© 2018 Elsevier Inc. All rights reserved.||Fulltext Permission:||none||Fulltext Availability:||No Fulltext|
|Appears in Collections:||SCSE Journal Articles|
Updated on Mar 10, 2021
Updated on Mar 4, 2021
Updated on Apr 18, 2021
Items in DR-NTU are protected by copyright, with all rights reserved, unless otherwise indicated.