Understand p-Cycles, Enhanced Rings, and Oriented Cycle Covers Wayne D. Grover TRLabs and University of Alberta TRLabs and University of Alberta Edmonton,

Slides:



Advertisements
Similar presentations
Generalized Multiprotocol Label Switching: An Overview of Signaling Enhancements and Recovery Techniques IEEE Communications Magazine July 2001.
Advertisements

Sigma Xi Guest Lecture February 27, 2002 Survivable Networks: Protecting the Internet and phones from “backhoe-fades” and other hazards Wayne D. Grover.
Copyright © Wayne D. Grover 2000 EE 681 Fall 2000 Lecture 14 Mesh-restorable Network Design (1) Wayne D. Grover, TRLabs / University of Alberta October.
TX- 1 Faculty ALTTC, Ghaziabad Survivability Of SDH Network By: TX-I Faculty ALTTC, Ghaziabad.
An Efficient Strategy for Wavelength Conversion in WDM p-Cycle Networks Dominic A. Schupke, Matthias C. Scheffel Wayne.
1 EL736 Communications Networks II: Design and Algorithms Class3: Network Design Modeling Yong Liu 09/19/2007.
1 Wide-Sense Nonblocking Multicast in a Class of Regular Optical Networks From: C. Zhou and Y. Yang, IEEE Transactions on communications, vol. 50, No.
Chapter 4 Circuit-Switching Networks
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.
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,
P-Cycles, Ring-Mesh Hybrids and “Ring-Mining:” Options for New and Evolving Optical Networks Wayne D. Grover TRLabs and University of.
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.
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 Network Architectures (HAVANA): High-Availability Network Architectures (HAVANA): Comparative Study of Fully Pre-Cross- Connected Protection.
IP layer restoration and network planning based on virtual protection cycles 2000 IEEE Journal on Selected Areas in Communications Reporter: Jyun-Yong.
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.
E E Module 13 © Wayne D. Grover 2002, p-Cycles Jens Myrup Pedersen Aalborg University © Wayne D. Grover 2002, 2003 E E Module 13 ( Version.
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.
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.
Finding Protection Cycles in DWDM Networks 2002 IEEE ICC on Volume 5, 28 April-2 May Page(s): Reporter: Jyun-Yong Du.
© 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.
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.
Background on Reliability and Availability Slides prepared by Wayne D. Grover and Matthieu Clouqueur TRLabs & University of Alberta © Wayne D. Grover 2002,
TTM1 – 2013: Core networks and Optical Circuit Switching (OCS)
Fiber-Optic Network Architectures. OSI & Layer Model This Course.
SONET Survivability Mechanisms CSC/ECE 772: Survivable Networks Spring, 2009, Rudra Dutta.
SMUCSE 8344 Protection & Restoration of Optical Networks.
Load Balancing in Protection Switching of Optical Networks Hongkyu Jeong, Gyu-Myoung Lee Information and Communications Univ. (ICU) Student ID : ,
E E 681 Fall Lecture 23 Course Wrap-up & Challenges for Future Optical Networking Matthieu Clouqueur TR Labs & University of Alberta.
Multi-layered Optical Network Security
Robust Designs for WDM Routing and Provisioning Jeff Kennington & Eli Olinick Southern Methodist University Augustyn Ortynski & Gheorghe Spiride Nortel.
1 Multicasting in a Class of Multicast-Capable WDM Networks From: Y. Wang and Y. Yang, Journal of Lightwave Technology, vol. 20, No. 3, Mar From:
Cut Saturation for p-cycle Design Khalid Al-Snaie Electronics Dept., College of Technology Riyadh, Saudi Arabia Dale R. Thompson* Department of Computer.
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.
(Slide set by Norvald Stol/Steinar Bjørnstad
Optical Networking University of Southern Queensland.
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 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.
A study of provision of protecting capability after link failure in WDM networks 在 WDM 網路下以 FIPP 保護環連續供給保護能力之研究 作 者 : 丁德榮 (Der-Rong Din) 賴薪吉 (Hsin-Chi.
Cycle-Oriented Distributed Preconfiguration: Ring-like Speed with Mesh-like Capacity for Self-planning Network Restoration Wayne D.Grover, Demetrios Stamatelakis.
John Doucette and Wayne D. Grover
Globecom 2003 December 1-5, San Francisco, California
Presented by: Wayne D. Grover, (co-author with Diane Prisca Onguetou)
Network Survivability
Graph theory and routing: Background for Network Design
Optical Layer Protection Schemes
The University of Adelaide, School of Computer Science
TRLabs & University of Alberta
Span-restorable Mesh Network Design
Design of Networks based on multiple rings
Introduction to Survivable Rings
Presentation transcript:

Understand p-Cycles, Enhanced Rings, and Oriented Cycle Covers Wayne D. Grover TRLabs and University of Alberta TRLabs and University of Alberta Edmonton, AB, Canada web site for related papers etc: web site for related papers etc: ICOCN 2002, November 11-14, Singapore

Wayne D. Grover ICOCN ‘02 Singapore 2 Outline What are p- Cycles ? –Why do we say they offer “mesh-efficiency with ring-speed ?” Why are p-cycles so efficient ? Comparison to rings and “enhanced rings” Comparison to oriented cycle-covering techniques

Wayne D. Grover ICOCN ‘02 Singapore 3 The context The domain for all that follows is the problem of network protection at the transport capacity layer. i.e…. –Layer 3 inter-router lightwave channels –OBS-service layer working channels –Direct transport lighpaths –any other services or layers employing lightwave channels or paths All these sum to produce a certain number of working lightwave channels on each span Philosophy: Protect the working capacity directly and it doesn’t matter what the service type is

Rings... Fast, but not capacity - efficient

Wayne D. Grover ICOCN ‘02 Singapore 5 Two main types of “survivable ring”....(1) UPSR Unidirectional Path-switched Ring...Principle of operation

Wayne D. Grover ICOCN ‘02 Singapore 6 Protection fibre Working fibre  UPSR Animation... Tail-end Switch

Wayne D. Grover ICOCN ‘02 Singapore 7 UPSR (OPPR)...line capacity requirement Consider a bi-directional demand quantity between nodes A, B: d A,B. - A to B may go on the short route - then B to A must go around the longer route Thus, every (bi-directional) demand pair circumnavigates the entire ring. Hence in any cross section of the ring, we would find one unidirectional instance of every demand flow between nodes of the ring. Therefore, the line capacity of the UPSR must be: A D E B C A -> B B -> A “ The UPSR must have a line rate (capacity) greater (or equal to) the sum of all the (bi-directional) demand quantities between nodes of the ring. “

Wayne D. Grover ICOCN ‘02 Singapore 8 Protection fibres Working fibres Loop-back  (4 fiber) BLSR…(or OPSR)

Wayne D. Grover ICOCN ‘02 Singapore 9 BLSR …(OPSR) line capacity requirement both directions of a bi-directional demand can follow the short (or long) route between nodes “Bandwidth reuse” The line capacity of the BLSR must be: A D E B C A -> B B -> A “ The BLSR must have a line rate (capacity) greater (or equal to)the largest sum of demands routed over any one span of the ring. “

Wayne D. Grover ICOCN ‘02 Singapore 10 A particular issue in multi-ring network design... Ring 8 Ring 7 Ring 6 Example of 3 (of 7) rings from an optimal design for network shown Ring span overlaps Ideally, BLSR-based networks would be 100% redundant. Span overlaps and load imbalances mean in practice they can be up to 300% redundant

Mesh... Capacity - efficient, but (traditionally argued to be) slower, and have been hampered by DCS / OCX port costs

Wayne D. Grover ICOCN ‘02 Singapore 12 Concept of a span- (link-) restorable mesh network (28 nodes, 31 spans) 30% restoration 70% restoration 100% restoration span cut

Wayne D. Grover ICOCN ‘02 Singapore 13 Basics of Mesh-restorable networks (28 nodes, 31 spans) span cut 40% restoration 70% restoration 100% restoration

Wayne D. Grover ICOCN ‘02 Singapore 14 Basics of Mesh-restorable networks Spans where spare capacity was shared over the two failure scenarios ?..... This sharing efficiency increases with the degree of network connectivity “nodal degree”

Wayne D. Grover ICOCN ‘02 Singapore 15 Mesh networks require less capacity as graph connectivity increases ~ 3x factor in potential network capacity requirement

“ p-cycles “.. Fast, and capacity efficient.... Now we also have “ p-cycles “..

Wayne D. Grover ICOCN ‘02 Singapore 17 Background - ideas of mesh “preconfiguration”

Wayne D. Grover ICOCN ‘02 Singapore 18 Protection using p-cycles If span i fails, p-cycle j provides one unit of restoration capacity If span i fails, p-cycle j provides two units of restoration capacity i j i j

Wayne D. Grover ICOCN ‘02 Singapore 19 Optimal Spare capacity design with p-cycles

Wayne D. Grover ICOCN ‘02 Singapore 20 Optimal Spare capacity design - Typical Results “Excess Sparing” = Spare Capacity compared to Optimal Span- Restorable Mesh i.e., “mesh-like” capacity

Wayne D. Grover ICOCN ‘02 Singapore 21 Corroborating Results: COST239 European Study Network Pan European optical core network 11 nodes, 26 spans Average nodal degree = 4.7 Demand matrix –Distributed pattern –1 to 11 lightpaths per node pair (average = 3.2) 8 wavelengths per fiber wavelength channels can either be used for demand routing or connected into p-cycles for protection Copenhagen London Amsterdam Berlin Paris Brussels Luxembourg Prague Vienna Zurich Milan

Wayne D. Grover ICOCN ‘02 Singapore 22 Corroborating Results... See: Schupke et al… ICC 2002 Schupke found p-cycle WDM designs could have as little as 34% redundancy for 100% span restorability

Wayne D. Grover ICOCN ‘02 Singapore 23 Understanding why p-cycles are so efficient... 9 Spares cover 9 Workers 9 Spares cover 29 working on 19 spans Spare Working Coverage UPSR or BLSR p-Cycle …with same spare capacity “the clam-shell diagram”

Wayne D. Grover ICOCN ‘02 Singapore 24 Efficiency of p-Cycles (Logical) Redundancy = 2 * no. of straddling spans + 1* no. on-cycle spans no. spans on cycle 7 spans on-cycle, 2 straddlers : 7 / ( 7 + 2*2) = Example: Limiting case: p-cycle redundancy = N / ( N 2 - 2N)

Wayne D. Grover ICOCN ‘02 Singapore 25 The Unique Position p-Cycles Occupy Redundancy Speed “50 ms” 100 %50 %200 % Path rest, SBPP Span (link) rest. UPSR 200 ms p -cycles: BLSR speed mesh efficiency BLSR

Wayne D. Grover ICOCN ‘02 Singapore 26 ADM-like nodal device for p-cycle networking

Wayne D. Grover ICOCN ‘02 Singapore 27 Summary of Important Features of p-Cycles Working paths go via shortest routes over the graph p-Cycles are formed only in the spare capacity Can be either OXC-based or on ADM-like nodal devices a unit-capacity p-cycle protects: –one unit of working capacity for “on cycle” failures –two units of working capacity for “straddling” span failures Straddling spans: –there may be up to N(N-1)/2 -N straddling span relationships –straddling spans each bear two working channels and zero spare Only two nodes do any real-time switching for restoration –protection capacity is fully preconnected –switching actions are known prior to failure

..and how they differ from p-cycles Another recent development: --> “Enhanced Rings”

Wayne D. Grover ICOCN ‘02 Singapore 29 To understand “enhanced rings..”consider If the fill level of the two “working fibers” at the span overlap is 50% each then the overall LA- SLC arrangement is 300% redundant ! i.e., (total protection + unused working) _________________________ used working

Wayne D. Grover ICOCN ‘02 Singapore 30 “Enhanced” rings... Idea is to allow the two “facing” rings to share switched access to a single common protection span. So, the cross-sectional view becomes:c Now, redundancy = 2 / 1 = 200%

Wayne D. Grover ICOCN ‘02 Singapore 31 Is an enhanced ring the same as a p-cycle ?... No, because there is still a requirement for at least a matching amount of working and protection capacity on every span. In other words protection is still only provided and used in the “on- cycle” ring-like type of protection reaction. In contrast if the same problem is addressed with p-cycles, the troublesome span can be treated as: Or... no protection fibers at all on straddling span: redundancy = 1 / 1 = 100% no need to equip two working fibers if load does not require protection: redundancy ~ 0%

Oriented cycle double-covers Another recent approach to reduce undesirable span overlaps in ring-based network design...

Wayne D. Grover ICOCN ‘02 Singapore 33 Bi-directional Cycle Covers Even-degree nodeOdd degree node Consider the problem of “covering” all spans at a node with conventional bi-directional rings, without causing a span overlap... At an even degree node… there is no problem

Wayne D. Grover ICOCN ‘02 Singapore 34 Bi-directional Cycle Covers Even-degree nodeOdd degree node Now consider the same problem of covering at an odd-degree nodec At an odd degree node… no bi-directional ring cover exists that does not involve a span overlap

Wayne D. Grover ICOCN ‘02 Singapore 35 But with Unidirectional (Oriented) Cycle Covers Even-degree nodeOdd degree node …you can always cover both even and odd nodes without the equivalent of a ring span overlap... examples of undirectional ring covers... Equivalent to the bidirectional cover The unidirectional ring cover avoids any double-coverage ! (A mirror image set provides bidirectional W,P)

Wayne D. Grover ICOCN ‘02 Singapore 36 So are Oriented Cycle Covers the same as p-cycles ? No…because they still only protect in an on-cycle way. The result is to get to ring-protection at exactly the 100% redundancy lower limit. In an optimum oriented cycle cover every span will have exactly matching working and protection fibers. P-cycles involve spans that have 2 working and zero protection fibers, which will never be found in an oriented cycle cover.

Wayne D. Grover ICOCN ‘02 Singapore 37 Summary p-Cycles offer a promising new option for efficient realization of network protection –are preconfigured structures –use simple BLSR-like realtime switching –but are mesh-like in capacity efficiency Other recent advances can be superficially confused with p-cycles: –enhanced rings reduce ring network redundancy by sharing protection capacity between adjacent rings –oriented cycle (double) covers adopt a undirectional graph cycle- covering approach to avoid span overlaps Neither involves straddling spans; spans with working but no spare capacity –Both aim to approach their lower limits of 100% redundancy from well above 100% –p-cycles are well below 100% redundancy