Presented by Rich Goyette

Slides:



Advertisements
Similar presentations
6/10/20141 Top-Down Clustering Method Based On TV-Tree Zbigniew W. Ras.
Advertisements

Local Search Jim Little UBC CS 322 – CSP October 3, 2014 Textbook §4.8
Clustering.
SUSTAINABILITY MCDM MODEL COMPARISONS
Highly-Resilient, Energy-Efficient Multipath Routing in Wireless Sensor Networks Computer Science Department, UCLA International Computer Science Institute,
Software Quality Ranking: Bringing Order to Software Modules in Testing Fei Xing Michael R. Lyu Ping Guo.
Introduction to Management Science
CPSC 322, Lecture 15Slide 1 Stochastic Local Search Computer Science cpsc322, Lecture 15 (Textbook Chpt 4.8) February, 6, 2009.
Multivariate Data Analysis Chapter 10 - Multidimensional Scaling
1 IOE/MFG 543 Chapter 14: General purpose procedures for scheduling in practice Sections : Dispatching rules and filtered beam search.
Jan 6-10th, 2007VLSI Design A Reduced Complexity Algorithm for Minimizing N-Detect Tests Kalyana R. Kantipudi Vishwani D. Agrawal Department of Electrical.
Cluster Analysis (1).
Ranking by Odds Ratio A Probability Model Approach let be a Boolean random variable: document d is relevant to query q otherwise Consider document d as.
Introduction to Management Science
Multi-Criteria Analysis – compromise programming.
1 Multi-Criteria Decision Making MCDM Approaches.
On Fairness, Optimizing Replica Selection in Data Grids Husni Hamad E. AL-Mistarihi and Chan Huah Yong IEEE TRANSACTIONS ON PARALLEL AND DISTRIBUTED SYSTEMS,
Clustering Ram Akella Lecture 6 February 23, & 280I University of California Berkeley Silicon Valley Center/SC.
MADM Y. İlker TOPCU, Ph.D twitter.com/yitopcu.
Optimal Design of Timetables to maximize schedule reliability and minimize energy consumption, rolling stock and crew deployment.
Constructing the Decision Model Y. İlker TOPCU, Ph.D twitter.com/yitopcu.
9-1 Copyright © 2010 Pearson Education, Inc. Publishing as Prentice Hall Multicriteria Decision Making Chapter 9.
Multicriteria Decision Making
A User Experience-based Cloud Service Redeployment Mechanism KANG Yu.
Topology Design for Service Overlay Networks with Bandwidth Guarantees Sibelius Vieira* Jorg Liebeherr** *Department of Computer Science Catholic University.
DaVinci: Dynamically Adaptive Virtual Networks for a Customized Internet Jennifer Rexford Princeton University With Jiayue He, Rui Zhang-Shen, Ying Li,
1 Enabling Large Scale Network Simulation with 100 Million Nodes using Grid Infrastructure Hiroyuki Ohsaki Graduate School of Information Sci. & Tech.
Jason Chen, Ph.D. Professor of MIS School of Business
1 1 Slide © 2004 Thomson/South-Western Chapter 17 Multicriteria Decisions n Goal Programming n Goal Programming: Formulation and Graphical Solution and.
1 11 Subcarrier Allocation and Bit Loading Algorithms for OFDMA-Based Wireless Networks Gautam Kulkarni, Sachin Adlakha, Mani Srivastava UCLA IEEE Transactions.
1 S ystems Analysis Laboratory Helsinki University of Technology Kai Virtanen, Raimo P. Hämäläinen and Ville Mattila Systems Analysis Laboratory Helsinki.
Spreadsheet Modeling and Decision Analysis, 3e, by Cliff Ragsdale. © 2001 South-Western/Thomson Learning Multicriteria Decision Making u Decision.
Multi-Criteria Decision Making by: Mehrdad ghafoori Saber seyyed ali
Chapter 9 - Multicriteria Decision Making 1 Chapter 9 Multicriteria Decision Making Introduction to Management Science 8th Edition by Bernard W. Taylor.
A Hybrid Approach to QoS Evaluation Danilo Ardagna Politecnico di Milano Marco Comerio, Flavio De Paoli, Simone Grega Università degli Studi Milano Bicocca.
The Fundamentals: Algorithms, the Integers & Matrices.
Multi-Criteria Decision Making
BUSINESS PERFORMANCE MANAGEMENT
Optimizing Pheromone Modification for Dynamic Ant Algorithms Ryan Ward TJHSST Computer Systems Lab 2006/2007 Testing To test the relative effectiveness.
Maximizing value and Minimizing base on Fuzzy TOPSIS model
Analyzing the Problem (SAW, WP, TOPSIS) Y. İlker TOPCU, Ph.D twitter.com/yitopcu.
A Virtual Network Topology Security Assessment Process Presented by Rich Goyette 12/12/20151.
Exercises Decision Trees In decision tree learning, the information gain criterion helps us select the best attribute to split the data at every node.
A Simulation-Based Study of Overlay Routing Performance CS 268 Course Project Andrey Ermolinskiy, Hovig Bayandorian, Daniel Chen.
Custom Computing Machines for the Set Covering Problem Paper Written By: Christian Plessl and Marco Platzner Swiss Federal Institute of Technology, 2002.
A stochastic scheduling algorithm for precedence constrained tasks on Grid Future Generation Computer Systems (2011) Xiaoyong Tang, Kenli Li, Guiping Liao,
CLUSTER ANALYSIS. Cluster Analysis  Cluster analysis is a major technique for classifying a ‘mountain’ of information into manageable meaningful piles.
Semi-Supervised Clustering
Market Architectures Integrating Ancillary Services from Distributed Energy Resources Olivier Devolder Head of Energy Group N-SIDE.
Basic Project Scheduling
Improving and Generalizing Chord
S-Chord: Using Symmetry to Improve Lookup Efficiency in Chord
Basic Project Scheduling
Optimal marketing strategy: A decision-making with ANP and TOPSIS
B. Jayalakshmi and Alok Singh 2015
Adaptive Cloud Computing Based Services for Mobile Users
Computer Science cpsc322, Lecture 14
Jianping Fan Dept of CS UNC-Charlotte
CARP: Compression Aware Replacement Policies
Power Efficient Monitoring Management In Sensor Networks
Announcements Homework 3 due today (grace period through Friday)
Transportation, Assignment and Network Models
Chapter 6 Indexes, Scales, And Typologies
DATA MINING LECTURE 10 Classification k-nearest neighbor classifier
Boltzmann Machine (BM) (§6.4)
IME634: Management Decision Analysis
IME634: Management Decision Analysis
Conjoint analysis.
Dynamic Programming General Idea
Kostas Kolomvatsos, Christos Anagnostopoulos
Presentation transcript:

Presented by Rich Goyette Using AHP/TOPSIS with Cost and Robustness Criteria for Virtual Network Node Assignment Rich Goyette Presented by Rich Goyette 22/09/2018

Overview Virtual Networking Context; Motivation; InP Selection Criteria; Using AHP/TOPSIS to Rank InPs Simulation Results Conclusions Future Work 22/09/2018

4Ward Virtual Networking Service Provider (SP) Logical Plane Physical Plane Requirements Virtual Network Provider (VNP) Infrastructure Provider 1 (InP 1) Provider 2 (InP 2) Provider 3 (InP 3) Attribute Search and Comparison 22/09/2018

Motivation: Choosing InPs 1 2 3 4 InP 4 1 2 3 InP 2 3 1 2 4 5 2 3 5 2 3 4 5 MapQuest Who gets the SP’s Business? 22/09/2018

InP Selection Criteria We select the best VNet based on: Cost (less is better) Robustness (more is better) Robustness: the product of Security and Assurance Value of an InP’s offered VNet: VAS and VSEC can be computed using attributes reported by each InP... 22/09/2018

InP Selection Criteria Preference Model based on security relevant attributes of the InP. Weight of each dimension of security (FIPS 199). 22/09/2018

InP Selection Criteria In this presentation we consider nodes only. Therefore: We assume nC=0.5, nI=0.25, nA=0.25 We assume VAS is a random variable on [0,1] 22/09/2018

Overview of Selection Process 22/09/2018

Overview of Selection Process 22/09/2018

Overview of Selection Process 22/09/2018

Overview of Selection Process 22/09/2018

AHP/TOPSIS How do we select “best” when you must: Minimize some criteria; Maximize some criteria; Analytic Hierarchy Process Technique for Order Preference by Similarity to Ideal Solution 22/09/2018

InP Ranking with AHP/TOPSIS Bid 1 Bid 2 (Composite) 22/09/2018

InP Ranking with AHP/TOPSIS ❶ Construct Decision Matrix Bi -> one of k bids; Cj -> one of m criteria; fkm -> performance R C 22/09/2018

InP Ranking with AHP/TOPSIS ❷ Normalize the Decision Matrix R C 22/09/2018

InP Ranking with AHP/TOPSIS ❸ Weight the decision Matrix R C 22/09/2018

InP Ranking with AHP/TOPSIS ❹ Positive Ideal Solution -> Max security, min cost. R C PIS=[0.43 0.31] ❺ Negative Ideal Solution -> Min security, max cost. NIS=[0.26 0.40] R C ❻Separation -> Distance from PIS, NIS 22/09/2018

InP Ranking with AHP/TOPSIS ❼Closeness -> Smallest distance from best, largest distance from worst. Choose Bid 2 even though it costs more! 22/09/2018

InP Ranking with AHP/TOPSIS Composite Bid Evaluation... Who gets each disputed node? 22/09/2018

InP Ranking with AHP/TOPSIS Composite Bid Evaluation... ❶ Perform TOPSIS on each disputed node and select Best InP. ❷ Compute composite cost and robustness. Participation 1/5 1/5 3/5 22/09/2018

Simulation TOPSIS selection versus Greedy (cost only). 60X60 grid with 30 substrate nodes. Variable sized InPs with random robustness profiles distributed over substrate. 10,000 simulation runs per robustness weight point. 22/09/2018

Conclusions VNet robustness considers security and assurance dimensions; AHP/TOPSIS provides an efficient way of ranking InPs when criteria optimize in different directions: Robustness Cost AHP/TOPSIS can scale to other criteria: QoS Etc. 22/09/2018

Future Work Our work focussed on offering lowest compliant value of zero-delta security attributes (e.g. encryption key length). To what extent could aggressive business policies increase average security using these attributes? How many InPs in a composite bid? 22/09/2018

Questions 22/09/2018