Resiliency of Network Topologies under Path-Based Attacks

Heejo LEE
Jong KIM
Wan Yeon LEE

Publication
IEICE TRANSACTIONS on Communications   Vol.E89-B    No.10    pp.2878-2884
Publication Date: 2006/10/01
Online ISSN: 1745-1345
DOI: 10.1093/ietcom/e89-b.10.2878
Print ISSN: 0916-8516
Type of Manuscript: PAPER
Category: Internet
Keyword: 
network topology,  attack resiliency,  connectivity,  graph theory,  

Full Text: PDF(287.7KB)>>
Buy this Article


Summary: 
Network topology has no direct effect on the correctness of network protocols, however, it influences the performance of networks and their survivability when they are under attack. Recent studies have analyzed the robustness of the Internet in the face of faults or attacks which may cause node failures. However, the effect of link failure or a series of link failures has not been extensively examined, even though such a situation is more likely to occur in the current Internet environment. In this paper, we propose an attack-and-failure graph model and practical techniques for attacking strategies against nodes, edges or paths in order to reflect real-life attack scenarios. The resiliency of Internet topologies is examined under the attacking strategies, with various metrics including path-failure ratio and "attack power," which is defined as the ratio of the failure to attack. The experiments reveal that "path-based" attacks can result in greater damage to the connectivity of a network than the other types of attack. Nonetheless, the effectiveness of an attack depends on the objective that the attacker wants to achieve through the attack. The proposed simple but formalized approach can be a springboard for developing more resilient Internet topologies in a variety of aspects.