Lightpath

assignment
Lightpath assignment for multifibers Cuong Do and
Nick Downing
WDM networks with wavelength translators
Introduction
Network flow models
Multicommodity flow
Circuit switching
Cuong Do and Nick Downing Lightpath assignment

Approximation
method
431-690
Experimental
Advanced Topics in Communications: results
Fundamentals of Discrete Optimisation
Conclusions

September 29, 2010

 Lightpath
Outline assignment

Cuong Do and
Nick Downing

Introduction
Introduction Network flow models
Multicommodity flow
Network flow models Circuit switching
Lightpath assignment
Multicommodity flow Approximation
Circuit switching method

Experimental
Lightpath assignment results

Conclusions

Approximation method

Experimental results

Conclusions
 Lightpath
Network flow models assignment

Cuong Do and
◮ Consider network with vertices i and directed edges ij Nick Downing

◮ let cij = cost of flow from vertex i to vertex j

Introduction
◮ let fij = quantity of flow from vertex i to vertex j
P
Network flow models
Multicommodity flow
◮ Minimize ij cij fij subject to constraints Circuit switching
Lightpath assignment
◮ capacity: flow ∈ range, e.g. 0 ≤ fDC ≤ 4 Approximation
◮ balancing: flow in = flow out, e.g. fDB + fDC = fED + 2 method

Experimental
results
fDB
Conclusions
B 2 D 2
fBA fDC
5 1

5 A 6 fBC 7 fED

4 8
fCA fEB
C 3 E 3
fEC
minimize
5fBA + 6fBC + 4fCA + 2fDB + 1fDC + 8fEB + 3fEC + 7fED
 Lightpath
Multicommodity flow assignment

Cuong Do and
◮ We want specific endpoints connected to specific Nick Downing

endpoints
Introduction
◮ e.g. connection of (E , B), simultaneously with (D, A) Network flow models
Multicommodity flow
Circuit switching
fDB fDB Lightpath assignment
1 B 2 D 1 1 B 2 D 1
fBA fDC fBA fDC Approximation
5 1 5 1 method
1 A 6 fBC 7 fED 1 A 6 fBC 7 fED Experimental
4 8 4 8 results
fCA fEB fCA fEB
C 3 E 1 C 3 E 1 Conclusions
fEC fEC

Optimal solution found Correct optimal solution

by network flow model
◮ Normally, each k-value models a distinct commodity,
e.g.
◮ E and A respectively produce and consume tomatoes
◮ D and B respectively produce and consume potatoes
◮ trucks can be loaded with potatoes or tomatoes or a
mixture, but the number of trucks available on a route
is fixed
 Lightpath
Multicommodity flow assignment

Cuong Do and
◮ To enforce correct connections, create network per flow Nick Downing

◮ Network k has own its own set of flow variables fijk Introduction
◮ Each network has separate flow balancing constraints Network flow models
Multicommodity flow
Circuit switching
e.g. fDB + fDC = fED + 1 becomes Lightpath assignment

fDB1 + fDC 1 = fED1 + 1 and fDB2 + fDC 2 = fED2 Approximation

method
◮ Capacity constraints are shared between the networks Experimental
results
e.g. fij ≤ 1 becomes fij1 + fij2 ≤ 1
Conclusions

fDB1
1 B B D D 1
fDB2
fBA1 fDC 1
fBA2
fDC 2
1 A A fBC 1 fBC 2 fED1 fED2
fEB2
fCA2
fCA1 fEB1
fEC 1
C C E E 1
fEC 2
 Lightpath
Circuit switching assignment

Cuong Do and
Nick Downing

◮ Flows naturally represent pipes carrying gases or liquids Introduction

Network flow models
◮ may also represent data flow in communication network Multicommodity flow
Circuit switching
◮ (or other applications e.g. movement of goods by road) Lightpath assignment

◮ In circuit switched routing, flows are like telephone calls Approximation

method
◮ a particular data capacity fij is assigned between nodes Experimental
◮ connectivity between nodes is guaranteed during the call results
◮ flow fij is assumed to be constant throughout the call Conclusions
◮ unlike VOIP, which is packet switched, has no guarantee
◮ Our routing model does not take time into account
◮ model is solved for a particular set of node connections
◮ if a user hangs up or places a call, re-solve the model
◮ Can represent each connection by a distinct commodity
◮ if user has several calls, don’t need commodity for each
◮ this is why the paper refers to ‘multicast’ routing
 Lightpath
Lightpath assignment assignment

Cuong Do and
Nick Downing

Introduction
Network flow models
Multicommodity flow
Circuit switching
Lightpath assignment
◮ Ordinary telephone network = multicommodity flow
Approximation
◮ fijk values ∈ Z represent number of trunk lines in use method
◮ capacity constraints model size of trunk between nodes Experimental
results
◮ any incoming line can be connected to any outgoing line
Conclusions
◮ Modelling an optical network is more difficult
◮ fibre is similar to trunk, but not a homogeneous resource
◮ due to passive switching, each incoming wavelength can
only connect to the same outgoing wavelength
 Lightpath
Lightpath assignment assignment

Cuong Do and
Nick Downing
◮ Hence, a further decomposition is required per user k
◮ e.g. fijk ∈ {0, 1, 2, 3} becomes fijk1 , fijk2 , fijk3 ∈ {0, 1} Introduction
Network flow models
◮ each wavelength has its own flow balancing constraints Multicommodity flow
Circuit switching
◮ diagram shows one user, decomposed into 3 wavelengths Lightpath assignment
◮ flow enters/leaves decomposed network via super-nodes Approximation
method
s1 t1
Experimental
results

Conclusions
s2 t2

S
S’

trans_+ u trans_− u
super_t
s3 t3

◮ May also allow wavelength changer widgets, as shown

 Lightpath
Approximation method assignment

Cuong Do and
Nick Downing

Introduction
Network flow models
Multicommodity flow
Circuit switching
Lightpath assignment

Approximation
method

Experimental
results

Conclusions
 Lightpath
Experimental results assignment

Cuong Do and
Nick Downing

Introduction
Network flow models
Multicommodity flow
Circuit switching
Lightpath assignment

Approximation
method

Experimental
results

Conclusions
 Lightpath
Conclusions assignment

Cuong Do and
Nick Downing

Introduction
Network flow models
Multicommodity flow
Circuit switching
Lightpath assignment

Approximation
method

Experimental
results
Thank you Conclusions