Home

About

Advanced Search

Browse by Discipline

Scientific Societies

E-print Alerts

Add E-prints

E-print Network
FAQHELPSITE MAPCONTACT US


  Advanced Search  

 
Worm Versus Alert: Who Wins in a Battle for Control of a Large-Scale Network?
 

Summary: Worm Versus Alert: Who Wins in a Battle for
Control of a Large-Scale Network?
James Aspnes1
, Navin Rustagi2
, and Jared Saia2
1
Department of Computer Science, Yale University email: aspnes@cs.yale.edu. This
research was partially supported by NSF CNS 0435201
2
Department of Computer Science, University of New Mexico, Albuquerque, NM
87131-1386; email: {navin, saia}@cs.unm.edu. This research was partially supported
by NSF CAREER Award 0644058 and NSF CCR-0313160
Abstract. Consider the following game between a worm and an alert3
over a network of n nodes. Initially, no nodes are infected or alerted
and each node in the network is a special detector node independently
with small but constant probability. The game starts with a single node
becoming infected. In every round thereafter, every infected node sends
out a constant number of worms to other nodes in the population, and
every alerted node sends out a constant number of alerts. Nodes in the
network change state according to the following four rules: 1) If a worm

  

Source: Aspnes, James - Department of Computer Science, Yale University

 

Collections: Computer Technologies and Information Sciences