Presentation is loading. Please wait.

Presentation is loading. Please wait.

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

Published by Modified over 9 years ago

Similar presentations

Presentation on theme: "ECS 259 -- H. Zang and B. Mukherjee, UC Davis 1 Routing and Wavelength Assignment for Wavelength-Routed WDM Networks  Combined routing and wavelength."— Presentation transcript:

1 ECS 259 -- 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

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

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

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

5 ECS 259 -- 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

6 ECS 259 -- 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

7 ECS 259 -- 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

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

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

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

11 ECS 259 -- H. Zang and B. Mukherjee, UC Davis 11 Simulation Network Connection management protocol: link-state 1 5 0 4 3 2 1 1 1 1 1 1 2 2

12 ECS 259 -- 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. 406-410, June 1997. (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

13 ECS 259 -- 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

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

15 ECS 259 -- 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

16 ECS 259 -- H. Zang and B. Mukherjee, UC Davis 16 Simulation Network  Average propagation delay between two nodes: 0.107 ms  Average hop distance: 1.53 1 5 0 4 3 2 1 1 1 1 1 1 2 2

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

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

19 ECS 259 -- 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

20 ECS 259 -- 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

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

Similar presentations

In the name of God, The Beneficent, The Merciful

In the name of God, The Beneficent, The Merciful
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.

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.

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.

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.

CSC 778 Fall 2007 Routing & Wavelength Assignment Vinod Damle Hardik Thakker.
1 Routing and Wavelength Assignment in Wavelength Routing Networks.

1 Routing and Wavelength Assignment in Wavelength Routing Networks.
Routing and Wavelength Assignment Approaches for Wavelength-Routed Optical WDM 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.

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 (10 -12 vs. 10 -6 for copper.

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

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.

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.

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.

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.

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 18-19 May 2004 1 QoS/GoS Routing in Optical Networks.

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.

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.

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.

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

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.

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

Similar presentations

Ads by Google