Security Incident Handling and Organisational Models Hossein Hayati Karun Autumn 2006 Gjøvik University College.

Slides:



Advertisements
Similar presentations
Max Flow Min Cut. Theorem The maximum value of an st-flow in a digraph equals the minimum capacity of an st-cut. Theorem If every arc has integer capacity,
Advertisements

Lecture 5: Network Flow Algorithms Max-Flow Min-Cut Single-Source Shortest-Path (SSSP) Job Sequencing.
Orthogonal Drawing Kees Visser. Overview  Introduction  Orthogonal representation  Flow network  Bend optimal drawing.
Max Flow Problem Given network N=(V,A), two nodes s,t of V, and capacities on the arcs: uij is the capacity on arc (i,j). Find non-negative flow fij for.
1 EE5900 Advanced Embedded System For Smart Infrastructure Static Scheduling.
1 Maximum flow sender receiver Capacity constraint Lecture 6: Jan 25.
EMIS 8374 Vertex Connectivity Updated 20 March 2008.
R. Johnsonbaugh Discrete Mathematics 5 th edition, 2001 Chapter 8 Network models.
Introduction To Algorithms CS 445 Discussion Session 8 Instructor: Dr Alon Efrat TA : Pooja Vaswani 04/04/2005.
Network Optimization Models: Maximum Flow Problems
The Maximum Network Flow Problem. CSE Network Flows.
Chapter 10: Iterative Improvement The Maximum Flow Problem The Design and Analysis of Algorithms.
1 Chapter 7 Network Flow Slides by Kevin Wayne. Copyright © 2005 Pearson-Addison Wesley. All rights reserved.
1 The Max Flow Problem. 2 Flow networks Flow networks are the problem instances of the max flow problem. A flow network is given by 1) a directed graph.
Modelling with Max Flow 1. 2 The Max Flow Problem.
CSE 421 Algorithms Richard Anderson Lecture 22 Network Flow.
Maximum Flows Lecture 4: Jan 19. Network transmission Given a directed graph G A source node s A sink node t Goal: To send as much information from s.
A network is shown, with a flow f. v u 6,2 2,2 4,1 5,3 2,1 3,2 5,1 4,1 3,3 Is f a maximum flow? (a) Yes (b) No (c) I have absolutely no idea a b c d.
Linear Programming – Max Flow – Min Cut Orgad Keller.
CSE 421 Algorithms Richard Anderson Lecture 22 Network Flow.
1 Ford-Fulkerson method Ford-Fulkerson(G) f = 0 while( 9 simple path p from s to t in G f ) f := f + f p output f Runs in time O(|f max | |E|) where f.
Networks and the Shortest Path Problem.  Physical Networks  Road Networks  Railway Networks  Airline traffic Networks  Electrical networks, e.g.,
CS774. Markov Random Field : Theory and Application Lecture 13 Kyomin Jung KAIST Oct
Lecture 5: Network Flow Algorithms Single-Source Shortest-Path (SSSP) (Dijkstra's Algorithm) Max Flow - Min Cut (Ford-Fulkerson) Job Sequencing.
1 CS612 Algorithms for Electronic Design Automation CS 612 – Lecture 8 Lecture 8 Network Flow Based Modeling Mustafa Ozdal Computer Engineering Department,
Network Flow How to solve maximal flow and minimal cut problems.
Announcements Network Flow today, depending on how far we get, we will do String Matching on Wednesday Then Review for Final next Monday This week’s lab.
Network Flow. Network flow formulation A network G = (V, E). Capacity c(u, v)  0 for edge (u, v). Assume c(u, v) = 0 if (u, v)  E. Source s and sink.
CS 4407, Algorithms University College Cork, Gregory M. Provan Network Optimization Models: Maximum Flow Problems In this handout: The problem statement.
Flow Algorithms Prepared by John Reif, Ph.D. Distinguished Professor of Computer Science Duke University Analysis of Algorithms Week 9, Lecture 2.
The Ford-Fulkerson Augmenting Path Algorithm for the Maximum Flow Problem Thanks to Jim Orlin & MIT OCW.
CS223 Advanced Data Structures and Algorithms 1 Maximum Flow Neil Tang 3/30/2010.
Chapter 7 April 28 Network Flow.
CSCI-256 Data Structures & Algorithm Analysis Lecture Note: Some slides by Kevin Wayne. Copyright © 2005 Pearson-Addison Wesley. All rights reserved. 25.
1 CS612 Algorithms for Electronic Design Automation CS 612 – Lecture 8 Lecture 8 Network Flow Based Modeling Mustafa Ozdal Computer Engineering Department,
Model 5 Long Distance Phone Calls By Benjamin Cutting
1 EE5900 Advanced Embedded System For Smart Infrastructure Static Scheduling.
CSCI-256 Data Structures & Algorithm Analysis Lecture Note: Some slides by Kevin Wayne. Copyright © 2005 Pearson-Addison Wesley. All rights reserved. 23.
CSEP 521 Applied Algorithms Richard Anderson Lecture 8 Network Flow.
CSE 421 Algorithms Richard Anderson Lecture 22 Network Flow.
Markov Random Fields in Vision
11/21/02CSE Max Flow CSE Algorithms Max Flow Problems.
The Maximum Network Flow Problem
TU/e Algorithms (2IL15) – Lecture 8 1 MAXIMUM FLOW (part II)
Network Flow.
Max-flow, Min-cut Network flow.
Richard Anderson Lecture 23 Network Flow
CSCI 3160 Design and Analysis of Algorithms Tutorial 8
Network Flow.
Max-flow, Min-cut Network flow.
Network Flow 2016/04/12.
CSE Algorithms Max Flow Problems 11/21/02 CSE Max Flow.
Lecture 19-Problem Solving 4 Incremental Method
Network Flows – Multiple sources and sinks
Vertex Covers, Matchings, and Independent Sets
Richard Anderson Lecture 21 Network Flow
Problem Solving 4.
Primal-Dual Algorithm
Network Flow CSE 373 Data Structures.
EE5900 Advanced Embedded System For Smart Infrastructure
Max Flow / Min Cut.
Network Flow.
Lecture 21 Network Flow, Part 1
Richard Anderson Lecture 22 Network Flow
Lecture 21 Network Flow, Part 1
Maximum Flow Neil Tang 4/8/2008
Network Flow.
Vehicle routing in Python
Richard Anderson Lecture 22 Network Flow
Maximum Flow Problems in 2005.
Presentation transcript:

Security Incident Handling and Organisational Models Hossein Hayati Karun Autumn 2006 Gjøvik University College

Research questions How to measure the efficiency of routines for security incident handling in two organisational models? How to increase the efficiency of routines for handling security incidents?

Organisational models HierarchicMatrix

Organisation charts (1/2) Samples of hierarchical structures 12 employees with total capacity of employees with total capacity of employees with total capacity of 265

Organisation charts (2/2) Samples of matrix structures 12 employees with total capacity of employees with total capacity of employees with total capacity of 265

Network flow theorem Menger’s theorem can be interpreted in the network flow context in the following way: The maximum amount of flow in a network is equal to the capacity of a minimum cut.

Graph capacity Each edge is assigned with an integer The integer indicates the edge’s capacity For instance: a  d = 5

Computing the max flow 1.S  a = 5 2.a  d = 5 3.d  g = 5 4.g  T = 5 Flow capacity = 5

Maximum flow Computing the max flow FromToCapacity Sa5 ad5 dg5 gT5 Sb3 be3 eh3 hT3 Sc2 ce2 eg2 gT2 FromToCapacity Sc2 ce2 eh2 hT2 Sc1 cf1 fh1 HT1 Max flow = 13

Minimum cut Computing the min cut 9 min cuts (green lines) A = = 13 B = = 13 D = = 13 E = = 13 … Min cut = 13

Max flow – min cut The maximum amount of flow in a network is equal to the capacity of a minimum cut. Max flow = Min cut = 13

Ford-Fulkerson’s algorithm Advantages: Simplicity during the implementation high speed of the algorithm requires little processor power Disadvantage: the insignificant probability of not returning a value which means not being able to calculate the flow capacity

The prototype Computes max flow Developed in C# Basen on FF’s algo Textual presentation Graphical presentation

2 sets of data files (12 files) 1.Solved security incidents Employees: Same capacity as in 2. Managers: Lower security incidents solving capacity than employees 2. Reported security incidents Employees: same capacity as in 1. Managers: Higher reporting capacity than solving security incidents

Results of our experiment Solved security incidents –Hierarchic structure –Matrix structure Reported security incidents –Hierarchic structure –Matrix structure

Nodes and edges

Solved security incidents in hierarchical structure

Solved security incidents in matrix structure

Reported security incidents in hierarchical structure

Reported security incidents in matrix structure

Solved security incidents in hierarchical and matrix structure

Reported security incidents in hierarchical and matrix structure

Conclusion 1.Matrix organisational model are a more efficient organisational model than the hierarchical model, both in solving and reporting security incidents. 2.Increasing the efficiency of routines for handling security incidents does not depend on the organisations’ size, but rather the organisations’ model. 1. Using network flow capacity 2. Reorganise to matrix structure

Usefulness … Eases the computation of max flow Personnel dealing with security organisation, security management … Computing max flow when any changes like merging or dividing companies or department take place Testing other organisational models

Thanks to … Professor Slobodan Petrovic Monica Strand Kristiansen Brita Vesterås And all of you Any question?