A feasibility study on defending against ultra-fast topological worms

Liang Xie, Sencun Zhu

Research output: Chapter in Book/Report/Conference proceedingConference contribution

18 Scopus citations

Abstract

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.

Original languageEnglish (US)
Title of host publicationProceedings - P2P - 7th IEEE International Conference on Peer-to-Peer Computing
Pages61-68
Number of pages8
DOIs
StatePublished - 2007
EventP2P - 7th IEEE International Conference on Peer-to-Peer Computing - Galway, Ireland
Duration: Sep 2 2007Sep 5 2007

Publication series

NameProceedings - P2P - 7th IEEE International Conference on Peer-to-Peer Computing

Other

OtherP2P - 7th IEEE International Conference on Peer-to-Peer Computing
Country/TerritoryIreland
CityGalway
Period9/2/079/5/07

All Science Journal Classification (ASJC) codes

  • Computer Networks and Communications
  • Control and Systems Engineering

Fingerprint

Dive into the research topics of 'A feasibility study on defending against ultra-fast topological worms'. Together they form a unique fingerprint.

Cite this