Near Optimal Filtering and Routing Policies against Distributed Denial-of-Service (DDoS) Attacks
Date Issued
2008
Date
2008
Author(s)
Chiang, Cheng-You
Abstract
Distributed Denial-of-Service (DDoS) attacks have become an impending threat toward today’s Internet. During DDoS attacks, numerous malicious packets occupy a victim server and lead to the difficulty of the legitimate user’s access. Even if the filtering thwarts DDoS attacks, no legitimate users can escape the collateral damage.n this thesis, we model the DDoS attack-defense scenario as a two-level mathematical programming problem. In the inner problem, a defender tries to allocate the limited defense resources for the maximization of the legitimate traffic. In the outer problem, a DDoS attacker tries to allocate the limited attack resources in order to minimize the legitimate traffic. A Lagrangean relaxation-based algorithm is proposed to solve the inner problem, and a subgradient-based algorithm is proposed to solve the outer problem.
Subjects
Distributed Denial-of-Service
Filter
Mathematical Programming
Resources Allocation
Optimization and Lagrangean Relaxation
File(s)![Thumbnail Image]()
Loading...
Name
ntu-97-R95725005-1.pdf
Size
23.32 KB
Format
Adobe PDF
Checksum
(MD5):3682fc04c2ecb044c479b25198dc7c3e