ECS 259 -- H. Zang and B. Mukherjee, UC Davis 1 Routing and Wavelength Assignment for Wavelength-Routed WDM Networks  Combined routing and wavelength.

Slides:

Advertisements

Similar presentations

In the name of God, The Beneficent, The Merciful

Advertisements

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.

Data and Computer Communications Ninth Edition by William Stallings Chapter 12 – Routing in Switched Data Networks Data and Computer Communications, Ninth.

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

CSC 778 Fall 2007 Routing & Wavelength Assignment Vinod Damle Hardik Thakker.

1 Routing and Wavelength Assignment in Wavelength Routing Networks.

Routing and Wavelength Assignment Approaches for Wavelength-Routed Optical WDM Networks.

Protection Mechanisms for Optical WDM Networks based on Wavelength Converter Multiplexing and Backup Path Relocation Techniques Presented by: Brian V.

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

1 Short Overview of Dynamic Routing and Wavelength-Assigment in Survivable WDM Networks Carlos Simões 1,3 e Teresa Gomes 2,3 1 Escola Superior de Tecnologia.

A Waveband Switching Architecture and Algorithm for Dynamic Traffic IEEE Communications Letters, Vol.7, No.8, August 2003 Xiaojun Cao, Vishal Anand, Chunming.

New QoS Measures for Routing and Wavelength Assignment in WDM Networks Shi Zhong Xu and Kwan L. Yeung Dep. Of EE, The Univ. of Hong Kong ICC’2002.

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.

AGH University of Science and Technology NOBEL WP2 Meeting, Berlin May QoS/GoS Routing in Optical Networks.

Madhavi W. SubbaraoWCTG - NIST Dynamic Power-Conscious Routing for Mobile Ad-Hoc Networks Madhavi W. Subbarao Wireless Communications Technology Group.

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

What is “Routing”? Routing algorithm that part of the network layer responsible for deciding on which output line to transmit an incoming packet Adaptive.

Routing Strategies Fixed Routing

Dynamic Routing and Wavelength Assignment Scheme for Protection against Node Failure Ying Wang1, Tee Hiang Cheng1,2 and Biswanath Mukherjee3 1School of.

Physical Layer Impairment Aware Wavelength Routing Algorithms Vasilis Anagnostopoulos 1, Christina (T.) Politi 1,2, Chris Matrakidis 1,2, Alexandros Stavdas.

Computer Networks The Data Link / Network Layer Functions: Routing

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.

1 B. Mukherjee, UC Davis ECS 259 Lecture 3, Page 1/28/2002 (K, M, P) GEMNET.

1 A Distributed Delay-Constrained Dynamic Multicast Routing Algorithm Quan Sun and Horst Langendorfer Telecommunication Systems Journal, vol.11, p.47~58,

Sponsored by BellSouth, Cisco, UC Micro Program Design and Development of an MPLambdaS Simulator Jian Wang, Biswanath Mukherjee, S, J, Ben Yoo University.

2015/6/291 Fault Management in IP- Over-WDM Networks: WDM Protection Versus IP Restoration Adviser: Ho-Ting Wu Presenter: Ze-Yang Guo.

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

EECC694 - Shaaban #1 lec #7 Spring The OSI Reference Model Network Layer.

Jennifer Rexford Princeton University MW 11:00am-12:20pm Wide-Area Traffic Management COS 597E: Software Defined Networking.

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

CS 453 Computer Networks Lecture 24 IP Routing. See…

1 Pertemuan 20 Teknik Routing Matakuliah: H0174/Jaringan Komputer Tahun: 2006 Versi: 1/0.

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

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.

1 PHYSICAL IMPAIRMENTS Maruthy Mentireddi Raghu Kalyan Anna.

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

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.

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

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.

Load Balancing in Protection Switching of Optical Networks Hongkyu Jeong, Gyu-Myoung Lee Information and Communications Univ. (ICU) Student ID : ,

Presenter: Jonathan Murphy On Adaptive Routing in Wavelength-Routed Networks Authors: Ching-Fang Hsu Te-Lung Liu Nen-Fu Huang.

On Survivable Routing of Mesh Topologies in IP-over-WDM Networks Maciej Kurant, Patrick Thiran EPFL, Switzerland Infocom 2005, March 13-17, Miami.

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.

1 Delay Aware Link Scheduling for Multi- Hop TDMA Wireless Networks Petar Djukic * and Shahrokh Valaee + *University of California +University of Toronto,

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 Presented by Sarbagya Buddhacharya. 2 Increasing bandwidth demand in telecommunication networks is satisfied by WDM networks. Dimensioning of WDM networks.

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.

Routing protocols. 1.Introduction A routing protocol is the communication used between routers. A routing protocol allows routers to share information.

Shortest Path Algorithm

11/02/2001 Workshop on Optical Networking 1 Design Method of Logical Topologies in WDM Network with Quality of Protection Junichi Katou Dept. of Informatics.

1 Dynamic RWA Connection requests arrive sequentially. Setup a lightpath when a connection request arrives and teardown the lightpath when a connection.

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.

Distance Vector Routing

Wavelength-Routed Optical Networks: Linear Formulation, Resource Budgeting Tradeoffs, and a Reconfiguration Study Dhritiman Banergee and Biswanath Mukherjee,

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

Isabella Cerutti, Andrea Fumagalli, Sonal Sheth

Distributed Control Plane

The University of Adelaide, School of Computer Science

SURVIVABILITY IN IP-OVER-WDM NETWORKS (2)

Chapter 10 RWA 2019/5/9.

Computer network technology

QoS routing Finding a path that can satisfy the QoS requirement of a connection. Achieving high resource utilization.

Presentation transcript:

ECS H. Zang and B. Mukherjee, UC Davis 1 Routing and Wavelength Assignment for Wavelength-Routed WDM Networks  Combined routing and wavelength assignment problem  Routing u static: ILP formulation u dynamic: on-line algorithms  Wavelength assignment u static: graph coloring approach u dynamic: heuristics  A new wavelength assignment heuristic

ECS H. Zang and B. Mukherjee, UC Davis 2 RWA  Problem statement  Wavelength-continuity constraint

ECS H. Zang and B. Mukherjee, UC Davis 3 Combined Routing and Wavelength Assignment Problem

ECS H. Zang and B. Mukherjee, UC Davis 4 Routing - ILP Formulation

ECS H. Zang and B. Mukherjee, UC Davis 5 Routing - Algorithms For Dynamic Traffic  Fixed routing (On/Off line)  Fixed-alternate routing (On/Off line)  Adaptive routing (On line) u adaptive shortest path routing u least congested path routing

ECS H. Zang and B. Mukherjee, UC Davis 6 Wavelength Assignment with Known Lightpaths and Routes - Graph Coloring  Construct an auxiliary graph G(V,E)  Color the nodes of the graph G such that no two adjacent nodes have the same color  Sequential graph coloring approaches

ECS H. Zang and B. Mukherjee, UC Davis 7 Wavelength Assignment Heuristics  Random  First-Fit  Least-Used/SPREAD  Most-Used/PACK  Min-Product  Least Loaded  MAX-SUM  Relative Capacity Loss  Wavelength Reservation  Protecting Threshold

ECS H. Zang and B. Mukherjee, UC Davis 8 Illustrative Example wavelengthsP 1 :(2,4) Note: control network not shown. All wavelengths shown are for data traffic

ECS H. Zang and B. Mukherjee, UC Davis 9 Calculation of Max-Sum Wavelength selected: 0, 1, or 3 WPC: Wavelength-path Capacity wavelengthsP 1 :(2,4)

ECS H. Zang and B. Mukherjee, UC Davis 10 Calculation of Relative Capacity Loss Wavelength selected: 1 or wavelengthsP 1 :(2,4)

ECS H. Zang and B. Mukherjee, UC Davis 11 Simulation Network Connection management protocol: link-state

ECS H. Zang and B. Mukherjee, UC Davis 12 Results from Others’ Publication Source: S. Subramaniam and R. A. Barry, “Wavelength assignment in fixed routing WDM networks,” Proc. ICC'97 - International Conference on Communications, Montreal, Canada, vol. 1, pp , June (a)(b) R R MS MU, MS WC FF, MU WC FF 20-node unidirectional ring, load/W = 1 Erlang # of wavelengths 5x5 bidirectional mesh-torus, load/W = 25 Erlangs

ECS H. Zang and B. Mukherjee, UC Davis 13 Computational Complexity  Wavelength reservation & Protecting threshold - constant  Random & First-Fit - O(W)  Min-Product & Least-Loaded - O(NW)  Least-Used & Most-Used - O(LW)  Max-Sum & Relative Capacity Loss - O(WN 3 )  where W - # of wavelengths, N - # of nodes, L - # of links

ECS H. Zang and B. Mukherjee, UC Davis 14 Distributed RCL Algorithm P 1 :(2,4) RCL table at Node 2 * Wavelength selected: 3

ECS H. Zang and B. Mukherjee, UC Davis 15 Characteristics of Distributed RCL  Less state information is exchanged  Faster computation of wavelength assignment upon a connection request  Can be combined with adaptive routing

ECS H. Zang and B. Mukherjee, UC Davis 16 Simulation Network  Average propagation delay between two nodes: ms  Average hop distance:

ECS H. Zang and B. Mukherjee, UC Davis 17 Simulation Results of Distributed RCL Comparison of DRCL with adaptive routing and RCL with fixed routing

ECS H. Zang and B. Mukherjee, UC Davis 18 Conclusion for RWA L: # of links, N: # of nodes, W: # of wavelengths

ECS H. Zang and B. Mukherjee, UC Davis 19 Future Research  Survivable wavelength-routed WDM networks u previous work: static traffic & single link failure [S. Ramamurthy 1998] u higher layer protection -logical topology design with bundle cut in mind u WDM layer protection - dynamic traffic

ECS H. Zang and B. Mukherjee, UC Davis 20 Future Research (Cont’d)  Managing multicast connections in wavelength-routed WDM networks u KMB u Bellman-Ford u Chain