DocumentCode
2006760
Title
Scalable Patch Management Using Evolutionary Analysis of Attack Graphs
Author
Danforth, Melissa
Author_Institution
Bakersfield Dept. of Comput. Sci., California State Univ., Bakersfield, CA
fYear
2008
fDate
11-13 Dec. 2008
Firstpage
300
Lastpage
307
Abstract
Network administrators must not only consider the vulnerabilities on each individual machine, but also how those vulnerabilities interact in a networked environment. Attack graphs are a tool to determine these interactions. They allow an administrator to visualize paths an attacker may take to compromise the network. Two critical issues that are often overlooked in analyzing attack graphs are the scalability of the method to large networks and the ability of the administrator to customize the method to the needs of his particular network. This work provides a method based on a multi-objective genetic algorithm to analyze attack graph and determine a minimum set of patches. The method is able to scale to networks containing several hundred machines.
Keywords
computer network management; genetic algorithms; graph theory; telecommunication security; attack graph; evolutionary analysis; multiobjective genetic algorithm; network administration; scalable patch management; Algorithm design and analysis; Application software; Computer network management; Conference management; Database machines; Genetic algorithms; Machine learning; Network servers; Scalability; Tree graphs; Evolutionary analysis; attack graphs; patch management;
fLanguage
English
Publisher
ieee
Conference_Titel
Machine Learning and Applications, 2008. ICMLA '08. Seventh International Conference on
Conference_Location
San Diego, CA
Print_ISBN
978-0-7695-3495-4
Type
conf
DOI
10.1109/ICMLA.2008.80
Filename
4724990
Link To Document