Abstract
In the paper, the DDoS scenario is modelled as a mathematical programming problem. The defender strategically utilizes the limited resources to maximize the legitimate traffic, and he can adopt packet marking to observe the network status. The information extracts from the marking field can help the defender develop a defense strategy which combines packet filtering and packet blocking. A Lagrangean relaxation-based algorithm is proposed to optimally solve the problem.
| Original language | English (US) |
|---|---|
| Title of host publication | PACIS 2010 - 14th Pacific Asia Conference on Information Systems |
| Pages | 1703-1710 |
| Number of pages | 8 |
| State | Published - 2010 |
| Externally published | Yes |
| Event | 14th Pacific Asia Conference on Information Systems, PACIS 2010 - Taipei, Taiwan, Province of China Duration: Jul 9 2010 → Jul 12 2010 |
Other
| Other | 14th Pacific Asia Conference on Information Systems, PACIS 2010 |
|---|---|
| Country/Territory | Taiwan, Province of China |
| City | Taipei |
| Period | 7/9/10 → 7/12/10 |
Keywords
- Blocking
- Distributed-denial-of-service (DDoS)
- Filtering
- Mathematical programming
- Optimization and lagrangean relaxation
- Packet marking
ASJC Scopus subject areas
- Information Systems