Decentralized Protection Strategies against SIS Epidemics in Networks
Abstract
Defining an optimal protection strategy against viruses, spam propagation or any other kind of contamination process is an important feature for designing new networks and architectures. In this work, we consider decentralized optimal protection strategies when a virus is propagating over a network through a SIS epidemic process. We assume that each node in the network can fully protect itself from infection at a constant cost, or the node can use recovery software, once it is infected. We model our system using a game theoretic framework and find pure, mixed equilibria, and the Price of Anarchy (PoA) in several network topologies. Further, we propose both a decentralized algorithm and an iterative procedure to compute a pure equilibrium in the general case of a multiple communities network. Finally, we evaluate the algorithms and give numerical illustrations of all our results.
Keywords
Cite
@article{arxiv.1409.1730,
title = {Decentralized Protection Strategies against SIS Epidemics in Networks},
author = {Stojan Trajanovski and Yezekael Hayel and Eitan Altman and Huijuan Wang and Piet Van Mieghem},
journal= {arXiv preprint arXiv:1409.1730},
year = {2017}
}
Comments
accepted for publication in IEEE Transactions on Control of Network Systems