Name
Abstract | ||
|---|---|---|
The emerging link flooding attacks (LFAs) increasingly attract significant attention in both academia and industry, due to their huge threat to the routing infrastructure. Compared with traditional distributed denial-of-service attacks (DDoS) that target servers, LFAs target critical links. Stemming from coordinated flows between bots and public servers or among bots, the attack traffic flows are aggregated at a critical link, thereby gradually making a network connected to the critical link disconnected as the aggregated attack traffic flows grow intensified. It is commonly believed that LFAs are far more sophisticated than traditional DDoS attacks. Nevertheless, whether such sophistication comes without a downside has never been investigated. In this paper, we advance the notion of strike precision of LFAs, and reveal that LFAs may exhibit attack interference which might restrict their applicability from the adversary’s standpoint. Due to attack interference, strike precision of LFAs would be lowered. That is, while disconnecting a network, LFAs may unexpectedly interfere the connectivity of innocent networks nearby, undermining the stealthiness and persistence of LFAs. We tackle a series of questions surrounding strike precision, for fostering more research concerning the practical aspects of LFAs. |
Year | DOI | Venue |
|---|---|---|
2018 | 10.1007/978-3-030-02744-5_32 | NSS |
Field | DocType | Citations |
Denial-of-service attack,Computer science,Computer security,Server,Computer network,Adversary,Flooding (psychology),Sophistication,restrict | Conference | 0 |
PageRank | References | Authors |
0.34 | 13 | 5 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Jiahao Peng | 1 | 0 | 0.68 |
| Xiaobo Ma | 2 | 31 | 5.32 |
| Jianfeng Li | 3 | 84 | 35.06 |
| Lei Xue | 4 | 103 | 16.03 |
| Wenjun Hu | 5 | 16 | 1.56 |