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

Slides:

Advertisements

Similar presentations

Optimization Problems in Optical Networks. Wavelength Division Multiplexing (WDM) Directed: Symmetric: Undirected: Optic Fiber.

Advertisements

Optical networks: Basics of WDM

Optimization Problems in Optical Networks. Wavelength Division Multiplexing (WDM) Directed: Symmetric: Optic Fiber.

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.

Chapter 4 Circuit-Switching Networks

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.

Lesson Title: Introduction to Cryptography Dale R. Thompson Computer Science and Computer Engineering Dept. University of Arkansas

Lesson Title: Threats to and by an RFID system Dale R. Thompson Computer Science and Computer Engineering Dept. University of Arkansas

TxRx W P SplitterSwitch (Working Fiber) (Protection Fiber) Traffic flow Linear Protection APS Fast protection; Switching is initiated and executed.

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,

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.

Exploiting Forcer Structure to Serve Uncertain Demands and Minimize Redundancy of p-Cycle Networks Gangxiang Shen & Wayne D. Grover TRLabs and University.

Multi-path Routing -Sridevi Bellary. Introduction Multipath routing is an alternative to single shortest path routing to distribute and alleviate congestion.

High-Availability Network Architectures (HAVANA): High-Availability Network Architectures (HAVANA): Comparative Study of Fully Pre-Cross- Connected Protection.

Chapter 11 Network Models. What You Need to Know For each of the three models: –What is the model? (what are given and what is to calculate) –What is.

Lesson Title: Electromagnetics and Antenna Overview Dale R. Thompson Computer Science and Computer Engineering Dept. University of Arkansas

Lesson Title: Singulation Dale R. Thompson Computer Science and Computer Engineering Dept. University of Arkansas 1 This material.

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.

The Research of Applying Random Early Blocking strategy to Dynamic Lightpath Routing National Yunlin University of Science & Technology.

Fast Failover for Control Traffic in Software-defined Networks Globecom 2012 Neda B. & Ying Z. Presented by: Szu-Ping Wang.

Lesson Title: Hacking RFID and other RF devices Dale R. Thompson Computer Science and Computer Engineering Dept. University of Arkansas

A Combined Effort of OptiCal & LUMOS NETWORKS EE 290Q Lukas Chrostowski, Carlos Mateus, Fan Mo, Lixia Zhou.

Shortest Route, Minimal Spanning Tree and Maximal Flow Models

and 6.855J The Capacity Scaling Algorithm.

Lesson Title: Fast Fourier Transform Overview Dale R. Thompson Computer Science and Computer Engineering Dept. University of Arkansas

Survivable Logical Topology Design in WDM Optical Ring Networks Hwajung Lee, Hongsik Choi, Suresh Subramaniam, and Hyeong-Ah Choi* The George Washington.

Lesson Title: RFID Frequency Bands Dale R. Thompson Computer Science and Computer Engineering Dept. University of Arkansas

Budapest University of Technology and Economics Department of Telecommunications and Media Informatics Optimized QoS Protection of Ethernet Trees Tibor.

Prof. Swarat Chaudhuri COMP 482: Design and Analysis of Algorithms Spring 2012 Lecture 10.

Minimum Routing Cost Spanning Trees Kun-Mao Chao ( 趙坤茂 ) Department of Computer Science and Information Engineering National Taiwan University, Taiwan.

SMUCSE 8344 Protection & Restoration of Optical Networks.

E E 681 Fall Lecture 23 Course Wrap-up & Challenges for Future Optical Networking Matthieu Clouqueur TR Labs & University of Alberta.

Lesson Title: RFID Stakeholders Dale R. Thompson Computer Science and Computer Engineering Dept. University of Arkansas 1.

Logical Topology Design

Lesson Title: EPCglobal and ISO/IEC Item Management Standards Dale R. Thompson Computer Science and Computer Engineering Dept. University of Arkansas

Lesson Title: Types of RFID Tags Dale R. Thompson Computer Science and Computer Engineering Dept. University of Arkansas 1.

InterConnection Network Topologies to Minimize graph diameter: Low Diameter Regular graphs and Physical Wire Length Constrained networks Nilesh Choudhury.

Lesson Title: Guidelines for Securing RFID Systems Dale R. Thompson Computer Science and Computer Engineering Dept. University of Arkansas

Lesson Title: EPCglobal Gen2 Tag Finite State Machine Dale R. Thompson and Jia Di Computer Science and Computer Engineering Dept. University of Arkansas.

Lesson Title: Social Implications of RFID Dale R. Thompson Computer Science and Computer Engineering Dept. University of Arkansas

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.

Lesson Title: FCC Rules for ISM Band Dale R. Thompson Computer Science and Computer Engineering Dept. University of Arkansas

Lesson Title: ThingNet Dale R. Thompson Computer Science and Computer Engineering Dept. University of Arkansas 1 This material.

1 Protection in SONET Path layer protection scheme: operate on individual connections Line layer protection scheme: operate on the entire set of connections.

Lesson Title: Tag Architecture Dale R. Thompson and Jia Di Computer Science and Computer Engineering Dept. University of Arkansas

Lesson Title: Animal Identification Standards Dale R. Thompson Computer Science and Computer Engineering Dept. University of Arkansas

Cascading failures of loads in interconnected networks under intentional attack Yongxiang Xia Department of Information Science and Electronic Engineering.

A study of provision of protecting capability after link failure in WDM networks 在 WDM 網路下以 FIPP 保護環連續供給保護能力之研究作者 : 丁德榮 (Der-Rong Din) 賴薪吉 (Hsin-Chi.

Virtual-Topology Adaptation for WDM Mesh Networks Under Dynamic Traffic.

Lesson Title: RFID Nominal Read Range in Far Field Dale R. Thompson Computer Science and Computer Engineering Dept. University of Arkansas

Training Arkansas Computing Teachers (TACT)

Isabella Cerutti, Andrea Fumagalli, Sonal Sheth

John Doucette and Wayne D. Grover

Network Layer – Routing 1

Network Survivability

Lesson Title: Reader Architecture and Antenna Configurations

Shortest-Paths Trees Kun-Mao Chao (趙坤茂)

Optical Layer Protection Schemes

Copyright © 2008 by Dale R. Thompson Dale R. Thompson

The University of Adelaide, School of Computer Science

A Novel 2-Hop Flow Approach

Simple Graphs: Connectedness, Trees

COMPUTER NETWORKS CS610 Lecture-16 Hammad Khalid Khan.

Lesson Title: Regulations Affecting RFID

Presentation transcript:

Cut Saturation for p-cycle Design Khalid Al-Snaie Electronics Dept., College of Technology Riyadh, Saudi Arabia Dale R. Thompson* Department of Computer Science & Computer Engineering (CSCE) University of Arkansas

Ring vs. Mesh

Two Enemies of Fiber

Four-fiber Bidirectional Line- Switched Ring (BLSR), no failure

Four-fiber BLSR, span switching

Four-fiber BLSR, ring switching

Wavelength-Division Multiplexing Red Green Blue

Wavelength Path #1 S1 S2 S3 D1 D3 D

Wavelength Path #2 S1 S2 S3 D1 D3 D

Virtual Wavelength Path (VWP) S1 S2 S3 D1 D3 D

One preconfigured protection cycle (p-cycle), no failures

One p-cycle, on-cycle span failure

One p-cycle, straddling span failure

SCP vs JCP in p-cycles Spare capacity placement (SCP) –Route demand using shortest paths –Apply capacity algorithm to find set of p-cycles that minimize spare capacity cost Joint capacity placement (JCP) –Apply capacity algorithm to find working routes and set of p-cycles that minimize spare capacity cost.

Cut Saturation

p-cycle Cut Saturation (PCUT) Load topology and traffic demand. do { Route traffic with JCP or with shortest path algorithm if using SCP. Sort spans by load in descending order. Remove spans one at a time until the network separates into two disconnected components N1 and N2. Add a new span between one of the lowest degree nodes in N1 and one of the lowest degree nodes in N2. Replace deleted spans. Find p-cycles with SCP or JCP. Calculate spare-to-working capacity ratio. } while (spare-to-working capacity ratio is greater than a threshold)

NSF Network

Add span #1 (N0 to N9)

Add span #2 (N7 to N14)

Add span #3 (N15 to N24)

Add span #4 (N10 to N23)

Final Answer (N0 to N9, N7 to N14, N15 to N24, N10 to N23)

Spare-to-working capacity Location of new spans Avg Node Degree S/W SCP (%) S/W JCP (%) S/W Bound (%) Original network N0 to N N0 to N9, N7 to N N0 to N9, N7 to N14, N15 to N N0 to N9, N7 to N14, N15 to N24, N10 to N

Contact Information Dale R. Thompson, P.E., Ph.D. Department of Computer Science and Computer Engineering University of Arkansas 311 Engineering Hall Fayetteville, Arkansas Phone: +1 (479) FAX: +1 (479) WWW: