Optical Networks BM-UC Davis

122
Part III
Wide-Area (Wavelength-Routed)
Optical Networks
1. Virtual Topology Design
2. Wavelength Conversion
3. Control and Management

Optical Networks BM-UC Davis
123
Lightpaths and Wavelength Routing
Lightpath

Virtual topology

Wavelength-continuity
constraint

Wavelength conversion

Packet routing
Optical Networks BM-UC Davis
124
Illustrative example
WA
CA1
CA2
UT
CO
TX
NE
IL
MI
NY
NJ
PA
MD
GA
Optical Networks BM-UC Davis
125
Solution 1a: Infocom94 and ToN-Oct96
More than one laser filter pair at any node can tune to the same
wavelength
Optical Networks BM-UC Davis
126
Solution 1b: Infocom94 and ToN-Oct96
All laser filter pairs at any node must be tuned to different
wavelengths
Optical Networks BM-UC Davis
127
Virtual Topology
Optical Networks BM-UC Davis
128
Wavelength Routing Switch (WRS)Details of the UT Node
Optical Networks BM-UC Davis
129
Optimization Problem Formulation
On virtual topology connection matrix V
ij

i T V
i
j
ij
s

j R V
j
i
ij
s

On physical route variables p

ij
mn

mn
ij
mn
P p s
ij
ij
mn
V p s
j i k if p p
n
ij
kn
m
ij
mk
, = =

ij
n
ij
in
V p =

ij
m
ij
mj
V p =

On virtual topology traffic variables

sd
ij

0 >
sd
ij

sd
j
sd
sj
=

sd
j
sd
sj
=

d s k if
j
sd
kj
i
sd
ik
, = =


C V
ij
d s
sd
ij
s

On coloring of lightpaths c
ij
k

ij
k
ij
k
V c =

k n m c p
ij
k
ij
ij
mn
, , 1 s

Objective: Optimality criterion

(a) Delay minimization:
(b) Maximizing offered load (equivalent to minimizing maximum flow in a link):


|
|
.
|

\
|
(
(

+
ij sd mn
sd
sd
ij
mn
ij
mn
sd
ij
C
d p Minimize

1
j i
sd
sd
ij
, max min
|
|
.
|

\
|
(

New optimality criterion

(c) Minimize average hop distance

A
j i d s
sd
ij
d s
sd
Minimize
, ,
,
1

Optical Networks BM-UC Davis

130
Solution Approach to Virtual Topology WDM WAN Design
1. Choice of optimal virtual topology
Simulated annealing; optimization based on maximizing throughput,
minimizing delay, maximizing single-hop traffic, etc.

2. Routing of lightpaths over the physical topology
Alternate-path routing, multicommodity flow formulation, randomized
routing

3. Wavelength assignment: Coloring of lightpaths to avoid
wavelength clashes
Graph-coloring algorithms, layered graph models

4. (Optimal) routing of packets over the virtual topology
Shortest-path routing, flow-deviation algorithm, etc.

5. Iterate
Check for convergence and go back to Step 1, if necessary.
Optical Networks BM-UC Davis
131
Details of Virtual Topology Design
Simulated Annealing
Start with random virtual topology
Perform node exchange operations on two random nodes
Route packet traffic (optimally) using flow deviation
Calculate maximum traffic scaleup for current configuration
If maximum scaleup is higher then previous maximum,
then accept current configuration;
else accept current configuration with certain decreasing probability
Repeat until problem solution stabilizes (frozen).

Flow Deviation
Perform shortest-path routing of the traffic
Select path with large traffic congestion
Route a fraction of this traffic to less-congested links
Repeat above two steps iteratively, until solution is acceptable
Optical Networks BM-UC Davis
132
NSFNET Traffic Matrix (11:45 PM to midnight, ET, Jan. 12, 1992)
Optical Networks BM-UC Davis
133
The WDM Advantage
Transceivers/
node
Scaleup
4 106
5 135
6 163
Optical Networks BM-UC Davis
134
Delay Components in a WDM Solution
Optical Networks BM-UC Davis
135
Scaling of Bandwidth The WDM Advantage
No WDM (Physical Topology)
Mbps
p
p
p
H
C L
= A
WDM (with P transmitters/receivers per node)
Mbps
v v
v
v
H
C NP
H
C L
=

= A
WDM Advantage
v p
v
v
p
p v
p
p
v
p
v
H
P
H
H
L
NP
H
H
L
L

A
A
= =
A
A
Increasing P decreasing H
v

C = link speed (Mbps)

H
p
= avg. hop distance (physical)

N = number of nodes
Optical Networks BM-UC Davis
136
Problems/Limitations of Solution 1

Nonlinear objective functions.

Nonlinear constraints on wavelength continuity.

Resorted to heuristics
Optimal virtual topology design (Simulated Annealing)
Optimal packet routing on V.T. (Flow Deviation Algorithm)
No routing and wavelength assignment
(Shortest-path lightpath routing; no constraints on
wavelengths).
Optical Networks BM-UC Davis
137
Highlights/Contributions of Solution 2
Complete Virtual Topology Design
Linear formulation Optimal solution
Objective: Minimize average hop distance
Assume: Wavelength conversion
(Sparse conversion provides almost full conversion benefits).
Resource Budgeting Tradeoffs
Important/Expensive Resources: Transceivers and
wavelengths
Dont under-utilize either of them!
Hardware cost model.
Optimal Reconfiguration Algorithm
Minimize reconfiguration time.
Optical Networks BM-UC Davis
138
Optional Constraints / Simplifying Assumptions

Need scalability.

Physical topology is a subset of the virtual topology.

Bounded lightpath length
Prevent long convoluted lightpaths from occuring.

Prune the search space
Consider K shortest paths (bounded K).
Optical Networks BM-UC Davis
139
Two Solutions from the LP
(a) Two-wavelength
solution
(b) Five-wavelength
solution
Optical Networks BM-UC Davis
140
Hop Distance, Transceiver + Wavelength Utilization
Optical Networks BM-UC Davis
141
Average Hop Distance
Optical Networks BM-UC Davis
142
Transceiver Utilization
Optical Networks BM-UC Davis
143
Wavelength Utilization
Optical Networks BM-UC Davis
144
Heuristic Solutions
Optical Networks BM-UC Davis
145
WDM Network Cost Model
2 / log 2
1 1 1
|
.
|

\
|
+
|
|
.
|

\
|
(
(
(

+
(
(
(

+ + |
.
|

\
|
+ =

= = =
m
N
m
m x
N
j
j
N
i
i
m
i
i
i
i t
WC
W
R
W
T
M C R T C C o o
Optical Networks BM-UC Davis
146
Reconfiguration Algorithm
Generate linear formulations F(1) and F(2) corresponding to traffic
matrices A
sd
1
and A
sd
2
.

Derive solutions and S(1) and S(2), corresponding to F(1) and F(2)

Modify F(2) to F(2) by adding the new constraint:



New objective function for F(2) :


or


Although mod is nonlinear, above reconfiguration formulation is linear
since the variables ps and Vs are binary.
2
, ,
1
OPT
j i d s
sd
ij
sd
sd
=
A

ij mn
ij
mn
ij
mn
p p Minimize ) 1 ( ) 2 ( :

ij
ij ij
V V Minimize ) 1 ( ) 2 ( :
Optical Networks BM-UC Davis
147
Reconfiguration Statistics
Optical Networks BM-UC Davis
148
Summary of Virtual Topology Design Principles
Use WDM to scale up an existing fiber-based WAN
(Networks information carrying capacity increased
manifold)

Employ packet-switched virtual topology
imbedded on a physical topology
as if we have a virtual Internet
(which is reconfigurable under user control)
need optimum graph-imbedding algorithms

Reuse electronic switch of existing WAN
as part of the WRS in the scaled-up WAN