Protecting against network infections: A game theoretic perspective

Proceedings - IEEE INFOCOM

Volumn , Issue , 2009, Pages 1485-1493

  Omic, Jasmina ^a   Orda, Ariel ^b   Van Mieghem, Piet ^a  

^a DELFT UNIVERSITY OF TECHNOLOGY   (Netherlands)

^b TECHNION ISRAEL INSTITUTE OF TECHNOLOGY   (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

CRITICAL PROBLEMS; EPIDEMIC MODELS; EPIDEMIC PROCESS; EPIDEMIC THEORY; GAME-THEORETIC PERSPECTIVES; INTERNET WORM; NASH EQUILIBRIUM; NON-COOPERATIVE BEHAVIORS; NONCOOPERATIVE GAME MODELS; PRICE OF ANARCHY; PROTECTION STRATEGY; SECURITY BREACHES; THEORETICAL APPROACH; UNIFIED FRAMEWORK;

AD HOC NETWORKS; COMPUTER VIRUSES; COMPUTER WORMS; EMPLOYMENT; EPIDEMIOLOGY; INTERNET; NETWORK SECURITY; SWITCHING CIRCUITS;

GAME THEORY;

EID: 67650416963     PISSN: 0743166X     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/INFCOM.2009.5062065     Document Type: Conference Paper

References (31)

1. P. Van Mieghem, J. Omic, R. Kooij, "Virus Spread in Networks", accepted for IEEE/ACM Transactions on Networking.
2. P. Van Mieghem, J. Omic, "In-homogeneous Virus spread in Networks", Technical report 20080801, http://www.nas.its.tudelft.n1/ people/Piet/TUDelftReports.html
3. J.B. Rosen, "Existence and Uniqueness of Equilibrium Point for Concave N-person Games", Econometrica, Vol. 33, No. 3, pp. 520-534, Jul. 1965.
4. K. Keong Tan, J. Yu and X. Yuan, "Existence Theorems of Nash Equilibria for Non-Cooperative N-Person Games", International Journal of Game Theory, Vol. 24, No. 3, pp. 217-222, Sep. 1995
5. J. Aspnes, K. Chang, A. Yampolskiy, "Inoculation Strategies for Victims of Viruses and Sum-of-squares Partition Problem", Journal of Computer and System Sciences, Vol. 72, pp. 1077-1093, 2006.
6. A. Ganesh, Private communication.
7. A. Ganesh, L. Massoulié and D. Towsley, "The Effect of Network Topology on the Spread of Epidemics", IEEE INFOCOM, 2005.
8. M. Garetto, W. Gong, D. Towsley, "Modeling Malware Spreading Dynamics", IEEE INFOCOM'03, San Francisco, CA, Apr. 2003.
9. G. S. Canright and K. Engo-Monsen, "Spreading on Networks: A Topographic View", Complexus, 2006.
10. C. Asavathiratham, "The Influence Model: A Tractable Representation for the Dynamics of Networked Markov Chains", Ph.D. thesis, Massachusetts Institute of Technology, Oct. 2000.
11. Albert, R. and H. Jeong and A.-L. Barabsi, "Error and Attack Tolerance of complex networks", Nature Vol. 406, pp. 378-382, 27 Jul. 2000.
12. J. O. Kephart and S. R. White, "Direct-Graph Epidemiological Models of Computer Viruses", Proceedings of the 1991 IEEE Computer Society Symposium on Research in Security and Privacy, pp. 343-359, May 1991.
13. R. Pastor-Satorras and A. Vespignani, "Epidemic Spreading in Scale-Free Networks", Physical Review Letters, Vol. 86, No. 14, 3200-3203.
14. Y. Wang, D. Chakrabarti, C. Wang, and C. Faloutsos, "Epidemic Spreading in Real Networks: An Eigenvalue Viewpoint", In 22nd International Symposium on Reliable Distributed Systems (SRDS '03), IEEE Computer, pp. 25-34. Oct. 2003.
15. H. Kunreuther and G. Heal, "Interdependent security", Journal of Risk and Uncertainty (Special Issue on Terrorist Risks), 2003.
16. M. Kearns and L. Ortiz. "Algorithms for Interdependent Security Games", Advances in Neural Information Processing Systems, 16. MIT Press, Cambridge, MA, 2004.
17. R. B. Myerson, "Game Theory: Analysis of Conflict", Harvard University Press, Cambridge, MA, 1991.
18. E. Altman, "Flow Control Using the Theory of Zero Sum Markov Games," Decision and Control, 1992., Proceedings of the 31st IEEE Conference on, pp. 1632-1637 vol. 2, 1992.
19. Y A. Korilis and A. A. Lazar, "On the Existence of Equilibria in Noncooperative Optimal Flow Control," Journal of the ACM, vol. 42, no. 3, pp. 584-613, 1995.
20. E. Altman, T. Basar, T. Jiménez, and N. Shimkin, "Competitive Routing in Networks with Polynomial Cost," in INFOCOM, 2000, pp. 1586-1593.
21. A. A. Lazar, A. Orda, and D. E. Pendarakis, "Virtual Path Bandwidth Allocation in Multiuser Networks," IEEE/ACM Trans. Netw., vol. 5, no. 6, pp. 861-871, 1997.
22. E. Koutsoupias and C. H. Papadimitriou, "Worst-Case Equilibria," Lecture Notes in Computer Science, no. 1563, pp. 404-413, 1999.
23. T. Roughgarden, "Designing Networks for Selfish Users is Hard," in FOCS '01: Proceedings of the 42nd IEEE symposium on Foundations of Computer Science. Washington, DC, USA: IEEE Computer Society, 2001, p. 472.
24. T. Roughgarden and E. Tardos, "How Bad is Selfish Routing?" J. ACM, vol. 49, no. 2, pp. 236-259, 2002.
25. C. Papadimitriou, "Algorithms, Games, and the Internet", in STOC '01: Proceedings of the thirty-third annual ACM symposium on Theory of computing. New York, NY, USA: ACM, 2001, pp. 749-753.
26. A. Orda, R. Rom and N. Shimkin, "Competitive Routing in Multiuser Communication Networks", IEEE/ACM Transactions on Networking, vol. 1, no. 5, pp. 510-521, 1993.
27. G. Debreu, "A Social Equilibrium Existence Theorem," Proceedings of the National Academy of Science, vol. 38, pp. 886-893, Oct. 1952.
28. D. J. Daley and J. Gani, "Epidemic Modelling: An Introduction," Cambridge University Press, 1999.
29. L. Jiang, V. Anantharam and J. C. Walrand, "Efficiency of Selfish Investments in Network Security," NetEcon 2008, pp. 31-36, Aug. 2008.
30. M. Lelarge and J. Bolot, "Network Externalities and the Deployment of Security Features and Protocols in the Internet," SIGMETRICS 2008, pp. 37-48, Jun. 2008.
31. M. Lelarge and J. Bolot, "A Local Mean Field Analysis of Security Investments in Networks," CoRR abs/0803.3455, 2008