2006/05/08 by Srinivas Shakkottai, Shakkottai, Srinivas, R. Srikant +1 · 12 citations
Computer Science · #Computer network #Computer science #Computer security #Cryptography and Security (cs.CR) #Distributed computing #FOS: Computer and information sciences #Hardware Architecture (cs.AR) #Internet Traffic Analysis and Secure E-voting #Network Security and Intrusion Detection #Networking and Internet Architecture (cs.NI) #Peer-to-Peer Network Technologies #Peer-to-peer #Server #The Internet #World Wide Web #cs.AR #cs.CR #cs.NI
paper · pdf · doi:10.48550/arxiv.cs/0605034
published in arXiv (Cornell University) (Cornell University) · 11 Pages
arxiv created 2006/05/08 · openalex publication_date 2006/05/08 · arxiv updated 2009/12/01 · openalex created_date 2025/10/10 · openalex updated_date 2026/08/05
Internet worms, which spread in computer networks without human mediation, pose a severe threat to computer systems today. The rate of propagation of worms has been measured to be extremely high and they can infect a large fraction of their potential hosts in a short time. We study two different methods of patch dissemination to combat the spread of worms. We first show that using a fixed number of patch servers performs woefully inadequately against Internet worms. We then show that by exploiting the exponential data dissemination capability of P2P systems, the spread of worms can be halted very effectively. We compare the two methods by using fluid models to compute two quantities of interest: the time taken to effectively combat the progress of the worm and the maximum number of infected hosts. We validate our models using Internet measurements and simulations.