Skip to main content

Vulnerability Evaluation of Networks to Multiple Failures Based on Critical Nodes and Links

  • Chapter
  • First Online:
Guide to Disaster-Resilient Communication Networks

Part of the book series: Computer Communications and Networks ((CCN))

Abstract

In this chapter, we consider the vulnerability evaluation of a given network, composed by a set of nodes and a set of links, based on the connectivity still provided by the network if its critical elements fail simultaneously. This evaluation requires to solve the optimization problem of identifying the set of network elements (either nodes or links) that are the most critical in the sense that if they are removed from the network, the resulting connectivity is minimized. The chapter describes both exact methods based on integer linear programming and centrality-based heuristics. Although exact methods are preferable since they can provide optimal solutions, they do not scale for very large problem instances since the optimization problem is of combinatorial nature. In such cases, heuristics are alternative methods able to provide solutions that might be non-optimal. The chapter addresses separately the cases aiming to identify the set of critical nodes and the set of critical links. Computational results are provided enabling the comparison between exact methods and centrality-based heuristics in terms of solution optimality.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Similar content being viewed by others

Notes

  1. 1.

    In a compact model, its number of variables and constraints are upper bounded by polynomials of the number of network nodes and links.

  2. 2.

    In a non-compact model, its number of variables and/or constraints grow exponentially with the number of network nodes and links.

  3. 3.

    Examples of available commercial solvers are IBM CPLEX (www.ibm.com/products/ilog-cplex-optimization-studio), FICO Xpress (www.fico.com/en/products/fico-xpress-solver) and Gurobi (www.gurobi.com).

  4. 4.

    The interested reader can check in http://sndlib.zib.de the node names of Germany50 and in http://monarchna.com/topology.html the node names of CORONET CONUS.

References

  1. Addis B, Aringhieri R, Grosso A, Hosteins P (2016) Hybrid constructive heuristics for the critical node problem. Ann Oper Res 238(1–2):637–649

    Article  MathSciNet  Google Scholar 

  2. Arulselvan A, Commander CW, Elefteriadou L, Pardalos PM (2009) Detecting critical nodes in sparse graphs. Comput Oper Res 36:2193–2200

    Article  MathSciNet  Google Scholar 

  3. Barbosa F, de Sousa A, Agra A (2018) Topology design of transparent optical networks resilient to multiple node failures. In: 10th International Workshop on Resilient Networks Design and Modeling (RNDM), Longyearbyen, Norway, pp 1–8

    Google Scholar 

  4. Di Summa M, Grosso A, Locatelli M (2012) Branch and cut algorithms for detecting critical nodes in undirected graphs. Comput Optim Appl 53(3):649–680

    Article  MathSciNet  Google Scholar 

  5. Dinh TN, Thai MT (2015) Network under joint node and link attacks: vulnerability assessment methods and analysis. IEEE/ACM Trans Netw 23(3):1001–1011

    Article  Google Scholar 

  6. Dinh TN, Xuan Y, Thai MT, Pardalos PM, Znati T (2012) On new approaches of assessing network vulnerability: hardness and approximation. IEEE/ACM Trans Netw 20(2):609–619

    Article  Google Scholar 

  7. Iyer S, Killingback T, Sundaram B, Wang Z (2013) Attack robustness and centrality of complex networks. PLoS ONE 8(4):1–17

    Article  Google Scholar 

  8. Lalou M, Tahraouic MA, Kheddouci H (2018) The critical node detection problem in networks: a survey. Comput Sci Rev 28:92–117

    Article  MathSciNet  Google Scholar 

  9. Nandi AK, Medal HR (2016) Methods for removing links in a network to minimize the spread of infections. Comput Oper Res 69:10–24

    Article  MathSciNet  Google Scholar 

  10. Natalino C, de Sousa A, Wosinska L, Furdek M (2018) On the trade-offs between user-to-replica distance and CDN robustness to link cut attacks. In: 10th International Workshop on Resilient Networks Design and Modeling (RNDM), Longyearbyen, Norway, pp 1–7

    Google Scholar 

  11. Orlowski S, Wessäly R, Pióro M, Tomaszewski A (2010) SNDlib 1.0–survivable network design library. Networks 55(3):276–286

    Google Scholar 

  12. Paudel N, Georgiadis L, Italiano GF (2018) Computing critical nodes in directed graphs. J Exp Algorithmics 23(2), Article 2.2

    Google Scholar 

  13. Rochat Y (2009) Closeness centrality extended to unconnected graphs: the harmonic centrality index. Applications of Social Network Analysis. http://infoscience.epfl.ch/record/200525

  14. Rueda D, Calle E, Marzo JL (2017) Robustness comparison of 15 real telecommunication networks: structural and centrality measurements. J Netw Syst Manage 25(2):269–289

    Article  Google Scholar 

  15. Santos D, de Sousa A, Monteiro P (2018) Compact models for critical node detection in telecommunication networks. Electron Notes Discrete Math 64:325–334

    Article  MathSciNet  Google Scholar 

  16. Simmons J (2014) Optical network design and planning, 2nd edn. Springer, Cham

    Book  Google Scholar 

  17. Ventresca M (2012) Global search algorithms using a combinatorial unranking-based problem representation for the critical node detection problem. Comput Oper Res 39(11):2763–2775

    Article  MathSciNet  Google Scholar 

  18. Veremyev A, Boginski V, Pasiliao E (2014) Exact identification of critical nodes in sparse networks via new compact formulations. Optim Lett 8:1245–1259

    Article  MathSciNet  Google Scholar 

  19. Veremyev A, Prokopyev O, Pasiliao E (2015) Critical nodes for distance-based connectivity and related problems in graphs. Networks 66(3):170–195

    Article  MathSciNet  Google Scholar 

Download references

Acknowledgements

This chapter is based on work from COST Action CA15127 (“Resilient communication services protecting end-user applications from disaster-based failures—RECODIS”) supported by European Cooperation in Science and Technology (COST). This work was also supported by FCT, Portugal, through project ResNeD CENTRO-01-0145-FEDER-029312.

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Amaro de Sousa .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2020 Springer Nature Switzerland AG

About this chapter

Check for updates. Verify currency and authenticity via CrossMark

Cite this chapter

de Sousa, A., Santos, D. (2020). Vulnerability Evaluation of Networks to Multiple Failures Based on Critical Nodes and Links. In: Rak, J., Hutchison, D. (eds) Guide to Disaster-Resilient Communication Networks. Computer Communications and Networks. Springer, Cham. https://doi.org/10.1007/978-3-030-44685-7_3

Download citation

  • DOI: https://doi.org/10.1007/978-3-030-44685-7_3

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-030-44684-0

  • Online ISBN: 978-3-030-44685-7

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics