Mesh Restorable Networks with Complete Dual Failure Restorability and with Selectvely Enhanced Dual-Failure Restorability Properties Matthieu Clouqueur,

Slides:



Advertisements
Similar presentations
Network Protection and Restoration Session 5 - Optical/IP Network OAM & Protection and Restoration Presented by: Malcolm Betts Date:
Advertisements

Capacity of wireless ad-hoc networks By Kumar Manvendra October 31,2002.
Winter 2004 UCSC CMPE252B1 CMPE 257: Wireless and Mobile Networking SET 3f: Medium Access Control Protocols.
Copyright © Wayne D. Grover 2000 EE 681 Fall 2000 Lecture 14 Mesh-restorable Network Design (1) Wayne D. Grover, TRLabs / University of Alberta October.
An Efficient Strategy for Wavelength Conversion in WDM p-Cycle Networks Dominic A. Schupke, Matthias C. Scheffel Wayne.
Infocom 2003 An Approach to Alleviate Link Overload as Observed on an IP Backbone Tuesday, April 1 st Infocom 2003 Sundar Iyer 1,2, Supratik Bhattacharrya.
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-
W.D. Grover TRLabs & University of Alberta © Wayne D. Grover 2002, 2003 Mesh-restorable Network Design (2) E E Module 13.
Introduction to rings: ring types, ring sizing and ring loading W. D. Grover TRLabs & University of Alberta © Wayne D. Grover 2002, 2003 E E Module.
Benefits of p-Cycles in a Mixed Protection and Restoration Approach DRCN Benefits of p-Cycles in a Mixed Protection and Restoration Approach François.
Resolving a Question about Span Restoration: Do Loopbacks Involve a Capacity Penalty? Wayne D. Grover TRLabs and Dept. of Electrical and Computer Engineering,
Jan 13, 2006Lahore University of Management Sciences1 Protection Routing in an MPLS Network using Bandwidth Sharing with Primary Paths Zartash Afzal Uzmi.
Capacity Design Studies of Span-Restorable Mesh Transport Networks With Shared-Risk Link Group (SRLG) Effects John Doucette, Wayne D. Grover
P-Cycle Network Design: from Fewest in Number to Smallest in Size Diane P. OnguetouWayne D. Grover Diane P. Onguetou and Wayne D. Grover TRLabs and ECE,
Quantitative Comparison of End-to-End Availability of Service Paths in Ring and Mesh- Restorable Networks Matthieu Clouqueur, Wayne D. Grover
Understand p-Cycles, Enhanced Rings, and Oriented Cycle Covers Wayne D. Grover TRLabs and University of Alberta TRLabs and University of Alberta Edmonton,
BROADNETS 2004 San José, California, USA October 25-29, 2004 p-Cycle Network Design with Hop Limits and Circumference Limits Adil Kodian, Anthony Sack,
Capacity Comparison of Mesh Network Restoration and Protection Schemes Under Varying Graph Connectivity John Doucette Wayne D. Grover TRLabs and University.
Detecting Network Intrusions via Sampling : A Game Theoretic Approach Presented By: Matt Vidal Murali Kodialam T.V. Lakshman July 22, 2003 Bell Labs, Lucent.
Factors Affecting the Efficiency of Demand-wise Shared Protection Brian Forst, Wayne D. Grover Contact: Electrical and.
C O R P O R A T E T E C H N O L O G Y Strategies for Enhanced Dual Failure Restorability with Static or Reconfigurable p-Cycle Networks International Conference.
TRLabs Confidential SmartBoard Presentation May 29 May 29 th 2003, SmartBoard Presentation NFOEC-2003Sep 11, 2003 Ring Mining to p-Cycles as a Target Architecture.
Effects of TSI/TSA (or Wavelength Conversion) on Ring Loading E E Module 8 W. D. Grover TRLabs & University of Alberta © Wayne D. Grover 2002, 2003.
Optimization for Network Planning Includes slide materials developed by Wayne D. Grover, John Doucette, Dave Morley © Wayne D. Grover 2002, 2003 E E 681.
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.
Exploiting Forcer Structure to Serve Uncertain Demands and Minimize Redundancy of p-Cycle Networks Gangxiang Shen & Wayne D. Grover TRLabs and University.
Mesh Restorable Networks with Multiple Quality of Protection Classes Wayne D. Grover, Matthieu Clouqueur TRLabs and.
Jerry Chou and Bill Lin University of California, San Diego
High availability survivable networks Wayne D. Grover, Anthony Sack 9 October 2007 High Availability Survivable Networks: When is Reducing MTTR Better.
High-Availability Network Architectures (HAVANA): High-Availability Network Architectures (HAVANA): Comparative Study of Fully Pre-Cross- Connected Protection.
EE 685 presentation Optimization Flow Control, I: Basic Algorithm and Convergence By Steven Low and David Lapsley Asynchronous Distributed Algorithm Proof.
Span-restorable Mesh Network Design (1) W. D. Grover TRLabs & University of Alberta © Wayne D. Grover 2002, 2003 E E Module 11 ( Version for book.
Routing algorithms, all distinct routes, ksp, max-flow, and network flow LPs W. D. Grover TRLabs & University of Alberta © Wayne D. Grover 2002, 2003 E.
OFC 2004, Los Angeles, CA Restorable Mesh Network Design under Demand Uncertainty: Toward “Future Proofed” Transport Investments Dion Leung, Wayne Grover.
Capacity Requirements for Network Recovery from Node Failure with Dynamic Path Restoration Gangxiang Shen and Wayne D. Grover TRLabs and University of.
E E Module 20 W. D. Grover TRLabs & University of Alberta © Wayne D. Grover 2002, 2003 Distributed Mesh Span Restoration.
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.
Algorithmic Approaches for Efficient Enumeration of Candidate p-Cycles and Capacitated p-Cycle Network Design John Doucette 1,2, Donna He 3, Wayne D. Grover.
University of Alberta ECE Department Network Systems Gangxiang Shen, Wayne D. Grover Extending the p-Cycle Concept to Path-Segment Protection Gangxiang.
E E Module 16 Path-oriented Survivable Mesh Networks W.D. Grover TRLabs & University of Alberta © Wayne D. Grover 2002, 2003.
© Rui Wang Cycle-Oriented Distributed Preconfiguration Ring-like Speed with Mesh-like Capacity for Self-planning Network Restoration 1 Sep Rui Wang.
Advances in Optical Network Design with p-Cycles: Joint optimization and pre-selection of candidate p-cycles (work in progress) Wayne D. Grover, John Doucette.
1 A Topology Control Approach to Using Directional Antennas in Wireless Mesh Networks Umesh Kumar, Himanshu Gupta and Samir R. Das Department of Computer.
1 EL736 Communications Networks II: Design and Algorithms Class11: Multi-Hour and Multi-Layer Network Design 12/05/2007.
Copyright © Wayne D. Grover 2000 EE 681 Fall 2000 Lecture 15 Mesh-restorable Network Design (2) W. D. Grover, October 26, 2000 copyright © Wayne D. Grover.
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.
Background on Reliability and Availability Slides prepared by Wayne D. Grover and Matthieu Clouqueur TRLabs & University of Alberta © Wayne D. Grover 2002,
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.
Network Survivability Against Region Failure Signal Processing, Communications and Computing (ICSPCC), 2011 IEEE International Conference on Ran Li, Xiaoliang.
E E 681 Fall Lecture 23 Course Wrap-up & Challenges for Future Optical Networking Matthieu Clouqueur TR Labs & University of Alberta.
EE 685 presentation Optimization Flow Control, I: Basic Algorithm and Convergence By Steven Low and David Lapsley.
June 4, 2003EE384Y1 Demand Based Rate Allocation Arpita Ghosh and James Mammen {arpitag, EE 384Y Project 4 th June, 2003.
1 P-Cycles. 2 What’s a p-Cycle? A preconfigured cycle formed out of the spare capacities in the network –A p-cycle uses one unit of spare capacity on.
Jennifer Rexford Fall 2014 (TTh 3:00-4:20 in CS 105) COS 561: Advanced Computer Networks TCP.
1 Why Optical Layer Protection? Optical layer provides lightpath services to its client layers (e.g., SONET, IP, ATM) Protection mechanisms exist in the.
1 EL736 Communications Networks II: Design and Algorithms Class7: Location and Topological Design Yong Liu 10/24/2007.
Architecture and Algorithms for an IEEE 802
John Doucette and Wayne D. Grover
Globecom 2003 December 1-5, San Francisco, California
ENGM 535 Optimization Networks
Presented by: Wayne D. Grover, (co-author with Diane Prisca Onguetou)
Network Survivability
1.3 Modeling with exponentially many constr.
Graph theory and routing: Background for Network Design
Span-restorable Mesh Network Design
TRLabs & University of Alberta © Wayne D. Grover 2002, 2003, 2004
Span-restorable Mesh Network Design
Design of Networks based on multiple rings
Introduction to Survivable Rings
Presentation transcript:

Mesh Restorable Networks with Complete Dual Failure Restorability and with Selectvely Enhanced Dual-Failure Restorability Properties Matthieu Clouqueur, Wayne D. Grover (presenter) TRLabs and University of Alberta Edmonton, AB, Canada web site for other related papers: OptiComm 2002 Boston, MA, USA 30/July/2002

Matthieu Clouqueur and Wayne D. Grover OptiComm Boston, MA, July Outline Background on Dual Failure Restorability Ideas and Motivations Research Methods Experimental Results Conclusions and Impacts

Matthieu Clouqueur and Wayne D. Grover OptiComm Boston, MA, July Dual Failures - Really ? Not as “academic” a consideration as we first thought: Sheer fiber route miles –Hermes RailTel estimate of one one cable cut /4 days Span maintenance and upgrade effects –can be much like a first failure in network equivalent effects Span SRLG and nodal bypass effects –cause logical dual failures Availability of paths through single-failure restorable networks: –unavailability doesn’t just vanish... Becomes limited by dual failures

Matthieu Clouqueur and Wayne D. Grover OptiComm Boston, MA, July Background re: Dual Failure Restorability Prior work on dual failure restorability analysis of span-restorable mesh networks: (refs: DRCN 01, JSAC 02) –concept of “first failure protection, second failure restoration” (pre-planned reaction) (adaptive reaction) –method for dual failure restorability analysis Some key findings: –1) Span restorable (or “link-protected”) mesh networks designed for R1 = 100%, give very high average R2 values as a side-effect ! –2) Service path availability has far more to do with restorability to dual failures, not the speed of response to a single failure –and …3) Explicit design for R2=100% is very capacity- expensive

Matthieu Clouqueur and Wayne D. Grover OptiComm Boston, MA, July Background: Determination of “R2” Case 1: Two failures but no spatial interactions Case 2: Two failures and spatial interactions (competition for spare capacity) Case 3: Two failures with second failure hitting the first restoration pathset Case 4: Two failures isolating a degree-2 node  no outage  may be outage  certain outage  may be outage -> Use computer emulation of all dual failure pairs to analyze R2

Matthieu Clouqueur and Wayne D. Grover OptiComm Boston, MA, July Prior Finding of High Dual-failure Restorability in Networks Designed for Single Failure Protection / Restoration % R 1 (Single failure restorability) R 2 (Dual failure restorability) Between 50 % and 99 % R2(i j) on individual scenarios Non-modular environment Modular Environment Static behavior0.53 to to 0.83 First-failure adaptive0.55 to to 0.91 Fully-adaptive0.55 to to 0.99 R 2 Results for 5 test networks : 70 % to 90 % network average R2

Matthieu Clouqueur and Wayne D. Grover OptiComm Boston, MA, July Research Questions Is it possible to enhance the dual span-failure restorability of an R1=1 network design: –purely by a redistribution of the spare capacity ? –to maximize R2 subject to a given budget limit ? Can we structure or allocate the finite R2 levels that are obtained to support a super-high availability service class ? gold silver bronze (economy) Existing QoP paradigm new Dual-failure restorable service class “Platinum service class” = assured dual- failure restorability

Matthieu Clouqueur and Wayne D. Grover OptiComm Boston, MA, July Three Design Models : Dual Failure Minimum Capacity (DFMC): Finds the minimum capacity assignment for full restorability to dual-failures (R 2 =100%) Dual Failure Max Restorability (DFMR) Finds the spare capacity placement that maximizes the average restorability to dual-failures for a given spare capacity budget Multi-service Restorability Capacity Placement (MRCP) Finds the minimum capacity assignment and routing that serves demands of multiple service classes including R0 (best-effort), R1 and R2-assured restorability service classes Methods to Investigate these Questions

Matthieu Clouqueur and Wayne D. Grover OptiComm Boston, MA, July Complete Dual Failure Restorability at Minimum Capacity (DFMC) Minimize: Total Cost of Capacity Subject to: (1) All demands are routed (2) Working capacity supports (1) (3) Restoration flows for 100% span restoration in the presence of each other span failure (4) Spare capacity to support (3) Note: This is with spare capacity reuse / sharing across non- simultaneous failure scenarios implicit in all cases

Matthieu Clouqueur and Wayne D. Grover OptiComm Boston, MA, July Dual Failure Maximum Restorability at Given Capacity (DFMR) Minimize: Total No. of Un-restorable Working Channels over all dual failure scenarios subject to: (1) All demands are routed (2) Working capacity supports (1) (3) Spare capacity less than an allowed Budget (4) Restoration flows as feasible under (4) for all span failures in the presence of each other span failure

Matthieu Clouqueur and Wayne D. Grover OptiComm Boston, MA, July Multi-service Restorability Design at Minimum Capacity (MRCP) Define: “R1”, “R2” (and also “R0”)-restorable service demand matrices Minimize: Total Capacity subject to: (1) All demands are routed, (2) Working capacity supports (1) (3) Restoration flows for all dual span failure scenarios for “R2” demands (4) Restoration flows for all single span failures for all “R1” demands (5) Spare capacity to support (3) and (4)

Matthieu Clouqueur and Wayne D. Grover OptiComm Boston, MA, July Results with DFMC (Cost for R2=1 by design) BENCHMARK: Cost of designing for full dual-failure restorability –Interpretation: Although average dual-failure restorability levels are quite high with a R 1 design, the capacity cost for making the network restorable to all dual failures is extremely high, (~ 3 x in spare capacity relative to R1=1 design) Large capacity increases are required to provide strictly 100% R2

Matthieu Clouqueur and Wayne D. Grover OptiComm Boston, MA, July Results with DFMR (Acheivable R2 vs. Cost) Trade-off between capacity and best acheivable dual-failure restorability: high capacity requirement as R2 =1 is approached (confirms DFMC results) Pure Redistribution of capacity “Budget amount”

Matthieu Clouqueur and Wayne D. Grover OptiComm Boston, MA, July Results with MRCP (MultiRestorability Service Class Design) Results of MRCP confirm that R 2 restorability can be guaranteed end to end for selected service paths: Up to about 20% of demands can be guaranteed R 2 =1 restorability for a small or negligible capacity increase

Matthieu Clouqueur and Wayne D. Grover OptiComm Boston, MA, July Concluding Insights and Comments Designing for 100% Dual-failure restorability is feasible but very expensive DFMR design method can maximize the network average dual failure restorability (R2) given any total budget for capacity. MRCP design can structure and enhance the R2 ability of an R1- designed network onto specific priority paths: –20 to 40% of all demands per O-D pair could be in this “platinum” service class at very little or no extra capacity cost. And note ! Such R2-restorable service paths will have availability that exceeds that of 1+1 APS...

Matthieu Clouqueur and Wayne D. Grover OptiComm Boston, MA, July A Key Insight: why priority services in a “mesh-restorable” will network get better than 1+1 APS availability 1+1 APS “1F-P 2F-R” mesh (for a priority path) Normal First failure -> protection Second failure -> outage R2(ij) =0 Normal First failure -> protection Second failure -> restoration ! (adaptive) no outage yet R2(ij) >0 “Takes a licking and keeps on ticking” :-)