Skip to main content
USENIX
  • Conferences
  • Students
Sign in

connect with us


  •  Twitter
  •  Facebook
  •  LinkedIn
  •  Google+
  •  YouTube

twitter

Tweets by @usenix

usenix conference policies

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

You are here

Home ยป Analyzing Cooperative Containment of Fast Scanning Worms
Tweet

connect with us

Analyzing Cooperative Containment of Fast Scanning Worms

Abstract: 

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

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

  • Privacy Policy
  • Contact Us