AN ANT COLONY OPTIMIZATION VULNERABILITY ANALYSIS ALGORITHM FOR NETWORK

Q: How can I download an article?

To download an article from SID, first log in to the site, search for the article title, and click on the 'Download Article' option.

Q: How can I download an ISI article?

To download an ISI article on SID, enter the keyword or article title in the search bar, view the relevant results, click on the desired article, and select the 'Download Article' option.

Q: How can I access the SID database?

To access the SID database, visit SID.ir, create an account, and log in to access scientific resources.

Q: Is downloading articles from SID free?

Some articles on SID are available for free, while others require payment. Details are specified on the article's page.

ABADI MAHDI; JALALI S.

مرکز اطلاعات علمی Scientific Information Database (SID) - Trusted Source for Research and Academic Resources

Journal Paper

Paper Information

Journal: IRANIAN JOURNAL OF ELECTRICAL AND ELECTRONIC ENGINEERING Year:2006 | Volume:2 | Issue:3-4 Page(s): 106-120

Download Full-Text

View:

337

Download:

166

Cites:

Information Journal Paper

Title

AN ANT COLONY OPTIMIZATION VULNERABILITY ANALYSIS ALGORITHM FOR NETWORK

Author(s)

ABADI MAHDI | JALALI S. | Issue Writer Certificate

Keywords

ANT COLONY OPTIMIZATION

METAHEURISTIC

NETWORK ATTACK GRAPH

NETWORK VULNERABILITY ANALYSIS

Abstract

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.

Multimedia

No record.

Cites

No record.

References

No record.

Cite

APA: Copy

ABADI, MAHDI, & JALALI, S.. (2006). AN ANT COLONY OPTIMIZATION VULNERABILITY ANALYSIS ALGORITHM FOR NETWORK. IRANIAN JOURNAL OF ELECTRICAL AND ELECTRONIC ENGINEERING, 2(3-4), 106-120. SID. https://sid.ir/paper/299698/en

Vancouver: Copy

ABADI MAHDI, JALALI S.. AN ANT COLONY OPTIMIZATION VULNERABILITY ANALYSIS ALGORITHM FOR NETWORK. IRANIAN JOURNAL OF ELECTRICAL AND ELECTRONIC ENGINEERING[Internet]. 2006;2(3-4):106-120. Available from: https://sid.ir/paper/299698/en

IEEE: Copy

MAHDI ABADI, and S. JALALI, “AN ANT COLONY OPTIMIZATION VULNERABILITY ANALYSIS ALGORITHM FOR NETWORK,” IRANIAN JOURNAL OF ELECTRICAL AND ELECTRONIC ENGINEERING, vol. 2, no. 3-4, pp. 106–120, 2006, [Online]. Available: https://sid.ir/paper/299698/en

Related Journal Papers

No record.

Related Seminar Papers

No record.

Related Plans

No record.

Recommended Workshops