Quantitative Comparison of End-to-End Availability of Service Paths in Ring and Mesh- Restorable Networks Matthieu Clouqueur, Wayne D. Grover

Slides:



Advertisements
Similar presentations
ITU-T Workshop on Security Seoul (Korea), May 2002 Telecommunication network reliability Dr. Chidung LAC.
Advertisements

Protection and Restoration in Optical Network
Protection Mechanisms for Optical WDM Networks based on Wavelength Converter Multiplexing and Backup Path Relocation Techniques Presented by: Brian V.
An Efficient Strategy for Wavelength Conversion in WDM p-Cycle Networks Dominic A. Schupke, Matthias C. Scheffel Wayne.
Bilal Gonen University of Alaska Anchorage Murat Yuksel University of Nevada, Reno.
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.
Markov Method of Availability Analysis, APS systems, and Availability Simulation Methods E E 681 Module 21 W. D. Grover TRLabs & University of Alberta.
A Practical Approach to QoS Routing for Wireless Networks Teresa Tung, Zhanfeng Jia, Jean Walrand WiOpt 2005—Riva Del Garda.
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.
Dynamic Routing and Wavelength Assignment Scheme for Protection against Node Failure Ying Wang1, Tee Hiang Cheng1,2 and Biswanath Mukherjee3 1School of.
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,
Mesh Restorable Networks with Complete Dual Failure Restorability and with Selectvely Enhanced Dual-Failure Restorability Properties Matthieu Clouqueur,
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.
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.
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.
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.
Capacity Requirements for Network Recovery from Node Failure with Dynamic Path Restoration Gangxiang Shen and Wayne D. Grover TRLabs and University of.
CHAPTER 6 Statistical Analysis of Experimental Data
A Cross Layer Approach for Power Heterogeneous Ad hoc Networks Vasudev Shah and Srikanth Krishnamurthy ICDCS 2005.
University of Alberta ECE Department Network Systems Gangxiang Shen, Wayne D. Grover Extending the p-Cycle Concept to Path-Segment Protection Gangxiang.
© 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.
NTNU Protection switching TTM1: Optical transport and access networks By Steinar Bjørnstad 2014.
International Technology Alliance In Network & Information Sciences International Technology Alliance In Network & Information Sciences 1 Cooperative Wireless.
A Combined Effort of OptiCal & LUMOS NETWORKS EE 290Q Lukas Chrostowski, Carlos Mateus, Fan Mo, Lixia Zhou.
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.
Helsinki 19 May 2006 Fine Protection of Data-Paths in Multi-Layer Networks Based on the GMPLS paradigm G.Oriolo, Università Tor Vergata, Roma joint work.
Background on Reliability and Availability Slides prepared by Wayne D. Grover and Matthieu Clouqueur TRLabs & University of Alberta © Wayne D. Grover 2002,
1 Protection Mechanisms for Optical WDM Networks based on Wavelength Converter Multiplexing and Backup Path Relocation Techniques Sunil Gowda and Krishna.
Budapest University of Technology and Economics Department of Telecommunications and Media Informatics Optimized QoS Protection of Ethernet Trees Tibor.
November 18, Traffic Grooming in Optical WDM Networks Presented by : Md. Shamsul Wazed University of Windsor.
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.
Presenter: Jonathan Murphy On Adaptive Routing in Wavelength-Routed Networks Authors: Ching-Fang Hsu Te-Lung Liu Nen-Fu Huang.
E E 681 Fall Lecture 23 Course Wrap-up & Challenges for Future Optical Networking Matthieu Clouqueur TR Labs & University of Alberta.
The Application of The Improved Hybrid Ant Colony Algorithm in Vehicle Routing Optimization Problem International Conference on Future Computer and Communication,
Cut Saturation for p-cycle Design Khalid Al-Snaie Electronics Dept., College of Technology Riyadh, Saudi Arabia Dale R. Thompson* Department of Computer.
Two-layer Restoration Scheme for IP over Optical Networks with MPLS Jia Ke, L. Mason, Q. Yang ICIS, School of EEE, Nanyang Technological University
Survivable Traffic Grooming with Differentiated End-to-End Availability Guarantees in WDM Mesh Networks Proceedings of the 13th IEEE Workshop on Local.
6 December On Selfish Routing in Internet-like Environments paper by Lili Qiu, Yang Richard Yang, Yin Zhang, Scott Shenker presentation by Ed Spitznagel.
10/6/2003Kevin Su Traffic Grooming for Survivable WDM Networks – Shared Protection Kevin Su University of Texas at San Antonio.
1 Presented by Sarbagya Buddhacharya. 2 Increasing bandwidth demand in telecommunication networks is satisfied by WDM networks. Dimensioning of WDM networks.
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.
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 Low Latency Multimedia Broadcast in Multi-Rate Wireless Meshes Chun Tung Chou, Archan Misra Proc. 1st IEEE Workshop on Wireless Mesh Networks (WIMESH),
1 Protection in SONET Path layer protection scheme: operate on individual connections Line layer protection scheme: operate on the entire set of connections.
Optimal Design of Survivable Mesh Networks Based on Line Switched WDM Self-Healing Rings IEEE/ACM Transactions on Networking, Vol 11, NO.3, June,2003 Andrea.
Optimization-based Cross-Layer Design in Networked Control Systems Jia Bai, Emeka P. Eyisi Yuan Xue and Xenofon D. Koutsoukos.
Performance Comparison of Ad Hoc Network Routing Protocols Presented by Venkata Suresh Tamminiedi Computer Science Department Georgia State University.
Improving OBS Efficiency Li, Shuo, Meiqian Wang. Eric W. M. Wong, Moshe Zukerman City University of Hong Kong 1.
John Doucette and Wayne D. Grover
Globecom 2003 December 1-5, San Francisco, California
Distributed Control Plane
Network Survivability
Optical Layer Protection Schemes
The University of Adelaide, School of Computer Science
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:

Quantitative Comparison of End-to-End Availability of Service Paths in Ring and Mesh- Restorable Networks Matthieu Clouqueur, Wayne D. Grover National Fiber Optic Engineers Conference - NFOEC 2003 Orlando, Florida, USA

Matthieu Clouqueur and Wayne D. Grover NFOEC Outline Motivation Goals of Study Survivability Schemes Models Description of Test Cases Sample Results Discussion of Results Conclusion

Matthieu Clouqueur and Wayne D. Grover NFOEC Motivation Rings are often associated with high availability because they provide high restoration speed. Mesh is often thought to provide lower availability associated with low capacity redundancy and slower restoration. We ask: Which really provides higher availability: ring or mesh ? How do ring and mesh compare in service path availability and in the range of availability levels they can offer ? In mesh, what would be the effects of affecting priorities to selected services ?

Matthieu Clouqueur and Wayne D. Grover NFOEC Goals and Methodology Provide a true “apples-to-apples” comparison of end-to-end service path availability in ring and mesh: –Ring and Mesh are compared on identical facilities graphs serving identical demands –Efficient capacity designs are used for both architectures –Exact survivability mechanisms are emulated –Both architectures experience identical failure sequences Comparison is based on: –Average path unavailability (versus path length) –Average number of outages experienced per year per service path (versus path length) –Statistical frequency of total path outage times per year

Matthieu Clouqueur and Wayne D. Grover NFOEC Simulation Numerical Details Statistics of Failures: –Mean time between failures (MTBF): 1 year on each span –Negative exponential distribution (Poisson process) Statistics of Repair: –Mean time to repair (MTTR): 12 hours –Negative exponential distribution

Matthieu Clouqueur and Wayne D. Grover NFOEC Main Assumptions of the Availability Analysis Previous work shows that what dominates service unavailability is: –Reconfiguration times (to single failures) –Single node-failures –Dual span-failures –Triple failures The present analysis is based on the effects of dual span-failures –The contribution of reconfiguration times is not taken into account. The analysis is based on restorability investigations performed on a per path basis for 7each particular failure scenario occurring in the simulation

Matthieu Clouqueur and Wayne D. Grover NFOEC Modelling Ring Survivability The Bi-directional Line Switched Ring (BLSR) model is assumed: Protection channels Working channels Loop-back Note: A dual fibre cut affecting a ring does not cause all service paths on the ring to experience outage  Detailed inspection is performed on a per path basis to identify paths affected by the dual failure. surviving path failed path

Matthieu Clouqueur and Wayne D. Grover NFOEC Modelling Mesh Survivability Adaptive mesh restoration behaviour is assumed: –Restoration paths for a failed span are dynamically searched within remaining spare capacity (not according to pre-plan) Note: Restoration of a failed span includes an effort to restore any spare capacity used on that span  A restoration path affected by a second failure may survive failed backup path is itself restored Restoration to a first failure can be based on a pre-plan. Second failure response is adaptive

Matthieu Clouqueur and Wayne D. Grover NFOEC Mesh Restoration with Priorities Capacity designs used are identical to normal single failure restorable designs (no additional capacity) A certain percentage of demands is given “Priority” status on each origin/destination node pair –The Priority service paths are considered first for restoration and will therefore have a higher dual-failure restorability and therefore a higher availability Three service mixes: 10/90, 30/70, 50/50 (% high P. / % low P.) Questions: –How much is the availability of Priority services improved? –How much is the availability of non-Priority services degraded?

Matthieu Clouqueur and Wayne D. Grover NFOEC Three test cases (32 nodes, 45 edges)(25 nodes, 50 edges) Hubbed Demand Matrix Gravity-based Demand Matrix net32-Anet32-B25n50s1 Topology Type of Demand Test case

Matthieu Clouqueur and Wayne D. Grover NFOEC Study Details Mesh: –Working paths are routed on shortest path –Minimal spare capacity placed by Integer Linear Programming Optimization* –Average working path length: net32-A: 5.5; net32-B: 2.2; 25n50s1: 2.8 Ring: –Ring designs using efficient methods developed in PhD work by D. Morley** –# of rings in design: net32-A & net-32B: 8 OC-48; 25n50s1: 19 OC-48 –Average number of spans/ring: net32-A & net32-B: 11; 25n50s1: 9.4 –Working paths routed by shortest ring-constrained routing * J. Doucette, W. D. Grover, “Influence of modularity and economy-of-scale effects on design of mesh-restorable DWDM networks,” IEEE JSAC, vol. 18, no. 10, October 2000, pp ** G. D. Morley, Analysis and Design of Ring-Based Networks, Ph.D. Thesis, University of Alberta, Spring and G. D. Morley, W. D. Grover, “Tabu search optimization of optical ring transport networks,” in Proceedings of IEEE GLOBECOM 2001, November 2001, vol. 4, pp

Matthieu Clouqueur and Wayne D. Grover NFOEC Statistical Considerations Results for each test case are based on series of 1000 one-year simulations Total of dual (or higher order) failures arising over 1000 trials: –Net32-A & Net32-B: 2619 –25n50s1: 3180 Average number of outage events per path being the basis for availability results: –Ring: 64.7 –Mesh: 45.9 This was shown to give good confidence levels on results: –E.g. for 25n50s1 test case, over 10 separate 1000 one-year trials, standard deviation of average unavailability U ave results was calculated to be 2.7 % of U ave

Matthieu Clouqueur and Wayne D. Grover NFOEC Comparative Results of Path Unavailability Path unavailability is significantly higher in the ring architecture, especially for longer paths (up to a factor 2 in the worst case) ~ 26 % chance of outage in a given year (worst case) ~ 17 % chance of outage in a given year (worst case) net32-B net32-A 25n50s1 Average working path lengths

Matthieu Clouqueur and Wayne D. Grover NFOEC Comparing Distributions of Outage Times Ring: 93.7 % of paths experience no outage in a year Mesh: 95.4 % of paths experience no outage in a year median ~ 6 hours Results for test case 25n50s1 median ~ 6 hours 90 th percentile 15 hours 90 th percentile 13.5 hours

Matthieu Clouqueur and Wayne D. Grover NFOEC Effects of Priorities in Mesh The effect of prioritizing in mesh is a considerable reduction of path unavailability for the Priority class. The non-Priority service class suffers only a small degradation of service availability. The availability of non-Priority services remains comparable or better than in ring Results for test case 25n50s1 A priority path in mesh can have a more than five times lower unavailability than in ring

Matthieu Clouqueur and Wayne D. Grover NFOEC Additional Insights from the Study The effect of priorities is a significant reduction of the probability of paths experiencing outage in a given year: –E.g. for 6-hop paths in the 25n50s1 test case, the probability of experiencing outage in a given year drops from 12% to 2% is the path is included in the 10% priority class (10/90 scheme). Experimental results show that the advantage of mesh over ring is greater in the highly connected topology –This is especially true for results of prioritized mesh and confirms the understanding that mesh benefits greatly from high network diversity Under the 10/90 service mix Priority services achieve the lowest unavailability while the availability of non-Priority services remains virtually unchanged

Matthieu Clouqueur and Wayne D. Grover NFOEC Conclusion Despite its lower capacity requirements, the mesh architecture achieves better availability than ring –The key is mesh’s better ability to withstand dual-failure states even with less redundancy than rings. With prioritization of services, high priority services can be offered very low unavailability (3 to 5 times less than with rings) while non-Priority service still enjoy comparable or better availability than with rings. Concluding comment: What matters most for high availability is not fast restoration to single failures but the ability to provide high restorability to dual failures. This minimizes the probability of MTTR-scale outages on service paths.