Models for Measuring and Hedging Risks in a Network Plan

Slides:



Advertisements
Similar presentations
Data and Computer Communications
Advertisements

Strategic Decisions (Part II)
Economic Risk Capital at Key: The Big Picture. Eric G. Falkenstein 4/14/99 2 Without a true equity allocation, net income information is ambiguous “What.
Topic 2. DECISION-MAKING TOOLS
Chapter 2 Inventory Management and Risk Pooling.
Data and Computer Communications Ninth Edition by William Stallings Chapter 12 – Routing in Switched Data Networks Data and Computer Communications, Ninth.
Operations Management
FINA 522: Project Finance and Risk Analysis Lecture 12 Updated: 19 May 2007.
E E Module 17 W. D. Grover TRLabs & University of Alberta © Wayne D. Grover 2002, 2003 ATM VP-based (or MPLS path) Restoration with Controlled Over-
Hanken Svenska handelshögskolan / Hanken School of Economics Customer Portfolios Customer Equity Helsinki Summer School 2009, Hanken Andreas.
Market Preferences and Process Selection (MAPPS): the Value of Perfect Flexibility Stephen Lawrence University of Colorado George Monahan University of.
December 20, 2004MPLS: TE and Restoration1 MPLS: Traffic Engineering and Restoration Routing Zartash Afzal Uzmi Computer Science and Engineering Lahore.
1 Cross-Layer Design for Wireless Communication Networks Ness B. Shroff Center for Wireless Systems and Applications (CWSA) School of Electrical and Computer.
Company Enterprise Risk Management & Stress Testing Case Study.
E E Module 18 M.H. Clouqueur and W. D. Grover TRLabs & University of Alberta © Wayne D. Grover 2002, 2003 Analysis of Path Availability in Span-Restorable.
OFC 2004, Los Angeles, CA Restorable Mesh Network Design under Demand Uncertainty: Toward “Future Proofed” Transport Investments Dion Leung, Wayne Grover.
Jennifer Rexford Princeton University MW 11:00am-12:20pm Wide-Area Traffic Management COS 597E: Software Defined Networking.
1 utdallas.edu/~metin SC Design Facility Location under Uncertainty Chapter 6.
SDN: Systemic Risks due to Dynamic Load Balancing Vladimir Marbukh IRTF SDN.
1 EL736 Communications Networks II: Design and Algorithms Class10: Restoration and Protection Design of Resilient Networks Yong Liu 11/28/2007.
Route Planning and Evaluation
Content : 1. Introduction 2. Traffic forecasting and traffic allocation ◦ 2.1. Traffic forecasting ◦ 2.2. Traffic allocation 3. Fleeting problems ◦ 3.1.
Flow Models and Optimal Routing. How can we evaluate the performance of a routing algorithm –quantify how well they do –use arrival rates at nodes and.
Operations Management
1 Capacity Planning under Uncertainty Capacity Planning under Uncertainty CHE: 5480 Economic Decision Making in the Process Industry Prof. Miguel Bagajewicz.
DaVinci: Dynamically Adaptive Virtual Networks for a Customized Internet Jennifer Rexford Princeton University With Jiayue He, Rui Zhang-Shen, Ying Li,
NOBEL WP5 Meeting Munich – 14 June 2005 WP5 Cost Study Group Author:Martin Wade (BT) Lead:Andrew Lord (BT) Relative Cost Analysis of Transparent & Opaque.
QoS-Aware In-Network Processing for Mission-Critical Wireless Cyber-Physical Systems Qiao Xiang Advisor: Hongwei Zhang Department of Computer Science Wayne.
1 Protection Mechanisms for Optical WDM Networks based on Wavelength Converter Multiplexing and Backup Path Relocation Techniques Sunil Gowda and Krishna.
Copyright © 2008 by The McGraw-Hill Companies, Inc. All rights reserved. McGraw-Hill/Irwin 12 Financial and Cost- Volume-Profit Models.
INVENTORY IS BAD. DIRECT FINANCIAL EFFECTS Pay money to get Place to Store Equipment to move DAMAGE - OBSOLESCENCE INCREASED CYCLE TIME Less flexibility.
AGSM 440 April 5 AnnouncementsAnnouncements HW#12 team peer review due today HW#12 team peer review due today Final draft of the Economic Analysis due.
Contents Introduction
Planning and Analysis Tools to Evaluate Distribution Automation Implementation and Benefits Anil Pahwa Kansas State University Power Systems Conference.
Budapest University of Technology and Economics Department of Telecommunications and Media Informatics Optimized QoS Protection of Ethernet Trees Tibor.
SMUCSE 8344 Protection & Restoration of Optical Networks.
Maximization of Network Survivability against Intelligent and Malicious Attacks (Cont’d) Presented by Erion Lin.
Network Survivability Against Region Failure Signal Processing, Communications and Computing (ICSPCC), 2011 IEEE International Conference on Ran Li, Xiaoliang.
The McGraw-Hill Companies, Inc. 2006McGraw-Hill/Irwin 12 Financial and Cost- Volume-Profit Models.
1 Chapter 6 –Inventory Management Policies Operations Management by R. Dan Reid & Nada R. Sanders 4th Edition © Wiley 2010.
1 Economic Benefits of Integrated Risk Products Lawrence A. Berger Swiss Re New Markets CAS Financial Risk Management Seminar Denver, CO, April 12, 1999.
1 Managing Flow Variability: Safety Inventory Operations Management Session 23: Newsvendor Model.
DaVinci: Dynamically Adaptive Virtual Networks for a Customized Internet Jiayue He, Rui Zhang-Shen, Ying Li, Cheng-Yen Lee, Jennifer Rexford, and Mung.
Some questions about multipath Damon Wischik, UCL Trilogy UCL.
Information Theory for Mobile Ad-Hoc Networks (ITMANET): The FLoWS Project Competitive Scheduling in Wireless Networks with Correlated Channel State Ozan.
CHAPTER 8 CAPACITY. THE CONCEPT Maximum rate of output for a process Inadequate capacity can lose customers and limit growth while excess capacity can.
Software Engineering1  Verification: The software should conform to its specification  Validation: The software should do what the user really requires.
1 An Arc-Path Model for OSPF Weight Setting Problem Dr.Jeffery Kennington Anusha Madhavan.
Network Flow Problems Example of Network Flow problems:
CHAPTER 13 INVENTORY MANAGEMENT. THE CONCEPTS Crucial for low profit margin, low cost strategy Determining appropriate inventory level by conflicting.
Survivability in IP over WDM networks YINGHUA YE and SUDHIR DIXIT Nokia Research Center, Burlington, Massachusetts.
FACILITIES PLANNING ISE310L SESSION 13 Chapter 14, February 19, 2016 Geza P. Bottlik Page 1 OUTLINE Questions? Quiz Stories or experiences? New Homework.
Bricolage A creation from what happened to be available during its formation. Click here for Hint bricolage or triage or resilience?
Black Swan An incident of extreme consequence, unexpected or considered highly improbable by forecasters and planners. Click here for Hint crisis or Black.
Network Planning Workshop with Tool Case Studies for the Arab Region – I.S. Session ITU-BDT Regional Network Planning Workshop Cairo – Egypt, 16.
Supplementary Chapter B Optimization Models with Uncertainty
Profitability Analysis
Erik Ela, Eamonn Lannoye, Bob Entriken, Aidan Tuohy
OUTLINE Questions, Comments? Quiz Go over Quiz Go over homework
OUTLINE Questions, Comments? Quiz Results Target Strategy:
OUTLINE Questions, Comments? Quiz Target Comments Go over homework
Project risk management
Switching Techniques In large networks there might be multiple paths linking sender and receiver. Information may be switched as it travels through various.
ISP and Egress Path Selection for Multihomed Networks
Evaluating Non-Leak Threats
Network Survivability
Chapter 12 Determining the Optimal Level of Product Availability
Sixth Power Plan Setting Conservation Targets and Implementation Strategies Jill Steiner, Snohomish Public Utility District Northwest Power and Conservation.
Data and Computer Communications
OUTLINE Questions, Comments? News? New homework Evaluating suppliers
Presentation transcript:

Models for Measuring and Hedging Risks in a Network Plan Steven Cosares Hofstra University Hempstead, New York 1

Robust Network Planning Design a network and place in sufficient link and node capacity to satisfy the expected demand for point-to-point connections in a cost-effective manner, while hedging against the prominent operating risks. 2 units Inter-connected links and nodes with switching capability 8 units

Planning Decisions Scheduling the expansion of link and node capacity during planning horizon Routes for pt-to-pt connections Timing / sizing of (equipment) purchases Technology decisions Adjustments to network topology

Demand Uncertainty Risk Demand may not arise as anticipated. Demand levels naturally fluctuate throughout the planning horizon – “Churn”. Prior data determines a distribution of potential values. Correlation / elasticity of demand for services across locations are hard to identify. Unexpected demands may not be served, resulting in a loss of potential revenue.

Connection Risk Some link or node (equipment) may fail during network operation, resulting in: Temporary disruption of some services Loss of customer revenue Financial penalties, lawsuits Exposure of customers to danger, e.g., loss of 911 service, home heat, electricity Potential defection of customers

Utilization Risk Cost of lost opportunity associated with: Over-estimating potential demand Purchasing/placing capacity too early Cost / Revenue uncertainty Providing traffic protection to customers not paying for it Dedicating protection capacity to unlikely or benign failure scenarios Address this risk to keep plan economical

Hedging Connection Risk If the network is 2-connected and has accessible extra capacity, then network is “Survivable”: demands can still be satisfied even if some link or node is rendered useless. A B C G E D 3 4 7 5 6 F 9 2 Working Routes 1 Protection Routes

Hedging Strategies Route Diversity: Split traffic over multiple (diverse) paths to satisfy demand for a pt-to-pt connection. (Low Cost; Low Effectiveness) Protection: Back-up paths with capacity to be used only during a network failure. May be dedicated to specific connections or to specific links. (High Cost; High Effectiveness) Restoration: Use smart switching to access available capacity to recover traffic lost to a network failure. (Cost and effectiveness dependent on traffic distribution at failure time and on the quality of capacity decisions)

“Infinite Severity” Model Connection Risk Assumptions: Any loss of traffic due to a link or node failure is unacceptable. The relative probability of the potential network failure events is irrelevant. Hedging Strategy: “100% Survivability” All of the network traffic can be recovered despite any link or node failure in the network.

Infinite Severity Model Providing 100% Survivability may be impossible or prohibitively expensive. Cost-benefit analyses are irrelevant. (Math Prog. Model: Min Cost Objective w/ Survivability Constraints) Some customers’ traffic may not warrant the expense of protection/restoration. Some failure scenarios are more likely / more severe than others.

Model Formulation Let z represent the capacity assigned to the links. Let x(k) represent the allocation of connection paths to satisfy demand k. Network capacity should be sufficient to accommodate all demands under normal conditions: Path-arc incidence matrix for connections satisfying k

Formulation For each potential network failure f: Let y(k,f) represent the use of some paths to recover some of demand k after failure f. Some working path assignments for demand k are lost. Unmet demand Modified path-arc incidence matrix for demand k during failure f Some network capacity is lost to the failure

Formulation Controlling the level of survivability: Objective function: 100% Survivability Constraint: Capacity expansion

Flexible Alternatives Objective: Effective use of capital Allow lower levels of Survivability Apply targeted survivability constraints Specific customers’ demand or failure scenarios Perform cost / benefit analyses for risk hedging Models for marginal cost of restoration capacity Valid (dollar-based) measures for connection risk Integrated models for hedging both demand uncertainty and connection risk

Lower Survivability Levels What does it mean if a network is 90% Survivable? At least 90% of the total traffic survives any failure. Each customer is guaranteed that at least 90% of their traffic survives any failure. In 90% of the possible failure scenarios, all of the traffic survives. The probability that any unit of traffic will be lost to some failure is less than 10%. The expected proportion of traffic to survive, over the possible failure events is 90%. For 100% all of these meanings are equivalent!

Pictorial Model – Demand k A: Average protection of demand k from potential failures B: Worst-case = Survivability guarantee for k C: Prob. that demand k is insulated from some random failure

The Severity of a Failure D: Proportion of total traffic surviving the failure. E: Minimum survivability guarantee provided to customers.

Modified Formulations Controlling the level of survivability: Through the objective function: and/or through the constraints: Capacity expansion cost Penalty for losing service Functions to set appropriate limits on loss

Modified Formulations Constraints on loss of demand k: Constraint on severity of failure f: These can be applied flexibly to specific demand/failures. (Area A in chart is 90%) (Length C in chart is 50%) (Area D in chart is 90%)

Costs/Benefits of Hedges Penalty function must capture (true) costs of disrupted connections – beyond revenue loss. The parameter λ allows planner to control tradeoff between survivability and expansion costs. Note: The MILP problem as formulated is quite large and complex

Integrated Models Restoration (protection) capacity also provide a hedge against demand uncertainty. Develop planning models that measure the combined effectiveness of hedging strategies Survivability measures when demand is uncertain Measuring the marginal costs associated with hedging capacity – which capacity is extra?! MILP formulation is even more complex!

Integrated Evaluations At least 90% survivability is provided (to the offered services) in every demand scenario. The average network survivability over the demand scenarios is at least 90%. In at least 90% of the demand scenarios there is 100% survivability (for the offered services). At least 90% of the demands are offered 100% survivability in all of the demand scenarios.

Hedging Uncertainty Risk If accessible capacity is placed throughout the network at sufficient levels, the network might accommodate a variety of potential demand scenarios. Deterministic Approach: Apply a solution model based on the expected pt-to-pt demand levels (or some higher percentile). Stochastic Programming Approach: Maximize some probabilistic profit function based on the service provided over a set of demand scenarios.

Simulation-based Approach For each demand scenario, determine a routing over the network topology. For each node / link, collect statistics about the capacity requirements, e.g., Capacity Prob. 50 5% 60 20% 70 50% 80 80% 90 95% 100 100% Percentage of scenarios in which the capacity is sufficient to accommodate all of the demands

Approach, cont’d Determine a capacity level: Revenue index + (Note similarity to “Newsvendor model”) Revenue index + shortage penalty = 10 * Cost index + overage penalty Note: Shortage penalty ratio would have to be set above 20 for the min-risk capacity to be the most profitable.