Network defense strategy selection with reinforcement learning and pareto optimization

12Citations
Citations of this article
20Readers
Mendeley users who have this article in their library.

Abstract

Improving network security is a difficult problem that requires balancing several goals, such as defense cost and need for network efficiency, in order to achieve proper results. In this paper, we devise method of modeling network attack in a zero-sum multi-objective game and attempt to find the best defense against such an attack. We combined Pareto optimization and Q-learning methods to determine the most harmful attacks and consequently to find the best defense against those attacks. The results should help network administrators in search of a hands-on method of improving network security.

Cite

CITATION STYLE

APA

Sun, Y., Xiong, W., Yao, Z., Moniz, K., & Zahir, A. (2017). Network defense strategy selection with reinforcement learning and pareto optimization. Applied Sciences (Switzerland), 7(11). https://doi.org/10.3390/app7111138

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free