Scalable traceback against distributed denial of service Online publication date: Mon, 04-Sep-2006
by Mimoza Durresi, Leonard Barolli, Vamsi Paruchuri, Arjan Durresi
International Journal of Web and Grid Services (IJWGS), Vol. 2, No. 2, 2006
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.
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Web and Grid Services (IJWGS):
Login with your Inderscience username and password:
Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.
If you still need assistance, please email subs@inderscience.com
Our Blog 
Follow us on Twitter 
Visit us on Facebook