Skip to main content
Top
Published in: Journal of Network and Systems Management 3/2017

30-11-2016

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

Authors: Walid K. Ghamry, Suzan Shukry

Published in: Journal of Network and Systems Management | Issue 3/2017

Log in

Activate our intelligent search to find suitable subject content or patents.

search-config
loading …

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.

Dont have a licence yet? Then find out more about our products and how to get one now:

Springer Professional "Wirtschaft+Technik"

Online-Abonnement

Mit Springer Professional "Wirtschaft+Technik" erhalten Sie Zugriff auf:

  • über 102.000 Bücher
  • über 537 Zeitschriften

aus folgenden Fachgebieten:

  • Automobil + Motoren
  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Elektrotechnik + Elektronik
  • Energie + Nachhaltigkeit
  • Finance + Banking
  • Management + Führung
  • Marketing + Vertrieb
  • Maschinenbau + Werkstoffe
  • Versicherung + Risiko

Jetzt Wissensvorsprung sichern!

Springer Professional "Technik"

Online-Abonnement

Mit Springer Professional "Technik" erhalten Sie Zugriff auf:

  • über 67.000 Bücher
  • über 390 Zeitschriften

aus folgenden Fachgebieten:

  • Automobil + Motoren
  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Elektrotechnik + Elektronik
  • Energie + Nachhaltigkeit
  • Maschinenbau + Werkstoffe




 

Jetzt Wissensvorsprung sichern!

Springer Professional "Wirtschaft"

Online-Abonnement

Mit Springer Professional "Wirtschaft" erhalten Sie Zugriff auf:

  • über 67.000 Bücher
  • über 340 Zeitschriften

aus folgenden Fachgebieten:

  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Finance + Banking
  • Management + Führung
  • Marketing + Vertrieb
  • Versicherung + Risiko




Jetzt Wissensvorsprung sichern!

Literature
1.
go back to reference Bornholdt, S., Schuster, H.G. (eds.): Handbook of Graphs and Networks: From the Genome to the Internet. Wiley-VCH, Weinheim (2003) Bornholdt, S., Schuster, H.G. (eds.): Handbook of Graphs and Networks: From the Genome to the Internet. Wiley-VCH, Weinheim (2003)
2.
go back to reference Govindan, R., Tangmunarunkit, H.: Heuristics for internet map discovery. In: Proc. IEEE INFOCOM, pp. 1371–1380. Tel Aviv (2000) Govindan, R., Tangmunarunkit, H.: Heuristics for internet map discovery. In: Proc. IEEE INFOCOM, pp. 1371–1380. Tel Aviv (2000)
3.
go back to reference 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) 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.
go back to reference Albert, R., Jeong, H., Barabasi, A.-L.: Error and attack tolerance of complex networks. Nature 406, 378–382 (2000)CrossRef Albert, R., Jeong, H., Barabasi, A.-L.: Error and attack tolerance of complex networks. Nature 406, 378–382 (2000)CrossRef
5.
go back to reference 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) 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.
go back to reference Zhao, L., Park, K., Lai, Y.-C.: Attack vulnerability of scale-free networks due to cascading breakdown. Phys. Rev. E70, 035101(R) (2004) Zhao, L., Park, K., Lai, Y.-C.: Attack vulnerability of scale-free networks due to cascading breakdown. Phys. Rev. E70, 035101(R) (2004)
7.
go back to reference 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)CrossRef 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)CrossRef
8.
go back to reference 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)CrossRef 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)CrossRef
9.
go back to reference 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)CrossRef 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)CrossRef
10.
go back to reference 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) 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.
go back to reference Holme, P., Kim, B.J.: Vertex overload breakdown in evolving networks. Phys. Rev. Lett. E 65, 026139 (2002)CrossRef Holme, P., Kim, B.J.: Vertex overload breakdown in evolving networks. Phys. Rev. Lett. E 65, 026139 (2002)CrossRef
12.
go back to reference Holme, P.: Edge overload breakdown in evolving networks. Phys. Rev. Lett. E 65, 066109 (2002)CrossRef Holme, P.: Edge overload breakdown in evolving networks. Phys. Rev. Lett. E 65, 066109 (2002)CrossRef
13.
go back to reference Iyer, S., Killingback, T., Sundaram, B., Wang, Z.: Attack robustness and centrality of complex networks. PLoS ONE 8(4), e59613 (2013)CrossRef Iyer, S., Killingback, T., Sundaram, B., Wang, Z.: Attack robustness and centrality of complex networks. PLoS ONE 8(4), e59613 (2013)CrossRef
14.
go back to reference Kim, Hyoungshick, Anderson, Ross J.: An experimental evaluation of robustness of networks. IEEE Syst. J. 7(2), 179–188 (2013)CrossRef Kim, Hyoungshick, Anderson, Ross J.: An experimental evaluation of robustness of networks. IEEE Syst. J. 7(2), 179–188 (2013)CrossRef
15.
go back to reference Crucitti, P., Latora, V., Marchiori, M., Rapisarda, A.: Error and attack tolerance of complex networks. Physica A320, 622 (2003)CrossRefMATH Crucitti, P., Latora, V., Marchiori, M., Rapisarda, A.: Error and attack tolerance of complex networks. Physica A320, 622 (2003)CrossRefMATH
16.
go back to reference 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) 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.
go back to reference Magoni, D.: Tearing down the internet. IEEE J. Sel. Areas Commun. 21(6), 949–960 (2003)CrossRef Magoni, D.: Tearing down the internet. IEEE J. Sel. Areas Commun. 21(6), 949–960 (2003)CrossRef
18.
go back to reference 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) 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.
go back to reference 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 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.
go back to reference Goh, K.I., Kahng, B., Kim, D.: Universal behavior of load distribution in scale-free networks. Phys. Rev. Lett. 87, 278701 (2001)CrossRef Goh, K.I., Kahng, B., Kim, D.: Universal behavior of load distribution in scale-free networks. Phys. Rev. Lett. 87, 278701 (2001)CrossRef
21.
go back to reference 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)CrossRef 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)CrossRef
22.
go back to reference 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) 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.
go back to reference 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)CrossRef 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)CrossRef
24.
go back to reference Rak, J., Walkowiak, K.: Reliable anycast and unicast routing: protection against attacks. Telecommun. Syst. 52, 889–906 (2013) Rak, J., Walkowiak, K.: Reliable anycast and unicast routing: protection against attacks. Telecommun. Syst. 52, 889–906 (2013)
25.
go back to reference Motter, A.E., Lai, Y.: Cascade-based attacks on complex networks. Phys. Rev. E 66, 065102(R) (2002)CrossRef Motter, A.E., Lai, Y.: Cascade-based attacks on complex networks. Phys. Rev. E 66, 065102(R) (2002)CrossRef
26.
go back to reference Xiao S., Xiao, G.: On local link repairing in complex communication networks under intentional attack. Proc. ICICS (2007) Xiao S., Xiao, G.: On local link repairing in complex communication networks under intentional attack. Proc. ICICS (2007)
27.
go back to reference Wang, Y., Xiao, G., Cheng, T.H., Xiao, S., Fu, X.: Robustness of complex communication networks under link attacks. In: Proc. ICAIT ’08 (2008) Wang, Y., Xiao, G., Cheng, T.H., Xiao, S., Fu, X.: Robustness of complex communication networks under link attacks. In: Proc. ICAIT ’08 (2008)
29.
30.
go back to reference Aiello, W., Chung, F., Lu, L.: A random graph model for massive graphs. In: Proc. STOC (2000) Aiello, W., Chung, F., Lu, L.: A random graph model for massive graphs. In: Proc. STOC (2000)
31.
go back to reference 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)CrossRef 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)CrossRef
34.
go back to reference Alderson, D., Li, L., Willinger, W., Doyle, J.: Understanding internet topology: principles, models, and validation. IEEE/ACM Trans. Netw. 13(6), 1205–1218 (2005)CrossRef Alderson, D., Li, L., Willinger, W., Doyle, J.: Understanding internet topology: principles, models, and validation. IEEE/ACM Trans. Netw. 13(6), 1205–1218 (2005)CrossRef
35.
go back to reference 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) 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.
go back to reference Yan, G., Zhou, T., Hu, B., Fu, Z.-Q., Wang, B.-H.: Efficient routing on complex networks. Phys. Rev. E 73, 046108 (2006)CrossRef Yan, G., Zhou, T., Hu, B., Fu, Z.-Q., Wang, B.-H.: Efficient routing on complex networks. Phys. Rev. E 73, 046108 (2006)CrossRef
37.
go back to reference Freeman, L.C.: A set of measures of centrality based on betweenness. Sociometry 40, 35–41 (1977)CrossRef Freeman, L.C.: A set of measures of centrality based on betweenness. Sociometry 40, 35–41 (1977)CrossRef
38.
go back to reference 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)CrossRef 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)CrossRef
Metadata
Title
On the Interplay of Network Structure and Routing Strategies on Network Design Methods for Mitigation of Intentional Attacks in Scale-Free Networks
Authors
Walid K. Ghamry
Suzan Shukry
Publication date
30-11-2016
Publisher
Springer US
Published in
Journal of Network and Systems Management / Issue 3/2017
Print ISSN: 1064-7570
Electronic ISSN: 1573-7705
DOI
https://doi.org/10.1007/s10922-016-9400-1

Other articles of this Issue 3/2017

Journal of Network and Systems Management 3/2017 Go to the issue

Premium Partner