John Doucette and Wayne D. Grover

Slides:

Advertisements

Similar presentations

CONFIDENTIAL © 2004 Procket Networks, Inc. All rights reserved. 4-Feb-14 The 21 st Century Intelligent Network Tony Li, Carl DeSousa.

Advertisements

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

Outline LP formulation of minimal cost flow problem

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.

W.D. Grover TRLabs & University of Alberta © Wayne D. Grover 2002, 2003 Mesh-restorable Network Design (2) E E Module 13.

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,

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

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.

Optimization for Network Planning Includes slide materials developed by Wayne D. Grover, John Doucette, Dave Morley © Wayne D. Grover 2002, 2003 E E 681.

PROFITABLE CONNECTION ASSIGNMENT IN ALL OPTICAL WDM NETWORKS VISHAL ANAND LANDER (Lab. for Advanced Network Design, Evaluation and Research) In collaboration.

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 Network Architectures (HAVANA): High-Availability Network Architectures (HAVANA): Comparative Study of Fully Pre-Cross- Connected Protection.

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.

W. D. Grover TRLabs & University of Alberta © Wayne D. Grover 2002, 2003 Graph theory and routing (initial background) E E Lecture 4.

E E Module 20 W. D. Grover TRLabs & University of Alberta © Wayne D. Grover 2002, 2003 Distributed Mesh Span Restoration.

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.

Globally Optimal Distributed Batch Reconfiguration for Hazard-free Dynamic Provisioning: How an Entire Network can “Think Globally and Act Locally” Wayne.

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 Algorithms for Bandwidth Efficient Multicast Routing in Multi-channel Multi-radio Wireless Mesh Networks Hoang Lan Nguyen and Uyen Trang Nguyen Presenter:

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.

1 Chapter-4: Network Flow Modeling & Optimization Deep Medhi and Karthik Ramasamy August © D. Medhi & K. Ramasamy, 2007.

1 Protection Mechanisms for Optical WDM Networks based on Wavelength Converter Multiplexing and Backup Path Relocation Techniques Sunil Gowda and Krishna.

Survivable Lightpath Routing: A New Approach to the Design of WDM – Based Networks Jared Strickland, Stephanie Kinsella, Travis Grosch, Sean Lunsford,

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.

Lightpath Restoration in WDM Optical Networks A Survey in IEEE Network Magazine Nov/Dec 2000.

Design of Capacitated Survivable Networks With a Single Facility Author : Hervé Kerivin, Dritan Nace, and Thi-Tuyet- Loan Pham R 張耀元， R

Cut Saturation for p-cycle Design Khalid Al-Snaie Electronics Dept., College of Technology Riyadh, Saudi Arabia Dale R. Thompson* Department of Computer.

Survivable Traffic Grooming with Differentiated End-to-End Availability Guarantees in WDM Mesh Networks Proceedings of the 13th IEEE Workshop on Local.

10/6/2003Kevin Su Traffic Grooming for Survivable WDM Networks – Shared Protection Kevin Su University of Texas at San Antonio.

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.

CS223 Advanced Data Structures and Algorithms 1 Maximum Flow Neil Tang 3/30/2010.

Algorithm for enumerating all recovery paths against single span of a network Sung-Hwan Park Jeong-Hee Ryou

1 An Arc-Path Model for OSPF Weight Setting Problem Dr.Jeffery Kennington Anusha Madhavan.

Efficient Resource Allocation for Wireless Multicast De-Nian Yang, Member, IEEE Ming-Syan Chen, Fellow, IEEE IEEE Transactions on Mobile Computing, April.

L11. Link-path formulation

Network Survivability, Reliability and Availability: Protection & Restoration Zilong Ye, Ph.D.

Globecom 2003 December 1-5, San Francisco, California

An Equal-Opportunity-Loss MPLS-Based Network Design Model

Presented by: Wayne D. Grover, (co-author with Diane Prisca Onguetou)

1.3 Modeling with exponentially many constr.

Routing and Logistics with TransCAD

L12. Network optimization

Span-restorable Mesh Network Design

Introduction to Network Design – Optimization Background

1.3 Modeling with exponentially many constr.

TRLabs & University of Alberta © Wayne D. Grover 2002, 2003, 2004

Span-restorable Mesh Network Design

Introduction to Survivable Rings

ECE 780 A2 Traffic Engineering and Network Design Fall Term 2008

Presentation transcript:

John Doucette and Wayne D. Grover Node-Inclusive Span Survivability in an Optical Mesh Transport Network John Doucette and Wayne D. Grover TRLabs and University of Alberta Edmonton, AB, Canada john.doucette@trlabs.ca, grover@trlabs.ca NFOEC 2003 Orlando, FL, USA 7-11 September 2003

Introduction Span Restoration End-to-End Path Restoration Localized and shorter restoration paths Faster and easier control of transmission effects Less capacity efficient No ability to recover from node failures End-to-End Path Restoration More capacity efficient Inherent ability to recover from node failures Operationally more complicated Many nodes involved, and restoration paths are lengthy Greater average delay Can we modify span restoration to protect node failures? Will this combine benefits of span and path restoration?

Node-Inclusive Span Survivability Concept Z X B C D Y custodial nodes Span Restoration A Z B C D X Y custodial node Path Restoration A Z X B C D Y custodial regions node-inclusive span entity NA NZ Node-Inclusive Span Survivability

NISS Operational Details B C D E X A B C D E X Span Failure Recovery: Node Failure Recovery: A B C D E X

NISS Operational Details(2) restoration route custodial node custodial regions A Z B Y X C O D X O D X custodial node restoration route

Integer Linear Programming Model Objective Function: Minimize cost of spare capacity Subject To: Restoration flow for all span failure scenarios Spare capacity allocation for span failures including stub release Restoration flow for all node failure scenarios Spare capacity allocation for node failures

Computational Aspects Test networks Group A: Nine small test networks (9-node 17-span to 11-node 26-span) Group B: Three families of networks of varying average nodal degree (15-node to 25-node) Traffic demands Group A: Various, as per networks’ sources Group B: Uniform random demands from 1 to 10 wavelengths Working capacity is shortest path routed Eligible route enumeration At least five eligible restoration routes per failure scenario ILP solution method Implemented in AMPL and solved using CPLEX 7.1 MIP 4-processor UltraSparc Sun Server, 450 MHz, 4 GB RAM Solved to within 0.01% of optimality Most problems solved in several seconds or minutes

Results Test Networks: Group A

Results (2) Test Networks: Group B 15-node family

Results (3) Test Networks: Group B 20-node family

Results (4) Test Networks: Group B 25-node family

Concluding Remarks Node failure protection is inherent and we can explicitly guarantee it Spare capacity requirements are good significantly below span restoration approaching path restoration (within 0% to 10%) Easily amenable to dynamic service provisioning working capacity envelope can apply Localized restoration paths make operational aspects much easier than path restoration