loading...
 This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Seventh IEEE International Conference on Peer-to-Peer Computing (P2P 2007)
A Feasibility Study on Defending Against Ultra-Fast TopologicalWorms
Galway, Ireland
September 02-September 05
ISBN: 0-7695-2986-0
Liang Xie, Penn State University
Sencun Zhu, Penn State University
Self-propagating worms have been terrorizing the Internet for several years and they are becoming imminent threats to large-scale Peer-to-Peer (P2P) systems featuring rich host connectivity and popular data services. In this paper, we consider topological worms, which exploit P2P host vulnerabilities and topology information to spread in an ultra-fast way. We study the feasibility of leveraging the existing P2P overlay structure for distributing automated security patches to vulnerable machines. Two approaches are examined: a partition-based approach, which utilizes immunized hosts to proactively stop worm spread in the overlay graph, and a Connected Dominating Set(CDS)-based approach, which utilizes a group of dominating nodes in the overlay to achieve fast patch dissemination in a race with the worm. We demonstrate through analysis and simulations that both methods can result in effective worm containment.
Citation:
Liang Xie, Sencun Zhu, "A Feasibility Study on Defending Against Ultra-Fast TopologicalWorms," p2p, pp.61-70, Seventh IEEE International Conference on Peer-to-Peer Computing (P2P 2007), 2007
Usage of this product signifies your acceptance of the Terms of Use.