Optimization of network protection against virus spread

Optimization of network protection against virus spread

Gourdin, E.
Omic, J.
Van Mieghem, P.

Electrical Engineering, Mathematics and Computer Science

Network Architectures and Services (NAS) Group

2011-10-12

The effect of virus spreading in a telecommunication network, where a certain curing strategy is deployed, can be captured by epidemic models. In the N-intertwined model proposed and studied in [1], [2], the probability of each node to be infected depends on the curing and infection rate of its neighbors. In this paper, we consider the case where all infection rates are equal and different values of curing rates can be deployed within a given budget, in order to minimize the overall infection of the network. We investigate this difficult optimization together with a related problem where the curing budget must be minimized within a given level of network infection. Some properties of these problems are derived and several solution algorithms are proposed. These algorithms are compared on two real world network instances, while Erdos-Renyi graphs and some special graphs such as the cycle, the star, the wheel and the complete bipartite graph are also addressed.

http://resolver.tudelft.nl/uuid:866c9b9d-3cd5-4263-989c-d8cf39742f2c

nextgenerationinfrastructures.eu

8th International Workshop on Design of Reliable Communication Networks (DRCN 2011), October 10-12, Krakow, Poland.

Institutional Repository

conference paper

(c) 2011 Gourdin, E.
Omic, J.
Van Mieghem, P.