On new approaches of assessing network vulnerability: Hardness and approximation

IEEE/ACM Transactions on Networking

Volumn 20, Issue 2, 2012, Pages 609-619

  Dinh, Thang N ^a   Xuan, Ying ^a   Thai, My T ^a   Pardalos, Panos M ^b   Znati, Taieb ^c  

^a University of Florida   (United States)

^b UNIVERSITY OF FLORIDA   (United States)

^c University of Pittsburgh   (United States)

Author keywords

Approximation algorithm; hardness; network vulnerability; pairwise connectivity

Indexed keywords

CRITICAL EDGES; CRITICAL NODE; DISRUPTIVE EVENT; HEURISTIC SOLUTIONS; INAPPROXIMABILITY; INHOMOGENEOUS PROPERTY; LARGE-SCALE NETWORK; NETWORK ELEMENT; NETWORK VULNERABILITY; NP-COMPLETENESS; OPTIMIZATION PROBLEMS; PAIRWISE CONNECTIVITY; PERFORMANCE GUARANTEES; SIMULATION-BASED; UNDERLYING GRAPHS; VULNERABILITY ASSESSMENTS;

APPROXIMATION ALGORITHMS; ELECTRIC NETWORK TOPOLOGY; GRAPH THEORY; HARDNESS; RISK MANAGEMENT; UNCERTAINTY ANALYSIS;

NETWORK SECURITY;

EID: 84859973015     PISSN: 10636692     EISSN: None     Source Type: Journal    
DOI: 10.1109/TNET.2011.2170849     Document Type: Article

References (26)

1. T. H. Grubesic, T. C. Matisziw, A. T.Murray, and D. Snediker, "Comparative approaches for assessing network vulnerability," Int. Regional Sci. Rev., vol. 31, no. 1, pp. 88-192, 2008.
2. R. Church, M. Scaparra, and R. Middleton, "Identifying critical infrastructure: The median and covering facility interdiction problems," Ann. Assoc. Amer. Geogr., vol. 94, no. 3, pp. 491-502, 2004. (Pubitemid 41716604)
3. A. Murray, T. Matisziw, and T. Grubesic, "Multimethodological approaches to network vulnerability analysis," Growth Change, vol. 39, no. 4, pp. 573-592, 2008.
4. A. Sen, S. Murthy, and S. Banerjee, "Region-based connectivity-A new paradigm for design of fault-tolerant networks," in Proc. HPSR, 2009, pp. 1-7.
5. S. Neumayer, G. Zussman, R. Cohen, and E. Modiano, "Assessing the vulnerability of the fiber infrastructure to disasters," in Proc. IEEE INFOCOM, 2009, pp. 1566-1574.
6. C. J. Colbourn, The Combinatorics of Network Reliability. New York: Oxford Univ. Press, 1987.
7. S. P. Borgatti and M. G. Everett, "A graph-theoretic perspective on centrality," Social Netw., vol. 28, no. 4, pp. 466-484, 2006. (Pubitemid 44089303)
8. D. Goyal and J. Caffery, "Partitioning avoidance in mobile ad hoc networks using network survivability concepts," in Proc. ISCC, 2002, p. 553.
9. M. Hauspie, J. Carle, and D. Simplot, "Partition detection in mobile ad hoc networks using multiple disjoint paths set," in Proc. Workshop Objects, Models Multimedia Technol., 2003, p. 15.
10. 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," in Proc. 3rd IFIP MED-HOC-NET Workshop, 2004, pp. 360-371.
11. A. Barabasi, R. Albert, and H. Jeong, "Scale-free characteristics of random networks: The topology of the World-Wide Web," Physica A, vol. 281, pp. 69-77, 2000.
12. Y. J. Suh, D. J. Kim, W. S. Lim, and J. Y. Baek, "Method for supporting quality of service in heterogeneous networks," 2009.
13. T. Lehman, J. Sobieski, and B. Jabbari, "DRAGON: A framework for service provisioning in heterogeneous grid networks," IEEE Commun. Mag., vol. 44, no. 3, pp. 84-90, Mar. 2006.
14. V. Mhatre and C. Rosenberg, "Homogeneous vs heterogeneous clustered sensor networks: A comparative study," in Proc. IEEE ICC, 2004, vol. 6, pp. 3646-3651.
15. F. Sun and M. A. Shayman, "On pairwise connectivity of wireless multihop networks," Int. J. Security Netw., vol. 2, no. 1/2, pp. 37-49, 2007.
16. A. Arulselvan, C. W. Commander, L. Elefteriadou, and P. M. Pardalos, "Detecting critical nodes in sparse graphs," Comput. Oper. Res., vol. 36, no. 7, pp. 2193-2200, 2009.
17. S. P. Borgatti, "Identifying sets of key players in a social network," Comput. Math. Org. Theory, vol. 12, no. 1, pp. 21-34, 2006. (Pubitemid 43676236)
18. M. Stoer and F. Wagner, "A simple min-cut algorithm," J. ACM, vol. 44, no. 4, pp. 585-591, 1997. (Pubitemid 127617705)
19. D. Wagner and F. Wagner, "Between min cut and graph bisection," in Proc. MFCS, London, UK, 1993, pp. 744-750.
20. M. R. Garey and D. S. Johnson, Computers and Intractability; A Guide to the Theory of NP-Completeness. New York: Freeman, 1990.
21. I. Dinur and S. Safra, "On the hardness of approximating minimum vertex cover," Ann. Math., vol. 162, p. 2005, 2004.
22. 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 Proc. ACM STOC, New York, 2005, pp. 573-581. (Pubitemid 43098630)
23. G. Even, J. S. Naor, S. Rao, and B. Schieber, "Divide-and-conquer approximation algorithms via spreading metrics," J. ACM, vol. 47, no. 4, pp. 585-616, 2000.
24. R. Albert, H. Jeong, and A. Barabasi, "Error and attack tolerance of complex networks," Nature, vol. 406, no. 6794, pp. 378-382, Jul. 2000. (Pubitemid 30625551)
25. D. J. Watts and S. H. Strogatz, "Collective dynamics of 'small-world' networks," Nature, vol. 393, no. 6684, pp. 440-442, Jun. 1998. (Pubitemid 28292183)
26. L. Page, S. Brin, R. Motwani, and T.Winograd, "The Pagerank citation ranking: Bringing order to the Web," Stanford InfoLab, Stanford, CA, Tech. rep., 1999.