Endre søk
RefereraExporteraLink to record
Permanent link

Direct link
Referera
Referensformat
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Annet format
Fler format
Språk
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Annet språk
Fler språk
Utmatningsformat
  • html
  • text
  • asciidoc
  • rtf
Learning Intrusion Prevention Policies through Optimal Stopping
KTH, Skolan för elektroteknik och datavetenskap (EECS), Datavetenskap, Nätverk och systemteknik. (KTH Ctr Cyber Def & Informat Secur, Stockholm, Sweden.)ORCID-id: 0000-0003-1773-8354
KTH, Skolan för elektroteknik och datavetenskap (EECS), Datavetenskap, Nätverk och systemteknik. (KTH Ctr Cyber Def & Informat Secur, Stockholm, Sweden.)ORCID-id: 0000-0001-6039-8493
2021 (engelsk)Inngår i: Proceedings Of The 2021 17Th International Conference On Network And Service Management (CNSM 2021): Smart Management For Future Networks And Services / [ed] Chemouil, P Ulema, M Clayman, S Sayit, M Cetinkaya, C Secci, S, IEEE, 2021, s. 509-517Konferansepaper, Publicerat paper (Fagfellevurdert)
Abstract [en]

We study automated intrusion prevention using reinforcement learning. In a novel approach, we formulate the problem of intrusion prevention as an optimal stopping problem. This formulation allows us insight into the structure of the optimal policies, which turn out to be threshold based. Since the computation of the optimal defender policy using dynamic programming is not feasible for practical cases, we approximate the optimal policy through reinforcement learning in a simulation environment. To define the dynamics of the simulation, we emulate the target infrastructure and collect measurements. Our evaluations show that the learned policies are close to optimal and that they indeed can be expressed using thresholds.

sted, utgiver, år, opplag, sider
IEEE, 2021. s. 509-517
Serie
International Conference on Network and Service Management, ISSN 2165-9605
Emneord [en]
Network Security, automation, optimal stopping, reinforcement learning, Markov Decision Processes
HSV kategori
Identifikatorer
URN: urn:nbn:se:kth:diva-316712DOI: 10.23919/CNSM52442.2021.9615542ISI: 000836226700080Scopus ID: 2-s2.0-85123452404OAI: oai:DiVA.org:kth-316712DiVA, id: diva2:1691534
Konferanse
17th International Conference on Network and Service Management (CNSM) - Smart Management for Future Networks and Services, OCT 25-29, 2021, ELECTR NETWORK
Merknad

Part of proceedings: ISBN 978-3-903176-36-2, QC 20220830

Tilgjengelig fra: 2022-08-30 Laget: 2022-08-30 Sist oppdatert: 2022-08-31bibliografisk kontrollert

Open Access i DiVA

Fulltekst mangler i DiVA

Andre lenker

Forlagets fulltekstScopus

Person

Hammar, KimStadler, Rolf

Søk i DiVA

Av forfatter/redaktør
Hammar, KimStadler, Rolf
Av organisasjonen

Søk utenfor DiVA

GoogleGoogle Scholar

doi
urn-nbn

Altmetric

doi
urn-nbn
Totalt: 132 treff
RefereraExporteraLink to record
Permanent link

Direct link
Referera
Referensformat
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Annet format
Fler format
Språk
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Annet språk
Fler språk
Utmatningsformat
  • html
  • text
  • asciidoc
  • rtf