Scribd Logo
Upload

Welcome to Scribd!

  • 16 views

    Optimal Inspection Point

    Uploaded by

    Shah Az
    This document discusses finding optimal inspection points for detecting malicious attacks in smart grids. It presents the optimal inspection points problem, which aims to maximize the number of packets scanned for attacks while meeting latency and capacity constraints. For single-path routing trees, it provides a fully polynomial-time approximation scheme using dynamic programming. For multi-path routing in series-parallel graphs, it also gives a fully polynomial-time approximation scheme using serial and parallel operations. The problem is shown to be NP-complete in general.

    Copyright:

    © All Rights Reserved
    Download as PPTX, PDF, TXT or read online from Scribd

    Optimal Inspection Point

    Uploaded by

    Shah Az
    16 views16 pages
    This document discusses finding optimal inspection points for detecting malicious attacks in smart grids. It presents the optimal inspection points problem, which aims to maximize the number of packets scanned for attacks while meeting latency and capacity constraints. For single-path routing trees, it provides a fully polynomial-time approximation scheme using dynamic programming. For multi-path routing in series-parallel graphs, it also gives a fully polynomial-time approximation scheme using serial and parallel operations. The problem is shown to be NP-complete in general.

    Original Description:

    Copyright

    © © All Rights Reserved

    Available Formats

    PPTX, PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    This document discusses finding optimal inspection points for detecting malicious attacks in smart grids. It presents the optimal inspection points problem, which aims to maximize the number of packets scanned for attacks while meeting latency and capacity constraints. For single-path routing trees, it provides a fully polynomial-time approximation scheme using dynamic programming. For multi-path routing in series-parallel graphs, it also gives a fully polynomial-time approximation scheme using serial and parallel operations. The problem is shown to be NP-complete in general.

    Copyright:

    © All Rights Reserved
    Download as PPTX, PDF, TXT or read online from Scribd
    Download as pptx, pdf, or txt
    16 views16 pages

    Optimal Inspection Point

    Uploaded by

    Shah Az
    This document discusses finding optimal inspection points for detecting malicious attacks in smart grids. It presents the optimal inspection points problem, which aims to maximize the number of packets scanned for attacks while meeting latency and capacity constraints. For single-path routing trees, it provides a fully polynomial-time approximation scheme using dynamic programming. For multi-path routing in series-parallel graphs, it also gives a fully polynomial-time approximation scheme using serial and parallel operations. The problem is shown to be NP-complete in general.

    Copyright:

    © All Rights Reserved
    Download as PPTX, PDF, TXT or read online from Scribd
    Download as pptx, pdf, or txt
    of 16

    Optimal Inspection Points for

    Malicious Attack Detection


    in Smart Grids

    Suhankar Mishra1, Thang N. Dinh2,


    My T. Thai1, and Incheol Shin3
    Dept. of Comp. & Inf. & Sci. & Eng., University of Florida, Gainesville, Florida, USA1
    Dept. of Comp. Sci., Virginia Commonwealth University, Richmond, VA, USA2
    Info. Security Dept., Mokpo National University Muan, Rep. of Korea3

    COCOON 2014 Thang N. Dinh


    [email protected] 1
    Outline
     Motivation

     Optimal Inspection Points Problem

     Single-path routings: FPTAS for trees

     Multiple-path routing: FPTAS for SP-graphs

     Discussion

    COCOON 2014 Thang N. Dinh


    [email protected] 2
    Motivation
     Smart grids =
    o Old electricity network
    o New communication
    o Intelligence
    o Automation

     SCADA (Distribution
    Supervisory Control and Data Acquisition)
    o Transmits individual device status, distribution control
    commands, access logs, etc.
    o Vulnerable to intercepting, tampering, and forging data

    COCOON 2014 Thang N. Dinh


    [email protected] 3
    Motivation (cont.)
     Solution: Deep Packet Inspection (DPI)
    o Advanced Firewalls for SCADA/ICS
    o Dig deeper into the protocols to understand the message
    content and apply more detailed rules

     Challenges
    o Cannot be deployed at all points (e.g. economic reason)
    o Cannot scanned all messages (limited capacity)
    o Strict latency constraints
    • Exp: 3ms for fault isolation and protection control
    messages (IEC 61850)

    COCOON 2014 Thang N. Dinh


    [email protected] 4
    Optimal Inspection Points (OIP)
    Problem : DPI delay
    : center : Capacity
    : Packet flow
    : Intmd nodes

    S: terminal nodes

    COCOON 2014 Thang N. Dinh


    [email protected] 5
    OIP Problem (cont.)
     Input: A directed acyclic graph
    o , where
    • : SCADA center. All packets are forwarded towards
    • S: Terminal nodes that might send malicious packets.
    • O: Set of intermediate nodes where DPI can be deployed
    o : Delay caused by employing DPI at ,
    o : Capacity (#packets) of DPI scanner at ,
    o : Maximum allowable delay for DPI at
    o Flow : traffic(#packets) ,
     Problem: Find a subset of points to deploy DPI
    o Accumulating delay at for DPI
    o Maximize the #scanned packets

    COCOON 2014 Thang N. Dinh


    [email protected] 6
    Complexity

     Theorem 1: OIP problem is NP-complete, even when


    the graph is a simple path.

    COCOON 2014 Thang N. Dinh


    [email protected] 7
    Single-path vs. Multi-path routing
    Single-path routing Multi-path routing
    (Single route, E.g. OSPF) (Different routes possible)

    u u

    #packets routed along


    is proportional to

    COCOON 2014 Thang N. Dinh


    [email protected] 8
    Single-path routing
     The graph is a tree rooted at

     There exists Fully Polynomial-Time Approximation


    Scheme

    COCOON 2014 Thang N. Dinh


    [email protected] 9
    Single-path routing

    COCOON 2014 Thang N. Dinh


    [email protected] 10
    Single-path: Dynamic Programming

    COCOON 2014 Thang N. Dinh


    [email protected] 11
    Multi-path routing

     FPTAS for Series-Parallel graphs

    COCOON 2014 Thang N. Dinh


    [email protected] 12
    Multi-path: FPTAS

    COCOON 2014 Thang N. Dinh


    [email protected] 13
    Multi-path: FPTAS
     Series Operations

     Parallel Operations

    COCOON 2014 Thang N. Dinh


    [email protected] 14
    Conclusions & Discussion
     Introduce Optimal Inspection Points problem in
    Smart Grids and prove its NP-completeness.

     FPTAS for single-path routing

     FPTAS for multi-path routing in SP-graphs

     Approximation Algorithms for Multi-path routing in


    general graph

    COCOON 2014 Thang N. Dinh


    [email protected] 15
    Questions & Answers

    Thank you for your listening!

    COCOON 2014 Thang N. Dinh


    [email protected] 16

    You might also like