Decentralized Protection Strategies Against SIS Epidemics in Networks

IEEE Transactions on Control of Network Systems

Volumn 2, Issue 4, 2015, Pages 406-419

  Trajanovski, Stojan ^a   Hayel, Yezekael ^b   Altman, Eitan ^c   Wang, Huijuan ^a   Van Mieghem, Piet ^a  

^a DELFT UNIVERSITY OF TECHNOLOGY   (Netherlands)

^b UNIVERSITY OF AVIGNON   (France)

^c INRIA   (France)

Author keywords

Decentralized network protection; game theory; virus spread

Indexed keywords

GAME THEORY; ITERATIVE METHODS; TOPOLOGY; VIRUSES; BIOLOGICAL SYSTEMS; CONTROL SYSTEMS; ECOSYSTEMS; INVESTMENTS;

DECENTRALIZED ALGORITHMS; DECENTRALIZED NETWORKS; IMPORTANT FEATURES; NETWORK TOPOLOGY; OPTIMAL PROTECTION; PRICE OF ANARCHY; PROTECTION STRATEGY; VIRUS SPREADS; APPROXIMATION METHODS; BIOLOGICAL SYSTEM MODELING; GAMES; NASH EQUILIBRIA;

COMPUTER VIRUSES;

EID: 84961589966     PISSN: 23255870     EISSN: None     Source Type: Journal    
DOI: 10.1109/TCNS.2015.2426755     Document Type: Article

References (50)

1. P. Van Mieghem, J. Omić, and R. Kooij, "Virus spread in networks," IEEE/ACM Trans. Netw., vol. 17, no. 1, pp. 1-14, Feb. 2009.
2. D. Chakrabarti, Y. Wang, C. Wang, J. Leskovec, and C. Faloutsos, "Epidemic thresholds in real networks," ACM Trans. Inf. Syst. Secur., vol. 10, pp. 1:1-1:26, Jan. 2008.
3. A. Ganesh, L. Massoulie, and D. Towsley, "The effect of network topology on the spread of epidemics," in Proc. IEEE INFOCOM, 2005, vol. 2, pp. 1455-1466.
4. J. Kephart and S.White, "Directed-graph epidemiological models of computer viruses," in Proc. IEEE Symp. Research Security and Privacy, 1991, pp. 343-359.
5. H. Wang, Q. Li, G. D'Agostino, S. Havlin, H. E. Stanley, and P. Van Mieghem, "Effect of the interconnected network structure on the epidemic threshold," Phys. Rev. E, vol. 88, p. 022801, Aug. 2013.
6. P. Van Mieghem, "The viral conductance of a network," Comput. Commun., vol. 35, pp. 1494-1506, Jul. 2012.
7. R. Cohen, S. Havlin, and D. Ben Avraham, "Efficient immunization strategies for computer networks and populations," Phys. Rev. Lett., vol. 91, p. 247901, Dec. 2003.
8. C. M. Schneider, T. Mihaljev, S. Havlin, and H. J. Herrmann, "Suppressing epidemics with a limited amount of immunization units," Phys. Rev. E, vol. 84, p. 061911, Dec. 2011.
9. J. Omić, J. Martín-Hernández, and P. Van Mieghem, "Network protection against worms and cascading failures using modularity partitioning," in Proc. Int. Teletraffic Congr., Sep. 2010, pp. 1-8.
10. P. Van Mieghem, D. Stevanović, F. Kuipers, C. Li, R. van de Bovenkamp, D. Liu, and H. Wang, "Decreasing the spectral radius of a graph by link removals," Phys. Rev. E, vol. 84, p. 016101, Jul. 2011.
11. D. Fudenberg and J. Tirole, Game Theory. Cambridge, MA, USA: MIT, 1991.
12. P. VanMieghem, "Epidemic phase transition of the SIS type in networks," Europhys. Lett., vol. 97, no. 4, p. 48004, 2012.
13. A. Orda, R. Rom, and N. Shimkin, "Competitive routing in multiuser communication networks," IEEE/ACM Trans. Netw., vol. 1, no. 5, pp. 510-521, Oct. 1993.
14. E. Altman, T. Jimenez, T. Basar, and N. Shimkin, "Competitive routing in networks with polynomial cost," in Proc. IEEE INFOCOM, 2000, vol. 3, pp. 1586-1593.
15. Y. A. Korilis and A. A. Lazar, "On the existence of equilibria in noncooperative optimal flow control," JACM, vol. 42, pp. 584-613, May 1995.
16. A. Nahir, A. Orda, and D. Raz, "Workload factoring with the cloud: A game-theoretic perspective," in Proc. IEEE INFOCOM, 2012, pp. 2566-2570.
17. A. Nahir, A. Orda, and A. Freund, "Topology design of communication networks: A game-theoretic perspective," IEEE/ACM Trans. Netw., vol. 22, no. 2, pp. 405-414, Apr. 2014.
18. E. Gourdin, J. Omić, and P. Van Mieghem, "Optimization of network protection against virus spread," in Proc. 8th Intl. Workshop Design Rel. Commun. Netw., 2011, pp. 86-93.
19. E. Koutsoupias and C. Papadimitriou, "Worst-case equilibria," Comput. Sci. Rev., vol. 3, no. 2, pp. 65-69, 2009.
20. T. Roughgarden and E. Tardos, "How bad is selfish routing?" JACM, vol. 49, pp. 236-259, Mar. 2002.
21. N. Nisan, T. Roughgarden, E. Tardos, and V. V. Vazirani, Algorithmic Game Theory. Cambridge, U.K.: Cambridge University Press, 2007.
22. J. Omić, A. Orda, and P. Van Mieghem, "Protecting against network infections: A game theoretic perspective," in Proc. IEEE INFOCOM, 2009, pp. 1485-1493.
23. J. Aspnes, K. Chang, and A. Yampolskiy, "Inoculation strategies for victims of viruses and the sum-of-squares partition problem," J. Comput. Syst. Sci., vol. 72, no. 6, pp. 1077-1093, 2006.
24. D. Acemoglu, A. Malekian, and A. Ozdaglar, "Network Security and Contagion," NBERWorking Paper No. 19174, Jun. 2013. [Online]. Available: http://www.dx.doi.org/10.3386/w19174
25. L. Jiang, V. Anantharam, and J. Walrand, "Efficiency of selfish investments in network security," in NetEcon, 2008, pp. 31-36, ACM. [Online]. Available: http://dl.acm.org/citation.cfm?id=1403035
26. M. Lelarge and J. Bolot, "Network externalities and the deployment of security features and protocols in the internet," in SIGMETRICS, 2008, pp. 37-48, ACM. [Online]. Available: http://dl.acm.org/citation. cfm?id=1375463
27. M. Kearns and L. E. Ortiz, "Algorithms for interdependent security games," in In Advances in Neural Information Processing Systems. Cambridge, MA, USA: MIT, 2004.
28. V. M. Preciado, M. Zargham, C. Enyioha, A. Jadbabaie, and G. Pappas, "Optimal vaccine allocation to control epidemic outbreaks in arbitrary networks," in Proc. IEEE Conf. Dec. Control, Dec. 2013, pp. 7486-7491.
29. V. M. Preciado, M. Zargham, and D. Sun, "Traffic control for network protection against spreading processes," in Conference on Information Sciences and Systems (CISS), 2014. [Online]. Available: http://arxiv.org/ abs/1310.4894
30. G. Theodorakopoulos, J.-Y. Le Boudec, and J. Baras, "Selfish response to epidemic propagation," IEEE Trans. Autom. Control, vol. 58, no. 2, pp. 363-376, Feb. 2013.
31. S. Saha, A. Adiga, and A. Vullikanti, "Equilibria in epidemic containment games," presented at the AAAI Conf. Artif. Intel., Quebec City, QC, Canada, 2014.
32. P. Van Mieghem, "The N-intertwined SIS epidemic network model," Computing, vol. 93, no. 2-4, pp. 147-169, 2011.
33. S. Trajanovski, F. A. Kuipers, J. Martín-Hernández, and P. Van Mieghem, "Generating graphs that approach a prescribed modularity," Comput. Commun., vol. 36, no. 4, pp. 363-372, 2013.
34. J. Omić, R. Kooij, and P. Van Mieghem, "Virus spread in complete bipartite graphs," Bionetics, pp. 49-56, 2007.
35. S. Trajanovski, H. Wang, and P. Van Mieghem, "Maximum modular graphs," Eur. Phys. J. B, vol. 85, no. 7, 2012.
36. P. Van Mieghem and J. Omić, "In-homogeneous virus spread in networks," ArXiv, Jun. 2013.
37. S. Bonaccorsi, S. Ottaviano, F. De Pellegrini, A. Socievole, and P. Van Mieghem, "Epidemic outbreaks in two-scale community networks," Phys. Rev. E, vol. 90, p. 012810, Jul. 2014.
38. R. Rosenthal, "A class of games possessing pure-strategy nash equilibria," Intl. J. Game Theory, vol. 2, no. 1, pp. 65-67, 1973.
39. D. Monderer and L. S. Shapley, "Potential games," Games Econom. Behav., vol. 14, no. 1, pp. 124-143, 1996.
40. Y. Chen and R. Gazzale, "When does learning in games generate convergence to nash equilibria? The role of supermodularity in an experimental setting," Amer. Econom. Rev., vol. 94, pp. 1505-1535, Sep. 2004.
41. R. Cominetti, E. Melo, and S. Sorin, "A payoff-based learning procedure and its application to traffic games," Games and Economic Behavior, vol. 70, pp. 71-83, Sep. 2010.
42. P. S. Sastry, V. V. Phansalkar, and M. Thathachar, "Decentralized learning of nash equilibria in multi-person stochastic games with incomplete information," IEEE Trans. Systems, Man Cybern., vol. 24, no. 5, pp. 769-777, May 1994.
43. J. W. Weibull, Evolutionary Game Theory. Cambridge, U.K.: Cambridge Univ. Press, 1995.
44. O. Bournez and J. Cohen, "Learning equilibria in games by stochastic distributed algorithms," in Computer and Information Sciences III. London, U.K.: Springer, 2013, pp. 31-38.
45. R. Kleinberg, G. Piliouras, and E. Tardos, "Multiplicative updates outperform generic no-regret learning in congestion games," in Proc. Symp. Theory Comput., 2009, pp. 533-542, ACM.
46. P. Coucheney, C. Touati, and B. Gaujal, "Fair and efficient user-network association algorithm for multi-technology wireless networks," in Proc. IEEE INFOCOM, 2009, pp. 2811-2815.
47. Y. Xin and R. Chandramouli, "Stochastic learning solution for distributed discrete power control game in wireless data networks," IEEE/ACM Trans. Netw., vol. 16, no. 4, pp. 932-944, Aug. 2008.
48. G. Gasper andM. Rahman, Basic Hypergeometric Series. Encyclopedia of Mathematics and its Applications. Cambridge, U.K.: Cambridge Univ. Press, 2004.
49. G. Lorentz, Bernstein Polynomials. Toronto, ON, Canada: Univ. Toronto Press, 1953.
50. S. N. Bernstein, "Démonstration du théorème de weierstrass fondée sur le calcul des probabilités," (in French), Commun. Soc. Math. Kharkov, vol. 13, no. 1, pp. 1-2, 1912.