Network vulnerability to single, multiple, and probabilistic physical attacks

Proceedings - IEEE Military Communications Conference MILCOM

Volumn , Issue , 2010, Pages 1824-1829

  Agarwal, Pankaj K ^a   Efrat, Alon ^b   Ganjugunte, Shashidhara K ^a   Hay, David ^c   Sankararaman, Swaminathan ^b   Zussman, Gil ^c  

^a Duke University   (United States)

^b UNIVERSITY OF ARIZONA   (United States)

^c Och Spine at New York Presbyterian Hospitals   (United States)

Author keywords

Computational geometry; Electromagnetic Pulse (EMP); Geographic networks; Network design; Network survivability

Indexed keywords

EFFICIENT ALGORITHM; GEOGRAPHIC NETWORKS; INTERDEPENDENT SYSTEMS; NATURAL DISASTERS; NETWORK DESIGN; NETWORK ELEMENT; NETWORK EQUIPMENT; NETWORK SURVIVABILITY; NETWORK VULNERABILITY; PHYSICAL ATTACKS; PROBABILISTIC MODELS;

APPROXIMATION ALGORITHMS; COMPUTATIONAL ELECTROMAGNETICS; COMPUTATIONAL GEOMETRY; DISASTERS; ELECTROMAGNETIC PULSE; ELECTRONIC WARFARE; HIGH ENERGY PHYSICS; MILITARY COMMUNICATIONS; NUCLEAR EXPLOSIONS; OUTAGES; TELECOMMUNICATION NETWORKS;

NETWORK SECURITY;

EID: 79951617247     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/MILCOM.2010.5679556     Document Type: Conference Paper

References (30)

1. J. Borland, "Analyzing the Internet collapse," MIT Technology Review, Feb. 2008. [Online]. Available: http://www.technologyreview.com/ Infotech/20152/?a=f
2. J. S. Foster, E. Gjelde, W. R. Graham, R. J. Hermann, H. M. Kluepfel, R. L. Lawson, G. K. Soper, L. L. Wood, and J. B. Woodard, "Report of the commission to assess the threat to the United States from electromagnetic pulse (EMP) attack, critical national infrastructures," Apr. 2008.
3. C. Wilson, "High altitude electromagnetic pulse (HEMP) and high power microwave (HPM) devices: Threat assessments," CRS Report for Congress, July 2008. [Online]. Available: http://www.ntia.doc.gov/ broadbandgrants/comments/7926.pdf
4. W. R. Forstchen, One Second After. Tom Doherty Associates, LLC, 2009.
5. Level 3 Communications, Network Map. [Online]. Available: http://www.level3.com/interacts/map.html
6. S. Neumayer, G. Zussman, R. Cohen, and E. Modiano, "Assessing the impact of geographically correlated network failures," in Proc. IEEE MILCOM, Nov. 2008.
7. -, "Assessing the vulnerability of the fiber infrastructure to disasters," in Proc. IEEE INFOCOM, Apr. 2009.
8. S. Neumayer and E. Modiano, "Network reliability with geographically correlated failures," in Proc. IEEE INFOCOM, Mar. 2010.
9. D. Hochbaum and A. Pathria, "Analysis of the greedy approach in problems of maximum k-coverage," Naval Research Logistics (NRL), vol. 45, no. 6, pp. 615-627, 1998.
10. R. Bhandari, Survivable networks: algorithms for diverse routing. Kluwer, 1999.
11. C. Ou and B. Mukherjee, Survivable Optical WDM Networks. Springer- Verlag, 2005.
12. O. Crochat, J.-Y. Le Boudec, and O. Gerstel, "Protection interoperability for WDM optical networks," IEEE/ACM Trans. Netw., vol. 8, no. 3, pp. 384-395, 2000.
13. A. Narula-Tam, E. Modiano, and A. Brzezinski, "Physical topology design for survivable routing of logical rings in WDM-based networks," IEEE J. Sel. Areas Commun., vol. 22, no. 8, pp. 1525-1538, Oct. 2004.
14. IETF Internet Working Group , "Inference of Shared Risk Link Groups," November 2001, Internet Draft. [Online]. Available: http://tools.ietf.org/html/draft-many-inference-srlg-02
15. D. Bienstock, "Some generalized max-flow min-cut problems in the plane," Math. Oper. Res., vol. 16, no. 2, pp. 310-333, 1991.
16. A. F. Hansen, A. Kvalbein, T. Cicic, and S. Gjessing, "Resilient routing layers for network disaster planning," in Proc. ICN. Springer-Verlag, Apr. 2005.
17. M. M. Hayat, J. E. Pezoa, D. Dietz, and S. Dhakal, "Dynamic load balancing for robust distributed computing in the presence of topological impairments," Wiley Handbook of Science and Technology for Homeland Security, 2009.
18. K. Atkins, J. Chen, V. S. A. Kumar, and A. Marathe, "The structure of electrical networks: a graph theory-based analysis," Int. J. Critical Infrastructures, vol. 5, no. 3, pp. 265-284, 2009.
19. C. A. Phillips, "The network inhibition problem," in Proc. ACM STOC, 1993.
20. C. Burch, R. Carr, S. Krumke, M. Marathe, C. Phillips, and E. Sundberg, "A decomposition-based pseudoapproximation algorithm for network flow inhibition," in Network Interdiction and Stochastic Integer Programming. Springer, 2003, ch. 3, pp. 51-68.
21. A. Schrijver, "On the history of combinatorial optimization (till 1960)," in Handbook of Discrete Optimization. Elsevier, 2005, pp. 1-68.
22. A. Pinar, Y. Fogel, and B. Lesieutre, "The inhibiting bisection problem," in Proc. ACM SPAA, June 2007.
23. R. L. Church, M. P. Scaparra, and R. S. Middleton, "Identifying critical infrastructure: the median and covering facility interdiction problems," Ann. Assoc. Amer. Geographers, vol. 94, no. 3, pp. 491-502, 2004.
24. R. Cohen, K. Erez, D. Ben-Avraham, and S. Havlin, "Breakdown of the Internet under intentional attack," Phys. Rev. Lett., vol. 86, no. 16, pp. 3682-3685, Apr. 2001.
25. D. Magoni, "Tearing down the Internet," IEEE J. Sel. Areas Commun., vol. 21, no. 6, pp. 949-960, Aug. 2003.
26. A. L. Barabasi and R. Albert, "Emergence of scaling in random networks," Science, vol. 286, no. 5439, pp. 509-512, October 1999.
27. M. Sharir and P. Agarwal, Davenport-Schinzel Sequences and their Geometric Applications. Cambridge University Press, 1995.
28. R. E. Tarjan, Data structures and network algorithms. Society for Industrial and Applied Mathematics, 1983.
29. P. K. Agarwal, D. Z. Chen, S. K. Ganjugunte, E. Misiołek, M. Sharir, and K. Tang, "Stabbing convex polygons with a segment or a polygon," in Proc. ESA, Sept. 2008.
30. B. Aronov and S. Har-Peled, "On approximating the depth and related problems," in Proc. ACM-SIAM SODA, Jan. 2005.