Skip to main content
Log in

On the Interplay of Network Structure and Routing Strategies on Network Design Methods for Mitigation of Intentional Attacks in Scale-Free Networks

  • Published:
Journal of Network and Systems Management Aims and scope Submit manuscript

Abstract

Network robustness and network reliability are important issues in the design of Internet Service Provider’s topologies. In this paper, we examine the structural characteristics of network topologies that affect robustness and reliability according to various routing strategies. We examine the interplay between the structural characteristics of network topologies and routing strategies on network robustness and reliability according to resource capacity over-provisioning strategies when the network breakdowns subject to practical constraints (router technology) and economic considerations (link costs). We study the robustness of the Internet connectivity under node intentional harmful attack using two attack strategies: static degree-based and static load-based. We find that the robustness of network topologies is affected by the variation of the interplay between their structural characteristics and the routing strategies. In our proposed approach, we show that highly-heterogeneous topologies have less robustness compared with lightly-heterogeneous topologies. The observations from the robustness study provide us useful insights for proposing multiple efficient preventive resource capacity over-provisioning strategies for mitigation of intentional attacks. The proposed strategies utilize the structural properties by calculating the excess traffic in case of single global cascading failure for each node and measure its influence on the other nodes as well as locally. The results show that our proposed strategies can significantly enhance the robustness and increase the resilience of network topology according to the specific used routing method. Due to our proposed approach results, we also show that highly-heterogeneous topologies have high resilience compared with lightly-heterogeneous topologies.

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

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Fig. 1
Fig. 2
Fig. 3
Fig. 4
Fig. 5
Fig. 6
Fig. 7
Fig. 8
Fig. 9
Fig. 10
Fig. 11
Fig. 12
Fig. 13
Fig. 14
Fig. 15
Fig. 16
Fig. 17
Fig. 18

Similar content being viewed by others

References

  1. Bornholdt, S., Schuster, H.G. (eds.): Handbook of Graphs and Networks: From the Genome to the Internet. Wiley-VCH, Weinheim (2003)

  2. Govindan, R., Tangmunarunkit, H.: Heuristics for internet map discovery. In: Proc. IEEE INFOCOM, pp. 1371–1380. Tel Aviv (2000)

  3. Chang, H., Govindan, R., Jamin, S., Shenker, S., Willinger, W.: Toward capturing representative AS-level internet topologies. In: Proc. ACM SIGMETRICS, pp. 280–281. Marina Del Rey, CA (2002)

  4. Albert, R., Jeong, H., Barabasi, A.-L.: Error and attack tolerance of complex networks. Nature 406, 378–382 (2000)

    Article  Google Scholar 

  5. Sayeed, S.D., Hasan, M.S., Rahman, M.S.: Measuring topological robustness of scale-free networks using biconnected components. In: IEEE International Conference on Networking Systems and Security (NSysS), pp. 1–6. Dhaka (2015)

  6. Zhao, L., Park, K., Lai, Y.-C.: Attack vulnerability of scale-free networks due to cascading breakdown. Phys. Rev. E70, 035101(R) (2004)

    Google Scholar 

  7. Zhao, Liang, Park, Kwangho, Lai, Ying-Cheng, Cupertino, Thiago Henrique: Attack induced cascading breakdown in complex networks. J. Braz. Comp. Soc. 13(3), 67–76 (2007)

    Article  Google Scholar 

  8. Nie, S., Wang, X., Zhang, H., Li, Q., Wang, B.: Robustness of controllability for networks based on edge-attack. PLoS ONE 9(2), e89066 (2014)

    Article  Google Scholar 

  9. Wang, Jianwei, Zhang, Chuan, Huang, Yi, Xin, Chong: Attack robustness of cascading model with node weight, Springer Science + Business Media Dordrecht. Nonlinear Dyn. 78(1), 37–48 (2014)

    Article  Google Scholar 

  10. Wong, K.Y., Wong, C.I., Lao, H.H.: Mitigation and recovery of cascading failures in scale-free networks. In: IET International Conference on Information and Communications Technologies (IETICT), pp. 253–257. Beijing (2013)

  11. Holme, P., Kim, B.J.: Vertex overload breakdown in evolving networks. Phys. Rev. Lett. E 65, 026139 (2002)

    Article  Google Scholar 

  12. Holme, P.: Edge overload breakdown in evolving networks. Phys. Rev. Lett. E 65, 066109 (2002)

    Article  Google Scholar 

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

    Article  Google Scholar 

  14. Kim, Hyoungshick, Anderson, Ross J.: An experimental evaluation of robustness of networks. IEEE Syst. J. 7(2), 179–188 (2013)

    Article  Google Scholar 

  15. Crucitti, P., Latora, V., Marchiori, M., Rapisarda, A.: Error and attack tolerance of complex networks. Physica A320, 622 (2003)

    Article  MATH  Google Scholar 

  16. Kasthurirathna, D., Piraveenan, M., Thedchanamoorthy, G.: Network robustness and topological characteristics in scale-free networks. In: IEEE Conference on Evolving and Adaptive Intelligent Systems (EAIS), pp. 122–129. Singapore (2013)

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

    Article  Google Scholar 

  18. Zhang, J., Modiano, E., Hay, D.: Enhancing network robustness via shielding. In: IEEE Conference on the design of reliable communications networks (DRCN), pp. 17–24. (2015)

  19. Chen, Z., Wang, X.: Effects of network capacity under variations of network structure and routing strategy. In: Proceedings of the IEEE International Conference on Networking, Sensing and Control (ICNSC ’06), Ft. Lauderdale, Florida, 2006

  20. Goh, K.I., Kahng, B., Kim, D.: Universal behavior of load distribution in scale-free networks. Phys. Rev. Lett. 87, 278701 (2001)

    Article  Google Scholar 

  21. Liu, Z., Hu, M.-B., Jiang, R., Wang, W.-X., Wu, Q.-S.: Method to enhance traffic capacity for scale-free networks. Phys. Rev. E 76, 037101 (2007)

    Article  Google Scholar 

  22. Fukumoto, R., Arakawa, S., Murata, M.: On routing controls in ISP topologies: a structural perspective. In: Proceedings of Communications and Networking in China, pp 1–5. Chinacom (2006)

  23. Liu, Y., Peng, W., Jinshu, S., Wang, Z.: Assessing the impact of cascading failures on the interdomain routing system of the internet. New Gener. Comput. 32(3), 237–255 (2014)

    Article  Google Scholar 

  24. Rak, J., Walkowiak, K.: Reliable anycast and unicast routing: protection against attacks. Telecommun. Syst. 52, 889–906 (2013)

    Google Scholar 

  25. Motter, A.E., Lai, Y.: Cascade-based attacks on complex networks. Phys. Rev. E 66, 065102(R) (2002)

    Article  Google Scholar 

  26. Xiao S., Xiao, G.: On local link repairing in complex communication networks under intentional attack. Proc. ICICS (2007)

  27. Wang, Y., Xiao, G., Cheng, T.H., Xiao, S., Fu, X.: Robustness of complex communication networks under link attacks. In: Proc. ICAIT ’08 (2008)

  28. Albert, R., Barabási, A.L.: Statistical mechanics of complex networks. Rev. Mod. Phys. 74(1), 47–97 (2002)

    Article  MathSciNet  MATH  Google Scholar 

  29. Chung, F., Lu, L.: The average distance in a random graph with given expected degrees. Internet Math. 1, 91–113 (2003)

    Article  MathSciNet  MATH  Google Scholar 

  30. Aiello, W., Chung, F., Lu, L.: A random graph model for massive graphs. In: Proc. STOC (2000)

  31. Li, L., Alderson, D., Willinger, W., Doyle, J.: A first-principles approach to understanding the internet’s router-level topology. ACM SIGCOMM Comput. Commun. Rev. 34(4), 3–14 (2004)

    Article  Google Scholar 

  32. Abilene Network Detailed information about the objectives, organization, and development of the abilene network, [Online]. http://www.Internet2.edu/abilene (2004)

  33. Li, L., Alderson, D., Willinger, W., Doyle, J.: Topology information for five networks, [Online]. http://hot.caltech.edu/topology/toynets.html (2004)

  34. Alderson, D., Li, L., Willinger, W., Doyle, J.: Understanding internet topology: principles, models, and validation. IEEE/ACM Trans. Netw. 13(6), 1205–1218 (2005)

    Article  Google Scholar 

  35. Zhang, Y., Roughan, M., Lund, C., Donoho, D.: An information-theoretic approach to traffic matrix estimation. In: Proc. ACM SIGCOMM, Comput. Commun. Rev., vol. 33, pp. 301–312 (2003)

  36. Yan, G., Zhou, T., Hu, B., Fu, Z.-Q., Wang, B.-H.: Efficient routing on complex networks. Phys. Rev. E 73, 046108 (2006)

    Article  Google Scholar 

  37. Freeman, L.C.: A set of measures of centrality based on betweenness. Sociometry 40, 35–41 (1977)

    Article  Google Scholar 

  38. Newman, M.E.J., Strogatz, S.H., Watts, D.J.: Random graphs with arbitrary degree distributions and their applications. Phys. Rev. E 64, 026118 (2001)

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Walid K. Ghamry.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Ghamry, W.K., Shukry, S. On the Interplay of Network Structure and Routing Strategies on Network Design Methods for Mitigation of Intentional Attacks in Scale-Free Networks. J Netw Syst Manage 25, 508–535 (2017). https://doi.org/10.1007/s10922-016-9400-1

Download citation

  • Received:

  • Revised:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10922-016-9400-1

Keywords

Navigation