Modeling and analyzing cascading dynamics of the Internet based on local congestion information
Abstract
Cascading failure has already become one of the vital issues in network science. By considering realistic network operational settings, we propose the congestion function to represent the congested extent of node and construct a local congestion-aware routing strategy with a tunable parameter. We investigate the cascading failures on the Internet triggered by deliberate attacks. Simulation results show that the tunable parameter has an optimal value that makes the network achieve a maximum level of robustness. The robustness of the network has a positive correlation with tolerance parameter, but it has a negative correlation with the packets generation rate. In addition, there exists a threshold of the attacking proportion of nodes that makes the network achieve the lowest robustness. Moreover, by introducing the concept of time delay for information transmission on the Internet, we found that an increase of the time delay will decrease the robustness of the network rapidly. The findings of the paper will be useful for enhancing the robustness of the Internet in the future.
- Publication:
-
Physica A Statistical Mechanics and its Applications
- Pub Date:
- June 2018
- DOI:
- 10.1016/j.physa.2018.02.039
- Bibcode:
- 2018PhyA..499..298Z
- Keywords:
-
- Cascading failure;
- Routing;
- Intentional attack;
- Congestion;
- Robustness