Abstract
The issue on optimality and robustness has become a major concern in large-scale network systems. While a star-like centralized network surtcture is optimal in terms of the average path length, it is vulnerable to the breakdown arising in the central node. Scale-free network (SFN) is known to be effective topology in terms of both the average path length and robustness against random breakdown. However, if the hub nodes are intentionally attacked, SFN is found vulnerable. In this paper, we propose an evolutionary network model which reconfigures a network suructure according to the various types of breakdown or intentional attacks while maintaining the system performance. The local evaluation indice and control parameters are introduced to regulate a balance between efficiency and robustness. Simulation results suggest that the proposed approach is promising.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Echenique, P., Gardenes, J.g., Moreno, Y.: Dynamics of jamming transitions in complex networks. cond-mat/0412053 (2004)
Valente, A.X.C.N., Sarkar, A., Howard, A.: Two-peak and three-peak optimal complex networks. Physical Review Letters 92(2), 118702 (2004)
Huberman, B.A., Adamic, L.A.: Growth dynamics of the world wide web. Nature 401, 130 (1999)
Faloutsos, C., Faloutsos, M., Faloutsos, P.: On power-law relationships of the internet topology. In: ACM SIGCOMM 1999, vol. 29, pp. 251–263 (1999)
Strogtz, S.H.: Exploring complex networks. Nature 410, 268–276 (2001)
Barabasi, A.L.: The New Science of Networks. Perseus Books Group (2002)
Cohen, R., Havlin, S.: Scale-free networks are ultrasmall. Physical Review Letters 90(5), 58701 (2003)
Albert, R., Jeong, H., Barabasi, A.-L.: Error and attack tolerance of complex networks. Nature 406, 378–382 (2000)
Cohen, R., Erez, K., ben Avraham, D., Havlin, S.: Resilience of the internet to random breakdowns. PHYSICAL REVIEW LETTERS 85(21), 4626–4628 (2000)
Cohen, R., Erez, K., ben Avraham, D., Havlin, S.: Breakdown of the internet under intentional attack. Physical Review Letters 86(16), 3682–3685 (2001)
Zhao, L., Park, K., Lai, Y.-C.: Attack vulnerability of scale-free networks due to cascading breakdown. PHYSICAL REVIEW EÂ 70, 35101 (2004)
GoLmez-Gardenes, J., Moreno, Y.: Local versus global knowledge in the barabalsi-albert scale-free network model. PHYSICAL REVIEW EÂ 69, 37103 (2004)
Kalisky, T., Sreenivasan, S., Braunstein, L.A., Buldyrev, S.V., Havlin, S., Stanley, H.E.: Scale-free networks emerging from weighted random graphs. cond-mat/0503598Â (2005)
Motter1, A.E., Lai, Y.-C.: Cascade-based attacks on complex networks. PHYSICAL REVIEW EÂ 66, 65102 (2002)
Crucitti, P., Latora, V., Marchiori, M., Rapisarda, A.: Error and attack tolerance of complex networks. PHYSICA A 340, 388–394 (2004)
Guillaume, J.-L., Latapy, M., Magnien, C.: Comparison of failures and attacks on random and scale-free networks. In: Higashino, T. (ed.) OPODIS 2004. LNCS, vol. 3544, Springer, Heidelberg (2005)
Lee, E.J., Goh, K.-I., Kahng, B., Kim, D.: Robustness of the avelanche dynamics in data-paket transport on scale-free networks. PHYSICAL REVIEW EÂ 71, 56108 (2005)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2007 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Sekiyama, K., Araki, H. (2007). Network Topology Reconfiguration Against Targeted and Random Attack. In: Hutchison, D., Katz, R.H. (eds) Self-Organizing Systems. IWSOS 2007. Lecture Notes in Computer Science, vol 4725. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-74917-2_11
Download citation
DOI: https://doi.org/10.1007/978-3-540-74917-2_11
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-74916-5
Online ISBN: 978-3-540-74917-2
eBook Packages: Computer ScienceComputer Science (R0)