arrow
返回

Randomized Security Patrolling for Link Flooding Attack Detection

delete2020-07-01
delete22
PRE
AI
X
Xiaobo Ma
B
Bo An
赵梦辰 封面图
赵梦辰 (Mengchen Zhao)
X
Xiapu Luo *
薛磊 封面图
薛磊 (Lei Xue)
李振华 封面图
李振华 (Zhenhua Li)
T
Tony T. N. Miu
X
Xiaohong Guan
DOI:10.1109/TDSC.2019.2892370delete
delete原文链接
delete原文求助
delete分享
delete收藏
摘要

摘要

En 中文
With the advancement of large-scale coordinated attacks, the adversary is shifting away from traditional distributed denial of service (DDoS) attacks against servers to sophisticated DDoS attacks against Internet infrastructures. Link flooding attacks (LFAs) are such powerful attacks against Internet links. Employing network measurement techniques, the defender could detect the link under attack. However, given the large number of Internet links, the defender can only monitor a subset of the links simultaneously, whereas any link might be attacked. Therefore, it remains challenging to practically deploy detection methods. This paper addresses this challenge from a game-theoretic perspective, and proposes a randomized approach (like security patrolling) to optimize LFA detection strategies. Specifically, we formulate the LFA detection problem as a Stackelberg security game, and design randomized detection strategies in consideration of the adversary's behavior, where best and quantal response models are leveraged to characterize the adversary's behavior. We employ a series of techniques to solve the nonlinear and nonconvex NP-hard optimization problems for finding the equilibrium. The experimental results demonstrate the necessity of handling LFAs from a game-theoretic perspective and the effectiveness of our solutions. We believe our study is a significant step forward in formally understanding LFA detection strategies.
Keyword:
Servers
Internet
Computer crime
Monitoring
Loss measurement
Degradation
Internet security
link flooding attack
security patrolling
AI总结

AI总结

对已上传原文的论文进行重点信息的提取,主要内容包括:简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。

期刊

IEEE Transactions on Dependable and Secure Computing 封面图
IEEE Transactions on Dependable and Secure Computing
IF:
7.5
论文数:
2.6K
被引数:
9.6K

机构

H
hong kong polytechnic university
学者数:
3.0W
论文数: 4.1W
被引数: 921
X
xi'an jiaotong university
学者数:
9.3W
论文数: 6.7W
被引数: 75
T
tsinghua university
学者数:
11.9W
论文数: 10.0W
被引数: 137
N
Nanyang Technological University
学者数:
4.9W
论文数: 4.8W
被引数: 8.1W
学者 查看更多机构
引用论文

引用论文

err分享
err收藏
err分享
err收藏
Accurately Measuring Denial of Service in Simulation and Testbed Experiments
err2009-04-01
err44
errOAAI
errMirkovic, Jelena; Hussain, Alefiya; Fahmy, Sonia; Reiher, Peter; Thomas, Roshan K.
err分享
err收藏
A simple antegrade perfusion method for isolating viable single cardiomyocytes from neonatal to aged mice
err2018-04-26
err0
errOAAI
errMariko Omatsu-Kanbe; Kengo Yoshioka; Ryo Fukunaga; Hironori Sagawa; Hiroshi Matsuura
err分享
err收藏
学者 查看更多内容