Skip to main content
Back to USENIX
  • Conferences
  • Students
Sign in

USENIX Conference Policies

  • Event Code of Conduct
  • Conference Network Policy
  • Statement on Environmental Responsibility Policy

Analyzing Cooperative Containment of Fast Scanning Worms

Fast scanning worms, that can infect nearly the entire vulnerable population in order of minutes, are among the most serious threats to the Internet today. In this work, we investigate the efficacy of cooperation among Internet firewalls in containing such worms. We first propose a model for firewall-level cooperation and then study the containment in our model of cooperation using analysis and simulation. Our results suggest that, with moderate overhead, cooperation among Internet firewalls can provide 95% containment under 10% deployment while being resilient to 100-1000 malicious firewalls.

Jayanthkumar Kannan, University of California, Berkeley

Lakshminarayanan Subramanian, University of California, Berkeley

Ion Stoica, University of California, Berkeley

Randy H. Katz, University of California, Berkeley

BibTeX
@inproceedings {269284,
author = {Jayanthkumar Kannan and Lakshminarayanan Subramanian and Ion Stoica and Randy H. Katz},
title = {Analyzing Cooperative Containment of Fast Scanning Worms},
booktitle = {Steps to Reducing Unwanted Traffic on the Internet Workshop (SRUTI 05)},
year = {2005},
address = {Cambridge, MA},
url = {https://www.usenix.org/conference/sruti-05/analyzing-cooperative-containment-fast-scanning-worms},
publisher = {USENIX Association},
month = jul
}
Download

Links

Paper: 
http://usenix.org/publications/library/proceedings/sruti05/tech/full_papers/kannan/kannan.pdf
Paper (HTML): 
http://usenix.org/publications/library/proceedings/sruti05/tech/full_papers/kannan/kannan_html/index.html
Slides: 
http://usenix.org/publications/library/proceedings/sruti05/tech/talks/kannan.pdf
  • Log in or register to post comments

© USENIX
EIN 13-3055038

  • Privacy Policy
  • Contact Us