Scribd
Upload
32 views20 pages

Routing and Wavelength Assignment For Wavelength-Routed WDM Networks

This document discusses routing and wavelength assignment problems in wavelength-routed WDM networks. It covers static and dynamic routing and wavelength assignment, formulations as integer linear programs and heuristics like graph coloring. Various routing algorithms and wavelength assignment heuristics like first-fit and most-used are presented. Simulation results demonstrate the performance of a distributed relative capacity loss algorithm with adaptive routing. The document concludes with ideas for future research on survivable networks and managing multicast connections.

Uploaded by

Vikrant Kumar
Copyright
© Attribution Non-Commercial (BY-NC)
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPT, PDF, TXT or read online on Scribd
32 views20 pages

Routing and Wavelength Assignment For Wavelength-Routed WDM Networks

This document discusses routing and wavelength assignment problems in wavelength-routed WDM networks. It covers static and dynamic routing and wavelength assignment, formulations as integer linear programs and heuristics like graph coloring. Various routing algorithms and wavelength assignment heuristics like first-fit and most-used are presented. Simulation results demonstrate the performance of a distributed relative capacity loss algorithm with adaptive routing. The document concludes with ideas for future research on survivable networks and managing multicast connections.

Uploaded by

Vikrant Kumar
Copyright
© Attribution Non-Commercial (BY-NC)
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPT, PDF, TXT or read online on Scribd
You are on page 1/ 20

Routing and Wavelength Assignment for WavelengthRouted WDM Networks

Combined routing and wavelength assignment problem Routing x static: ILP formulation x dynamic: on-line algorithms Wavelength assignment x static: graph coloring approach x dynamic: heuristics A new wavelength assignment heuristic
ECS 259 -- H. Zang and B. Mukherjee, UC Davis 1

RWA

Problem statement Wavelength-continuity constraint

ECS 259 -- H. Zang and B. Mukherjee, UC Davis 2

Combined Routing and Wavelength Assignment Problem

ECS 259 -- H. Zang and B. Mukherjee, UC Davis 3

Routing - ILP Formulation

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

Routing - Algorithms For Dynamic Traffic


Fixed routing (On/Off line) Fixed-alternate routing (On/Off line) Adaptive routing (On line) x adaptive shortest path routing x least congested path routing

ECS 259 -- H. Zang and B. Mukherjee, UC Davis 5

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 259 -- H. Zang and B. Mukherjee, UC Davis 6

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 259 -- H. Zang and B. Mukherjee, UC Davis 7

Illustrative Example
wavelengths

P1:(2,4)

ontrol network not shown. All wavelengths shown are for dat
ECS 259 -- H. Zang and B. Mukherjee, UC Davis 8

Calculation of Max-Sum
wavelengths

P1:(2,4)

WPC: Wavelength-path Capacity

wavelengths WPC loss of each path on each Total WPC loss P2:(1,5) P3:(3,6) P4:(0,3) 1 0 0 1 Wavelength 3 selected: 1 1 0 2 2 0 1 0 1 0, 1, or 1 0 0 1 1 0
ECS 259 -- H. Zang and B. Mukherjee, UC Davis 9

Calculation of Relative Capacity Loss


wavelengths

P1:(2,4)

Wavelength selected: 1 or 3
0 1 2 3 4 5 6

wavelengths 3 2 1 0

RCL of each path on each P2:(1,5) P3:(3,6) P4:(0,3) 0.5 0 0 0.5 0.5 0 0 0.5 0 0 0 1
ECS 259 -- H. Zang and B. Mukherjee, UC Davis

Total RCL 0.5 1 0.5 1


10

Simulation Network
1 0 1 1 1 5 2 2 1 4 1 1 3

Connection management protocol: link-state


ECS 259 -- H. Zang and B. Mukherjee, UC Davis 11

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.

0-node nidirectional ng, load/W = 1 Erlang

R R FF MS WC WC # of wavelength s (a) MU, MS FF, MU

5x5 bidirectional mesh-torus, load/W = 25 Erlangs

# of wavelength s (b)
12

ECS 259 -- H. Zang and B. Mukherjee, UC Davis

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(WN3) where W - # of wavelengths, N - # of nodes, L - # of links

ECS 259 -- H. Zang and B. Mukherjee, UC Davis 13

Distributed RCL Algorithm

P1:(2,4)

Wavelength
RCL table at Node 2

0 0 0 0 1

1 1/3 1/3 0 1/3

2 0 0 0 0

3 1/4 1/4 1/4 1/4

4 1/4 1/4 1/4 1/4

5 1/3 1/3 1/3 0

6 0

Subtotal

3 2 1 0

11/12

Wavelength *selected: 3

1/2 17/12 1/2 13/12 0 19/12


14

ECS 259 -- H. Zang and B. Mukherjee, UC Davis

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 259 -- H. Zang and B. Mukherjee, UC Davis 15

Simulation Network
1 0 1

1 1 5

2 1 4

1 3 1

2 Average propagation delay between two nodes: 0.107 ms Average hop distance: 1.53
ECS 259 -- H. Zang and B. Mukherjee, UC Davis 16

Simulation Results of Distributed RCL


Comparison of DRCL with adaptive routing and RCL with fixed routing

ECS 259 -- H. Zang and B. Mukherjee, UC Davis 17

Conclusion for RWA


Heuristics Least Used Random Min-Product First-Fit Most-Used Least-Loaded Max-Sum Relative Capacity Loss Complexity O(LW) O(W) O(NW) O(W) O(NW) O(LW) O(WN3) O(WN3) Performance Ordered in increasing order

L: # of links, N: # of nodes, W: # of wavelengths


ECS 259 -- H. Zang and B. Mukherjee, UC Davis 18

Future Research

Survivable wavelength-routed WDM networks x previous work: static traffic & single link failure [S. Ramamurthy 1998] x higher layer protection -logical topology design with bundle cut in mind x WDM layer protection - dynamic traffic

ECS 259 -- H. Zang and B. Mukherjee, UC Davis 19

Future Research (Contd)

Managing multicast connections in wavelength-routed WDM networks x KMB x Bellman-Ford x Chain

ECS 259 -- H. Zang and B. Mukherjee, UC Davis 20

You might also like