Optical networks: Basics of WDM

Slides:

Advertisements

Similar presentations

Efficient Routing and Wavelength Assignment in Wavelength-Routed Optical Networks Johannes Hamonangan Siregar Doctoral Program in Policy and Planning Sciences,

Advertisements

Routing and Congestion Problems in General Networks Presented by Jun Zou CAS 744.

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

Sirocco Peter Ruzicka Sirocco Results and research directions in ATM and optical networks

Novembro 2003 Tabu search heuristic for partition coloring1/29 XXXV SBPO XXXV SBPO Natal, 4-7 de novembro de 2003 A Tabu Search Heuristic for Partition.

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

Wavelength Routed Networks Wavelength Assignment Wavelength Conversion Cost Implications Network Modeling.

Optical Networks BM-UC Davis122 Part III Wide-Area (Wavelength-Routed) Optical Networks – 1.Virtual Topology Design 2.Wavelength Conversion 3.Control and.

Wavelength Division Multiplexing (WDM) in Optical Networks: Modeled as a Graph Coloring Problem By Joshua Schoenly.

1 Routing and Wavelength Assignment in Wavelength Routing Networks.

SMUCSE 8344 Optical Networks Introduction. SMUCSE 8344 Why Optical? Bandwidth Low cost ($0.30/yard) Extremely low error rate ( vs for copper.

Lecture: 4 WDM Networks Design & Operation

Wavelength Assignment in Optical Network Design Team 6: Lisa Zhang (Mentor) Brendan Farrell, Yi Huang, Mark Iwen, Ting Wang, Jintong Zheng Progress Report.

1 EL736 Communications Networks II: Design and Algorithms Class3: Network Design Modeling Yong Liu 09/19/2007.

Efficient Realization of Hypercube Algorithms on Optical Arrays* Hong Shen Department of Computing & Maths Manchester Metropolitan University, UK ( Joint.

Dynamic Wavelength Allocation and Wavelength Conversion.

Traffic Grooming in WDM Ring Networks Presented by: Eshcar Hilel.

Dynamic Wavelength Allocation in All-optical Ring Networks Ori Gerstel and Shay Kutten Proceedings of ICC'97.

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.

Optic fiber Electronic switch the fiber serves as a transmission medium Optical networks - 1 st generation 1. Optical networks – basic notions.

1 Electronic ADM. 2 3 ADM (add-drop multiplexer)

Approximating the Traffic Grooming Problem Mordo Shalom Tel Hai Academic College & Technion.

1 Distributed Computing Optical networks: switching cost and traffic grooming Shmuel Zaks ©

9/22/2003Kevin Su Traffic Grooming in WDM Networks Kevin Su University of Texas at San Antonio.

Scheduling Algorithms for Wireless Ad-Hoc Sensor Networks Department of Electrical Engineering California Institute of Technology. [Cedric Florens, Robert.

Traffic Grooming in WDM Networks Wang Yao. WDM Technology increases the transmission capacity of optical fibers allows simultaneously transmission of.

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

Optical Networks Rainbow for Communications. Medium Sharing Time Division Multiplexing (TDM) Frequency Division Multiplexing In the optical domain, –

Virtual Topology Adaptation in WDM Mesh Networks (for ECS 259: A. Gencata and B. Mukherjee, UC Davis) 1 Virtual Topology  Wavelength routed network 

1 Introduction to Optical Networks. 2 Telecommunications Network Architecture.

1 Distributed Computing Optical networks: switching cost and traffic grooming Shmuel Zaks ©

1 Distributed Computing Optical networks: switching cost and traffic grooming Shmuel Zaks ©

Called as the Interval Scheduling Problem. A simpler version of a class of scheduling problems. – Can add weights. – Can add multiple resources – Can ask.

Integrated Dynamic IP and Wavelength Routing in IP over WDM Networks Murali Kodialam and T. V. Lakshman Bell Laboratories Lucent Technologies IEEE INFOCOM.

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

IP Restoration on WDM Optical Networks Hwajung Lee*, Hongsik Choi, Hyeong-Ah Choi The George Washington University Department of Computer Science.

Genetic Algorithm for Multicast in WDM Networks Der-Rong Din.

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

9 1 SIT  Today, there is a general consensus that in near future wide area networks (WAN)(such as, a nation wide backbone network) will be based on.

Optimization of Wavelength Assignment for QoS Multicast in WDM Networks Xiao-Hua Jia, Ding-Zhu Du, Xiao-Dong Hu, Man-Kei Lee, and Jun Gu, IEEE TRANSACTIONS.

November 18, Traffic Grooming in Optical WDM Networks Presented by : Md. Shamsul Wazed University of Windsor.

Algorithms for Allocating Wavelength Converters in All-Optical Networks Authors: Goaxi Xiao and Yiu-Wing Leung Presented by: Douglas L. Potts CEG 790 Summer.

Wavelength Assignment in Waveband Switching Networks with Wavelength Conversion Xiaojun Cao; Chunming Qiao; Anand, V. Jikai LI GLOBECOM '04. IEEE Volume.

1 Optical Burst Switching (OBS). 2 Optical Internet IP runs over an all-optical WDM layer –OXCs interconnected by fiber links –IP routers attached to.

Το Πρόβλημα Routing and Path Coloring και οι εφαρμογές του σε πλήρως οπτικά δίκτυα Ευχαριστίες: οι διαφάνειες αυτές βασίστηκαν εν μέρει στην παρουσίαση.

Logical Topology Design

Multi-layered Optical Network Security

Optimization of Wavelength Assignment for QoS Multicast in WDM Networks Xiao-Hua Jia, Ding-Zhu Du, Xiao-Dong Hu, Man-Kei Lee, and Jun Gu, IEEE TRANSACTIONS.

First lecture in Mathematics

1 Optical Packet Switching Techniques Walter Picco MS Thesis Defense December 2001 Fabio Neri, Marco Ajmone Marsan Telecommunication Networks Group

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:

1 HEINZ NIXDORF INSTITUTE University of Paderborn Algorithms and Complexity Christian Schindelhauer Algorithms for Radio Networks Winter Term 2005/2006.

1 Distributed Computing Optical networks: switching cost and traffic grooming Shmuel Zaks ©

Optical Network Security Daniel Stewart. Preliminary work Dijkstra's Algorithm Dijkstra's algorithm, is a graph search algorithm that solves the single-

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

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

Traffic grooming in WDM Networks Dynamic Traffic Grooming in WDM Mesh Networks Using a Novel Graph Model by Hongyue Zhu, Hui Zang, Keyao Zhu, and Biswanath.

Client Assignment in Content Dissemination Networks for Dynamic Data Shetal Shah Krithi Ramamritham Indian Institute of Technology Bombay Chinya Ravishankar.

An integrated survey in Optical Networks: Concepts, Components and Problems Delivered by Erna Sri Sugesti, Ir., MSc. 1 May 2013 Ali Norouzi †, A.Halim.

QoS-specified Traffic Grooming Algorithm in WDM Mesh Networks Bing Xiang, Hongfang Yu, Sheng Wang, Lemin Li Communications, Circuits and Systems, 2004.

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.

1 Minimum Interference Algorithm for Integrated Topology Control and Routing in Wireless Optical Backbone Networks Fangting Sun Mark Shayman University.

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

Network Resources.

Isabella Cerutti, Andrea Fumagalli, Sonal Sheth

Optical Networks – Basic Concepts (Part 1) Dr. Arunita Jaekel

The University of Adelaide, School of Computer Science

Design & development of impairment-aware routing and wavelength assignment algorithms for Future Internet Mohammad Shoyaib Student ID: Image.

Md. Tanveer Anwar University of Arkansas

Maximum Flow Neil Tang 4/8/2008

Presentation transcript:

Optical networks: Basics of WDM

Optical networks - 1st generation the fiber serves as a transmission medium Electronic switch Optic fiber

Optical networks - 2nd generation Routing in the optical domain Two complementing technologies: - Wavelength Division Multiplexing (WDM): Transmission of data simultaneously at multiple wavelengths over same fiber - Optical switches: the output port is determined according to the input port and the wavelength

Wavelength Division Multiplexing (WDM) Directed: Optic Fiber Symmetric: Optic Fiber Undirected: Optic Fiber

Optical Switches No two inputs with the same wavelength should be routed on the same edge.

Lightpaths ADM ADM Data in electronic form Data in electronic form

A virtual topology

Lightpaths Valid coloring p1 p2

The Routing Problem Input : Output: A graph G=(V,E) A set or sequence of node pairs (ai,bi) Output: A set or sequence of paths pi =(ai, v1, …, bi)

The Load Given a graph G=(V,E) and a set P of paths on the graph, we define: for any edge e of the graph: the load on this edge l(e)=|Pe| The (maximum, minimum, average) load on the network:

Wavelength Assignment Problem (WLA) Input: A graph G=(V,E). A set or sequence of paths P. Output: A coloring w of the paths: Constraint:

Routing and WLA (RLA/WRA) Input : A graph G=(V,E) A set or sequence of node pairs (ai,bi) Output: A set or sequence of paths pi =(ai, v1, …, bi) A coloring w of the paths: Constraint:

Cost Measure: # of colors For any legal coloring w of the paths:

Static vs. Dynamic vs. Incremental Static: The input is a set (of pairs or paths), the algorithm calculates its output based on the input. Incremental (Online): The input is a sequence of input elements (pairs or paths). It is supplied to the algorithm one element at a time. The output corresponding to the input element is calculated w/o knowledge of the subsequent input elements

Static vs. Dynamic vs. Incremental Similar to incremental The sequence may contain deletion requests for previous elements.

WLA (A trivial lower bound) For any instance of the WLA problem: W>=L. Proof: Consider an edge e, such that L=l(e). There are L paths p1, …, p|L| using e, because the paths are simple. Therefore :

WLA (A trivial lower bound) For some instances W > L. L=2 W=3

Static WLA on Path Topologies The GREEDY algorithm: // The set of integers for i = 1 to |V| do for each path p=(x,i) do for each path p=(i,x) do

Static WLA on Path Topologies Let the value of after node i is processed. Clearly, Prove by induction on i that Therefore: