A new approach for network vulnerability analysis

Author(s):  
Hai L. Vu ◽  
Kenneth K. Khaw ◽  
TY Chen ◽  
Fei-Ching Kuo
2014 ◽  
Vol 58 (4) ◽  
pp. 878-891
Author(s):  
H. L. Vu ◽  
K. K. Khaw ◽  
T. Y. Chen

2018 ◽  
Vol 29 (03) ◽  
pp. 447-456 ◽  
Author(s):  
Zeynep Nihan Berberler ◽  
Esin Yigit

Link residual closeness is reported as a new graph vulnerability measure, a graph-based approach to network vulnerability analysis, and more sensitive than some other existing vulnerability measures. Residual closeness is of great theoretical and practical significance to network design and optimization. In this paper, how some of the graph types perform when they suffer a link failure is discussed. Vulnerability of graphs to the failure of individual links is computed via link residual closeness which provides a much fuller characterization of the network.


Sign in / Sign up

Export Citation Format

Share Document