This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
10th IEEE International Symposium on Modeling, Analysis, and Simulation of Computer and Telecommunications Systems (MASCOTS'02)
You Can Run, But You Can't Hide: An Effective Methodology to Traceback DDoS Attackers
Fort Worth, Texas
October 11-October 16
ISBN: 0-7695-1840-0
With the increase of sophistication and severity of DDoS attack, it is important for a victim site to quickly identify the potential attackers and eliminate their traffic. Our work is based on the probabilistic marking algorithm by Savage[12] in which an attack graph can be constructed by a victim site. We extend the concept further such that we can deduce the local traffic rate of each router in the attack graph based on the received marked packets. Given the intensities of these local traffic rates, we can eliminate these attackers fromsending high volume of traffic to a victim site. More importantly, we propose a theoretical method to determine the minimum stable time tmin, which is the minimum time it takes to accurately determine the local traffic rate of every participating router in the attack graph.
Citation:
K. T. Law, J. C. S. Lui, D. K. Y. Yau, "You Can Run, But You Can't Hide: An Effective Methodology to Traceback DDoS Attackers," mascots, pp.0433, 10th IEEE International Symposium on Modeling, Analysis, and Simulation of Computer and Telecommunications Systems (MASCOTS'02), 2002
Usage of this product signifies your acceptance of the Terms of Use.