Scalable traceback against distributed denial of service

  • Authors:
  • Mimoza Durresi;Leonard Barolli;Vamsi Paruchuri;Arjan Durresi

  • Affiliations:
  • Department of Information and Communication Engineering, Faculty of Information Engineering, Fukuoka Institute of Technology, 3 30 1 Wajiro-Higashi, Higashi-ku, Fukuoka 811 0295, Japan.;Department of Information and Communication Engineering, Faculty of Information Engineering, Fukuoka Institute of Technology, 3 30 1 Wajiro-Higashi, Higashi-ku, Fukuoka 811 0295, Japan.;Department of Computer Science, Louisiana State University, Baton Rouge, LA 70803, USA.;Department of Computer Science, Louisiana State University, Baton Rouge, LA 70803, USA

  • Venue:
  • International Journal of Web and Grid Services
  • Year:
  • 2006

Quantified Score

Hi-index 0.00

Visualization

Abstract

Distributed Denial of Service (DDoS) attacks have recently emerged as one of the most potent, if not the greatest, weaknesses of the internet. Previous solutions for this problem try to traceback to the exact origin of the attack by requiring the participation of all routers. For many reasons this requirement is impractical. In the presence of non-participating routers most of the proposed schemes either fail in reconstructing the attack path or end up with an approximate location of the attacker. We propose Scalable Traceback (ST), an approach based on autonomous systems, to address this issue. ST has significant improvements over other works in several dimensions: (1) with just a few tens of packets, ST enables the victim to reconstruct the attack graph, an improvement of two to three orders of magnitude when compared to previous schemes; (2) ST scales to large distributed attacks with thousands of attacks; (3) the reconstruction takes only tens of seconds; (4) ST performs well even in the presence of legacy routers.