Sciweavers

Share
ICDCS
2010
IEEE

Existence Theorems and Approximation Algorithms for Generalized Network Security Games

8 years 11 months ago
Existence Theorems and Approximation Algorithms for Generalized Network Security Games
—Aspnes et al [2] introduced an innovative game for modeling the containment of the spread of viruses and worms (security breaches) in a network. In this model, nodes choose to install anti-virus software or not on an individual basis while the viruses or worms start from a node chosen uniformly at random and spread along paths consisting of insecure nodes. They showed the surprising result that a pure Nash Equilibrium always exists when all nodes have identical installation costs and identical infection costs. In this paper we present a substantial generalization of the model of [2] that allows for arbitrary security and infection costs, and arbitrary distributions for the starting point of the attack. More significantly, our model GNS(d) incorporates a network locality parameter d which represents a hop-limit on the spread of infection as accounted for in the strategic decisions, due to either the intrinsic nature of the infection or the extent of neighborhood information that is ...
V. S. Anil Kumar, Rajmohan Rajaraman, Zhifeng Sun,
Added 15 Aug 2010
Updated 15 Aug 2010
Type Conference
Year 2010
Where ICDCS
Authors V. S. Anil Kumar, Rajmohan Rajaraman, Zhifeng Sun, Ravi Sundaram
Comments (0)
books