Name
Abstract | ||
|---|---|---|
Volume-based network denial-of-service (DoS) attacks refer to a class of cyber attacks where an adversary seeks to block user traffic from service by sending adversarial traffic that reduces the available user capacity. In this paper, we explore the fundamental limits of volume-based network DoS attacks by studying the minimum required rate of adversarial traffic and investigating optimal attack strategies. We start our analysis with single-hop networks where user traffic is routed to servers following the Join-the-Shortest-Queue (JSQ) rule. Given the service rates of servers and arrival rates of user traffic, we first characterize the feasibility region of the attack and show that the attack is feasible if and only if the rate of the adversarial traffic lies in the region. We then design an attack strategy that is (i).optimal: it guarantees the success of the attack whenever the adversarial traffic rate lies in the feasibility region and (ii).oblivious: it does not rely on knowledge of service rates or user traffic rates. Finally, we extend our results on the feasibility region of the attack and the optimal attack strategy to multi-hop networks that employ Back-pressure (Max-Weight) routing. At a higher level, this paper addresses a class of dual problems of stochastic network stability, i.e., how to optimally de-stabilize a network.
|
Year | DOI | Venue |
|---|---|---|
2019 | 10.1145/3366698 | Proceedings of the ACM on Measurement and Analysis of Computing Systems |
Keywords | Field | DocType |
denial-of-service attacks, network queueing theory, stochastic network scheduling | Denial-of-service attack,Computer security,Computer science | Journal |
Volume | Issue | Citations |
3 | 3 | 0 |
PageRank | References | Authors |
0.34 | 0 | 2 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Xinzhe Fu | 1 | 0 | 0.68 |
| Eytan Modiano | 2 | 3714 | 314.44 |