A New Metric for Robustness with Respect to Virus Spread

Authors:
Robert E. Kooij;Phillip Schumm;Caterina Scoglio;Mina Youssef
Affiliations:
Delft University of Technology, EEMCS, The Netherlands and TNO ICT, The Netherlands and Kansas State University, EECE, U.S.A.;Kansas State University, EECE, U.S.A.;Kansas State University, EECE, U.S.A.;Kansas State University, EECE, U.S.A.
Venue:
NETWORKING '09 Proceedings of the 8th International IFIP-TC 6 Networking Conference
Year:
2009

Citing 4
Cited 1

Modeling the effects of timing parameters on virus propagation

Proceedings of the 2003 ACM workshop on Rapid malcode
The Structure and Dynamics of Networks: (Princeton Studies in Complexity)

The Structure and Dynamics of Networks: (Princeton Studies in Complexity)
Epidemic Information Dissemination in Distributed Systems

Computer
Virus spread in networks

IEEE/ACM Transactions on Networking (TON)

The viral conductance of a network

Computer Communications

Quantified Score

Hi-index	0.00

Visualization

Abstract

The robustness of a network is depending on the type of attack we are considering. In this paper we focus on the spread of viruses on networks. It is common practice to use the epidemic threshold as a measure for robustness. Because the epidemic threshold is inversely proportional to the largest eigenvalue of the adjacency matrix, it seems easy to compare the robustness of two networks. We will show in this paper that the comparison of the robustness with respect to virus spread for two networks actually depends on the value of the effective spreading rate *** . For this reason we propose a new metric, the viral conductance, which takes into account the complete range of values *** can obtain. In this paper we determine the viral conductance of regular graphs, complete bi-partite graphs and a number of realistic networks.