Skip to main content

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 6216))

Included in the following conference series:

Abstract

Many real-world systems can be represented by a network, in which nodes denote the objects and edges imply the relations between them, such as Internet and wireless sensor networks. The robustness of these systems can be investigated through studying the attack vulnerability of corresponding network topologies. In this work, we propose a new set of network attack strategies — bottleneck-based attacks. We compare these attacks with classical hub and betweenness attacks on general scale-free networks, modular scale-free networks and real Internet traffic networks. Simulation results indicate that hub-bottlenecks, rather than hub-nonbottlenecks, are most important in all networks, and bottleneck nodes represent the fragility of modular scale-free networks. Our study provides meaningful insights into protection of real systems.

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 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.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

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Albert, R., Barabási, A.L.: Statistical Mechanics of Complex Networks. Rev. Mod. Phys. 74, 47–97 (2002)

    Article  Google Scholar 

  2. Erdös, P., Rényi, A.: On the Evolution of Random Graphs. Publ. Math. Inst. Hung. Acad.Sci. 5, 17–61 (1960)

    MATH  Google Scholar 

  3. Barabási, A.L., Albert, R.: Emergence of Scaling in Random Networks. Science 286, 509–512 (2002)

    Google Scholar 

  4. Watts, D.J., Strogatz, S.H.: Collective Dynamics of ’Small-world’ Networks. Nature 393, 440–442 (1998)

    Article  Google Scholar 

  5. Girvan, M., Newman, M.E.J.: Community Structure in Social and Biological Networks. Proc. Natl. Acad. Sci. USA 99, 7821–7826 (2002)

    Article  MATH  MathSciNet  Google Scholar 

  6. Fortunato, S.: Community Detection in Graphs. Physics Reports 486, 75–174 (2010)

    Article  MathSciNet  Google Scholar 

  7. Albert, R., Jeong, H., Barabási, A.L.: Error and Attack Tolerance of Complex Networks. Nautre 406, 378–482 (2000)

    Google Scholar 

  8. Holme, P., Kim, B.J., Yoon, C.N., Han, S.K.: Attack Vulnerability of Complex Networks. Phys Rev E 65, 56109 (2002)

    Article  Google Scholar 

  9. Georgiadis, G., Kirousis, L.: Lightweight Centrality Measures in Networks under Attack. Complexus 3, 147–157 (2006)

    Article  Google Scholar 

  10. Motter, A.E., Lai, Y.C.: Cascade-based Attacks on Complex Networks. Phys. Rev. E 66, 065102 (2002)

    Article  Google Scholar 

  11. Wang, W.X., Lai, Y.C.: Abnormal Cascading on Complex Networks. Phys Rev E 80, 036109 (2009)

    Article  Google Scholar 

  12. Lancichinetti, A., Fortunato, S., Radicchi, F.: Benchmark Graphs for Testing Community Detection Algorithms. Physical Review E 78, 046110 (2008)

    Article  Google Scholar 

  13. Yu, H., Kim, P.M., Sprecher, E., Trifonov, V., Gerstein, M.: The Importance of Bottlenecks in Protein Networks: Correlation with Gene Essentiality and Expression Dynamics. PLoS Computational Biology 3, e59 (2007)

    Article  MathSciNet  Google Scholar 

  14. Barthelemy, M.: Betweenness Centrality in Large Complex Networks. The European physical journal B 38, 163–168 (2004)

    Article  Google Scholar 

  15. Latora, V., Marchiori, M.: A Measure of Centrality based on Network Efficiency. New Journal of Physics 9, 188 (2007)

    Article  Google Scholar 

  16. Holme, P., Karlin, J., Forrest, S.: An Integrated Model of Traffic, Geography and Economy in the Internet. ACM SIGCOMM. Computer Communication Review 38, 7–15 (2008)

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2010 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Huang, Y., Wang, G., Tang, Y. (2010). Bottleneck Attack Strategies on Complex Communication Networks. In: Huang, DS., Zhang, X., Reyes García, C.A., Zhang, L. (eds) Advanced Intelligent Computing Theories and Applications. With Aspects of Artificial Intelligence. ICIC 2010. Lecture Notes in Computer Science(), vol 6216. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-14932-0_52

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-14932-0_52

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-14931-3

  • Online ISBN: 978-3-642-14932-0

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics