A Dynamic Programming Algorithm for the Generalized Minimum Filter Placement Problem on Tree Structures

Authors:
E. Chisonge Mofya;J. Cole Smith
Affiliations:
Department of Systems and Industrial Engineering, University of Arizona, Tucson, Arizona 85721;Department of Industrial and Systems Engineering, University of Florida, Gainesville, Florida 32611
Venue:
INFORMS Journal on Computing
Year:
2009

Citing 4
Cited 0

Practical network support for IP traceback

Proceedings of the conference on Applications, Technologies, Architectures, and Protocols for Computer Communication
On the effectiveness of route-based packet filtering for distributed DoS attack prevention in power-law internets

Proceedings of the 2001 conference on Applications, technologies, architectures, and protocols for computer communications
Denial-of-Service Attacks Rip the Internet

Computer
DDoS attacks and defense mechanisms: classification and state-of-the-art

Computer Networks: The International Journal of Computer and Telecommunications Networking

Quantified Score

Hi-index	0.00

Visualization

Abstract

We consider a network where nodes communicate by exchanging information packets whose fields include the address of the sending node and that of the destination node. In the absence of some verification mechanism, an attacking node can send packets to another node using a forged origin address. In this study, we consider an optimization problem of identifying a minimum cardinality subset of verification nodes on a tree such that the number of attacks from any forged origin to any destination is limited to a prescribed level. For the case in which communication is permitted between every node in the tree, we develop an optimal polynomial-time dynamic programming algorithm for this problem. We compare the performance of the dynamic programming algorithm against a mixed-integer programming model on randomly generated tree networks at varied levels of security.