Skip to main content

How Robust is the Internet? – Insights from Graph Analysis

  • Conference paper
  • First Online:
Book cover Risks and Security of Internet and Systems (CRiSIS 2014)

Part of the book series: Lecture Notes in Computer Science ((LNISA,volume 8924))

Included in the following conference series:

Abstract

The importance of the Internet as todays communication and information medium cannot be underestimated. Reduced Internet reliability can lead to significant financial losses for businesses and economies. But how robust is the Internet with respect to failures, accidents, and malicious attacks? We will investigate this question from the perspective of graph analysis. First, we develop a graph model of the Internet at the level of Autonomous Systems based on empirical data. Then, a global assessment of Internet robustness is conducted with respect to several failure and attack modes. Our results indicate that even today the Internet could be very vulnerable to smart attack strategies.

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

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

References

  1. CDW: Billions Lost due to IT Network Outages in 2010 (2011). http://www.eweek.com/c/a/Enterprise-Networking/Billions-Lost-Due-to-IT-Network-Outages-in-2010-Survey-559569/

  2. Cerf, V.: Natural disasters and electric infrastructure. IEEE Internet Comput. 15(6), 103–104 (2011)

    Article  MathSciNet  Google Scholar 

  3. Agapi, A., Birman, K., Broberg, R., Cotton, C., Kielmann, T., Millnert, M., Payne, R., Surton, R., van Renesse, R.: Routers for the cloud: can the Internet achieve 5-nines availability? IEEE Internet Comput. 15(5), 72–77 (2011)

    Article  Google Scholar 

  4. Wu, J., Zhang, Y., Morley Mao, Z., Shin, K.: Internet routing resilience to failures: analysis and implications. In: Proceedings of the 2007 ACM CoNEXT Conference, New York, NY, USA (2007)

    Google Scholar 

  5. Sterbenz, J., Hutchison, D., Cetinkaya, E., Jabbar, A., Rohrer, J., Schöller, M., Smith, P.: Resilience and survivability in communication networks: strategies, principles, and survey of disciplines. Comput. Netw. 54(8), 1245–1265 (2010)

    Article  MATH  Google Scholar 

  6. Erdös, P., Renyi, A.: On random graphs I. Publicationes Mathematicae (Debrecen) 6, 290–297 (1959)

    MATH  MathSciNet  Google Scholar 

  7. Newman, M.: The structure and function of complex networks. SIAM Rev. 45(2), 167–256 (2003)

    Article  MATH  MathSciNet  Google Scholar 

  8. Barabasi, A., Albert, R.: Emergence of scaling in random networks. Science 286(5439), 509–512 (1999)

    Article  MathSciNet  Google Scholar 

  9. Dolev, D., Jamin, S., Mokryn, O., Shavitt, Y.: Internet resiliency to attacks and failures under BGP policy routing. Comput. Netw. 50(16), 3183–3196 (2006)

    Article  MATH  Google Scholar 

  10. Xiao, S., Xiao, G., Cheng, T.: Tolerance of intentional attacks in complex communication networks. IEEE Commun. Mag. 46(1), 146–152 (2008)

    Article  Google Scholar 

  11. Schneider, C., Moreira, A., Andrade Jr., J., Havlin, S., Herrmann, H.: Mitigation of malicious attacks on networks. PNAS 108(10), 3838–3841 (2011)

    Article  Google Scholar 

  12. Smith, P., Hutchison, D., Sterbenz, J., Schöller, M., Fessi, A., Karaliopoulos, M., Lac, C., Plattner, B.: Network resilience: a systematic approach. IEEE Commun. Mag. 49(7), 88–97 (2011)

    Article  Google Scholar 

  13. Deng, W., Karaliopoulos, M., Mühlbauer, W., Zhu, P., Lu, X., Plattner, B.: k-fault tolerance of the Internet AS graph. Comput. Netw. 55(10), 2492–2503 (2011)

    Article  Google Scholar 

  14. Route Views (2014). http://www.routeviews.org/

  15. RIPE RIS (2014). http://www.ripe.net/data-tools/stats/ris/

  16. UCLA: Internet Topology Collection (2014). http://irl.cs.ucla.edu/topology/

  17. CAIDA Ark (2014). http://www.caida.org/projects/ark/

  18. Internet Routing Registry (2014). http://www.irr.net/

  19. NetworkX (2014). http://networkx.github.io/

  20. Newman, M.: Random graphs as models of networks. In: Bornholdt, S., Schuster, H.G. (eds.) Handbook of Graphs and Networks, pp. 35–68. Wiley-VCH, Berlin (2003)

    Google Scholar 

  21. Mahadevan, P., Krioukov, D., Fomenkov, M., Huffaker, B., Dimitropoulos, X., claffy, k., Vahdat, A.: The Internet AS-level topology: three data sources and one definitive metric. ACM SIGCOMM Comput. Commun. Rev. 30, 17–26 (2006)

    Google Scholar 

  22. Watts, D., Strogatz, S.: Collective dynamics of ‘Small-World’ networks. Nature 392, 440–442 (1998)

    Article  Google Scholar 

  23. Magoni, D.: Tearing down the Internet. IEEE J. Sel. Areas Commun. 21(6), 949–960 (2003)

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Benjamin Fabian .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2015 Springer International Publishing Switzerland

About this paper

Cite this paper

Baumann, A., Fabian, B. (2015). How Robust is the Internet? – Insights from Graph Analysis. In: Lopez, J., Ray, I., Crispo, B. (eds) Risks and Security of Internet and Systems. CRiSIS 2014. Lecture Notes in Computer Science(), vol 8924. Springer, Cham. https://doi.org/10.1007/978-3-319-17127-2_18

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-17127-2_18

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-17126-5

  • Online ISBN: 978-3-319-17127-2

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics