On approximation of new optimization methods for assessing network vulnerability

Proceedings - IEEE INFOCOM

Volumn , Issue , 2010, Pages

  Dinh, Thang N ^a   Xuan, Ying ^a   Thai, My T ^a   Park, E K ^b   Znati, Taieb ^c  

^a UNIVERSITY OF FLORIDA   (United States)

^b UNIVERSITY OF MISSOURI KANSAS CITY   (United States)

^c UNIVERSITY OF PITTSBURGH   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

CRITICAL EDGES; CRITICAL NODE; DISRUPTIVE EVENT; EXTENSIVE SIMULATIONS; GENERAL NETWORKS; HEURISTIC SOLUTIONS; INAPPROXIMABILITY; INHOMOGENEOUS PROPERTY; LARGE-SCALE NETWORK; MALICIOUS ATTACK; NATURAL DISASTERS; NETWORK CONNECTIVITY; NETWORK PLANNING; NETWORK VULNERABILITY; NODE DEGREE; NP-COMPLETENESS; OPTIMIZATION METHOD; OPTIMIZATION PROBLEMS; PERFORMANCE GUARANTEES; VULNERABILITY ASSESSMENTS;

APPROXIMATION ALGORITHMS; COMPUTER SIMULATION; DISASTERS; ELECTRIC NETWORK TOPOLOGY; GRAPH THEORY; HEURISTIC ALGORITHMS; OPTIMIZATION; PLANNING; RISK MANAGEMENT; UNCERTAINTY ANALYSIS;

NETWORK SECURITY;

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

References (23)

1. Tony H. Grubesic, Timothy C. Matisziw, Alan T. Murray, and Diane Snediker. Comparative approaches for assessing network vulnerability. International Regional Science Review, 31(1):88-112, January 2008.
2. R. Church, M. Scaparra, and R. Middleton. Identifying critical infrastructure: the median and covering facility interdiction problems. Ann Assoc Am Geogr, 94(3):491-502, 2004.
3. A. Murray, T. Matisziw, and T. Grubesic. Multimethodological approaches to network vulnerability analysis. Growth Change, 2008.
4. Stephen P. Borgatti and Martin G. Everett. A graph-theoretic perspective on centrality. Social Networks, 28(4):466-484, October 2006.
5. D. Goyal and J. Caffery. Partitioning avoidance in mobile ad hoc networks using network survivability concepts. 7th IEEE Symp. on Compu. and Comm. 2002.
6. M. Hauspie, J. Carle, and D. Simplot. Partition detection in mobile ad hoc networks using multiple disjoint paths set. Workshop. Objects, Models & Multi. tech. 2003.
7. M. Jorgic, I. Stojmenovic, M. Hauspie, and D. Simplot-Ryl. Localized algorithms for detection of critical nodes and links for connectivity in ad hoc networks. 3rd IFIP MED-HOC-NET Workshop, 2004.
8. A. Barabasi, R. Albert, and H. Jeong. Scale-free characteristics of random networks: the topology of the world-wide web. Physica A: Statistical Mechanics and its Applications, 281, 2000.
9. Y. J. Suh, D. J. Kim, W. S. Lim, and J. Y. Baek. Method for supporting quality of service in heterogeneous networks. 2009.
10. T. Lehman, J. Sobieski, and B. Jabbari. Dragon: a framework for service provisioning in heterogeneous grid networks. IEEE Comm. Magazines, 2006.
11. V. Mhatre and C. Rosenberg. Homogeneous vs heterogeneous clustered sensor networks: a comparative study. IEEE Inter. Conf. on Commu., 2004.
12. M. Stoer and F. Wagner. A simple min-cut algorithm. J. ACM, 1997.
13. D. Wagner and F. Wagner. Between min cut and graph bisection. In MFCS '93: Proceedings of the 18th International Symposium on Mathematical Foundations of Computer Science, pages 744-750, London, UK, 1993. Springer-Verlag.
14. I. Dinur and S. Safra. On the hardness of approximating minimum vertex cover. Annals of Mathematics, 162:2005, 2004.
15. A. Agarwal, M. Charikar, K. Makarychev, and Y. Makarychev. O(log n) approximation algorithms for min uncut, min 2cnf deletion, and directed cut problems. In STOC '05: Proceedings of the thirty-seventh annual ACM symposium on Theory of computing, pages 573-581, New York, NY, USA, 2005.
16. G. Even, J. S. Naor, S. Rao, and B. Schieber. Divide-and-conquer approximation algorithms via spreading metrics. Journal of ACM, 47(4):585-616, 2000.
17. S. Arora, S. Rao, and U. Vazirani. Expander flows, geometric embeddings and graph partitioning. In STOC '04: Proceedings of the thirty-sixth annual ACM symposium on Theory of computing, pages 222-231, New York, NY, USA, 2004.
18. G. Even, J. S. Naor, S. Rao, and B. Schieber. Fast approximate graph partitioning algorithms. In SIAM Journal on Computing, pages 639-648, 1999.
19. A. Coja-Oghlan, A. Goerdt, A. Lanka, and F. Schädlich. Techniques from combinatorial approximation algorithms yield efficient algorithms for random 2ksat. Theor. Comput. Sci., 329(1-3):1-45, 2004.
20. A. Arulselvan, C. W. Commander, L. Elefteriadou, and P. M. Pardalos. Detecting critical nodes in sparse graphs. Comput. Oper. Res., 36(7):2193-2200, 2009.
21. S. P. Borgatti. Identifying sets of key players in a social network. Comput. Math. Organiz. Theor., 12:21-34, 2006
22. F. Sun and M. A. Shayman On pairwise connectivity of wireless multihop networks Inter. J. Security and Networks, 2(2) 37-49, 2007
23. T. N. Dinh, Y. Xuan, M. T. Thai, E. K. Park and T. Znati On New Approaches of Assessing Network Vulnerability: Hardness and Approximation. Manuscript, 2009.