Volume 2, Number 3 (October 2006)                   IJEEE 2006, 2(3): 106-120 | Back to browse issues page


XML Print


Download citation:
BibTeX | RIS | EndNote | Medlars | ProCite | Reference Manager | RefWorks
Send citation to:

M. Abadi, S. Jalili. An Ant Colony Optimization Algorithm for Network Vulnerability Analysis. IJEEE. 2006; 2 (3) :106-120
URL: http://ijeee.iust.ac.ir/article-1-19-en.html

Abstract:   (18539 Views)
Intruders often combine exploits against multiple vulnerabilities in order to break into the system. Each attack scenario is a sequence of exploits launched by an intruder that leads to an undesirable state such as access to a database, service disruption, etc. The collection of possible attack scenarios in a computer network can be represented by a directed graph, called network attack graph (NAG). The aim of minimization analysis of network attack graphs is to find a minimum critical set of exploits that completely disconnect the initial nodes and the goal nodes of the graph. In this paper, we present an ant colony optimization algorithm, called AntNAG, for minimization analysis of large-scale network attack graphs. Each ant constructs a critical set of exploits. A local search heuristic has been used to improve the overall performance of the algorithm. The aim is to find a minimum critical set of exploits that must be prevented to guarantee no attack scenario is possible. We compare the performance of the AntNAG with a greedy algorithm for minimization analysis of several large-scale network attack graphs. The results of the experiments show that the AntNAG can be successfully used for minimization analysis of large-scale network attack graphs.
Full-Text [PDF 608 kb]   (3000 Downloads)    
Type of Study: Research Paper |
Received: 2008/10/07 | Accepted: 2013/12/30 | Published: 2013/12/30

Add your comments about this article : Your username or email:
Write the security code in the box