Armando BORRERO MOLINA
S.E., M.Sc., Ph.D. Informatics
- Introduction
+ Optics + Photonics
- Network Generations - Routing Methods
+ Eulerian + Weighted + Deflection
- Minimal D.
- Scale Routing
- Metro-Access Networks - Topologies
- Resource Optimization - New Trends
Index
- Eulerian - Weighted - Deflection
+ Minimal D.
+ Scale Routing
Routing Methods
Eulerian Circuit
Eulerian
Part A Part B
Routing Methods
Weighted
Origen Destino
N
S
W E
Routing Methods
Topology
Topology 2D Grid 2D
Routing Methods
Deflection
Routing Methods
Deflection
Topology
Topology 2D Grid 2D
Origin
N
S
W E
Destination
Routing Methods
Minimal Deflection
Minimal Capacity
1.- Clients marqués non routés.
2.- While clients marqués non routés.
2a.- If client pas routé (0 direction favorable disponible) 2aa.- Then routé vers X (déflecté).
Else
2ab.- If client pas routé (1 direction favorable disponible)
2ab.1.- Then routé vers direction. Marquée Non Disponible Else
2ab.2.- Client 2 directions favorables disponibles
2ab.3.- Direction moins demandée. Client Dir. Marquée ND End While
3.- Clients marqués X (à déflecter) routés direction disponible différente.
Clients examinés ordre dynamique sur nombre directions favorables
{ Minimal Capacity
Minimal Deflection Algorithm
Routing Methods
(Local Minimization)
a
d b
a b c
d W
S E N
a b c
d W
S E N
W E
S N
Algo Rout.
2ab d S 2ab c E 2ab a N 2ab b W
Without Deflection Example
c
Minimal Capacity
Minimal Deflection Algorithm
Routing Methods
Origin
Destination
a b c
d W
S E N
a b c
d W
S E N
Algo Rout.
2ab c E
a
d b
W E
S N
c
Minimal Capacity
Minimal Deflection Algorithm
Routing Methods
Without Deflection Example
Origin
a b c
d W
S E N
a b c
d W
S E N
Algo Rout.
2ab c E 2ab a N
a
d b
W E
S N
c
Minimal Capacity
Minimal Deflection Algorithm
Routing Methods
Without Deflection Example
Origin
Destination
a b c
d W
S E N
a b c
d W
S E N
Algo Rout.
2ab c E 2ab a N 2ab b W
a
d b
W E
S N
c
Minimal Capacity
Minimal Deflection Algorithm
Routing Methods
Without Deflection Example
Origin
a b c
d W
S E N
a b c
d W
S E N
Algo Rout.
2ab d S 2ab c E 2ab a N 2ab b W
a
d b
W E
S N
c
Minimal Capacity
Minimal Deflection Algorithm
Routing Methods
Without Deflection Example
Origin
Destination
a b c
d W
S E N
a b c
d W
S E N
Algo Rout.
2ab d S 2ab c E 2ab a N 2ab b W
a
d b
W E
S N
c
Minimal Capacity
Minimal Deflection Algorithm
Routing Methods
Without Deflection Example
Origin
a b c
d W
S E N
a b c
d W
S E N
Algo Rout.
2ab c E
a b
d S
N
c E
Minimal Capacity
Minimal Deflection Algorithm
Routing Methods
With Deflection Example
W
Origin
Destination
a b c
d W
S E N
a b c
d W
S E N
Algo Rout.
2ab c E 2ab a N
a b
d S
N
c E
Minimal Capacity
Minimal Deflection Algorithm
Routing Methods
With Deflection Example
W
Origin
a b c
d W
S E N
a b c
d W
S E N
Algo Rout.
2ab c E 2ab a N 2aa b X
a b
d S
N
c E
Minimal Capacity
Minimal Deflection Algorithm
Routing Methods
With Deflection Example
W
Origin
Destination
a b c
d W
S E N
Algo Rout.
2ab d S 2ab c E 2ab a N 2aa b X
a b
d S
N
c E
a b c
d W
S E N
Minimal Capacity
Minimal Deflection Algorithm
Routing Methods
With Deflection Example
W
Origin
a b c
d W
S E N
Algo Rout.
2ab d S 3 b W 2ab c E 2ab a N 2aa b X
a b
d S
N
c E
a b c
d W
S E N
Minimal Capacity
Minimal Deflection Algorithm
Routing Methods
With Deflection Example
W
Origin
Destination
a b c
d W
S E N
a b c
d W
S E N
Algo Rout.
2ab d S 3 b W 2ab c E 2ab a N 2aa b X
a b
d S
N
c E
Minimal Capacity
Minimal Deflection Algorithm
Routing Methods
With Deflection Example
W
Origin
N
S
W E
Minimal Deflection Algorithm
Routing Methods
Superior Capacity
N
W E
Minimal Deflection Algorithm
Routing Methods
Superior Capacity
1.- Clients marqués non routés.
2.- While clients non routés.
2a.- If client non routé (0 direction favorable disponible).
2aa.- Then marqué routé vers X (déflecté).
Else
2ab.- If client pas routé (1 direction favorable disponible) 2ab.1.- If disponibilité en direction demandé,
2ab.1.1 Then routé vers direction. Capacité réduite 2b.- If Direction avec No. requêtes <= Capacité,
2ba.- Then client routé. Valeur capacité réduite Else
2bb.- Client 2 direction fav. dispon. Client routé vers direction fav.
End While
3.- Client marqué X routé vers direction différente disponible.
Clients examinés ordre dynamique sur nombre directions favorables
{
Minimal Deflection Algorithm
Routing Methods
Superior Capacity
Source: Ph.D. Thesis Armando Borrero Molina. French Version
Without Deflection Example
Algo. Rout. Cap.
2ba b N 2ba e N 2ab f S 2ba d S 2ba a E 2ba c E
a b
c
d e
f
(Capacity = 2 cl/link)
a b c e
W S E N
d f N
W
S
E
a b c e
W S E N
d f
Minimal Deflection Algorithm
Routing Methods
Superior Capacity
Origin
Algo. Rout. Cap.
2ab f S S = 2
a b
c
d e
f
a b c e
W S E N
d f N
W
S
E
a b c e
W S E N
d f
Minimal Deflection Algorithm
Routing Methods
Without Deflection Example
Superior Capacity
Origin
Destination
(Capacity = 2 cl/link)
Algo. Rout. Cap.
2ab f S S = 1 2ba d S S = 1
a b
c
d e
f W
N
S
E
a b c e
W S E N
d f
a b c e
W S E N
d f
Minimal Deflection Algorithm
Routing Methods
Without Deflection Example
Superior Capacity
Origin
(Capacity = 2 cl/link)
Algo. Rout. Cap.
2ab f S S = 1 2ba d S S = 0 2ba a E E = 2
a b
c
d e
f W
N
S
E
a b c e
W S E N
d f
a b c e
W S E N
d f
Minimal Deflection Algorithm
Routing Methods
Without Deflection Example
Superior Capacity
Origin
Destination
(Capacity = 2 cl/link)
Algo. Rout. Cap.
2ab f S S = 1 2ba d S S = 0 2ba a E E = 1 2ba c E E = 1
a b
c
d e
f W
N
S
E
a b c e
W S E N
d f
a b c e
W S E N
d f
Minimal Deflection Algorithm
Routing Methods
Without Deflection Example
Superior Capacity
Origin
(Capacity = 2 cl/link)
Algo. Rout. Cap.
2ba b N N = 2 2ab f S S = 1 2ba d S S = 0 2ba a E E = 1 2ba c E E = 0
a b
c
d e
f W
N
S
E
a b c e
W S E N
d f
a b c e
W S E N
d f
Minimal Deflection Algorithm
Routing Methods
Without Deflection Example
Superior Capacity
Origin
Destination
(Capacity = 2 cl/link)
Algo. Rout. Cap.
2ba b N N = 1 2ba e N N = 1 2ab f S S = 1 2ba d S S = 0 2ba a E E = 1 2ba c E E = 0
a b
c
d e
f W
N
S
E
a b c e
W S E N
d f
a b c e
W S E N
d f
Minimal Deflection Algorithm
Routing Methods
Without Deflection Example
Superior Capacity
Origin
(Capacity = 2 cl/link)
Algo. Rout. Cap.
2ba b N N = 1 2ba e N N = 0 2ab f S S = 1 2ba d S S = 0 2ba a E E = 1 2ba c E E = 0
a b
c
d e
f W
N
S
E
a b c e
W S E N
d f a b c e
W S E N
d f
Minimal Deflection Algorithm
Routing Methods
Without Deflection Example
Superior Capacity
Origin
Destination
(Capacity = 2 cl/link)
Origen
N
S
W E
Destino
Routing Methods
Scale Routing
1.- Clients marqués non routés.
2.- While clients pas routés.
2a.- Choisir un client.
2b.- Calculer ratio directions favorables et choisir plus grand.
2c.- If direction plus grand ratio est disponible,
2c1.- Then router client vers direction et marquer non disponible.
Else
2c2.- Calculer ratio directions non favorable et choisir plus grand 2c3.- If direction est disponible,
2c31.- Then client vers direction et marquer non disponible Else
2c32.- Router le client vers l´autre direction.
End While
3.- Envoyer les clients vers les directions affectées.
Scale Routing Algorithm
Routing Methods
(Global Minimization)
Source: Ph.D. Thesis Armando Borrero Molina. French Version
N
x y
E x + 1
y + 1
N
x /(x + y) E y/(x + y)
Calculating Coefficients
Scale Routing Algorithm
Routing Methods
N
S
W E
N
S
W E
N
S
W E
a a’
b’
b
a’
b’ f
g
c d e c d e
f g a
b
(i) (ii) (iii)
Nœud courant Possible Destination
(prochaine étape)
Nœud Destination Caractéristique: Plus court chemin
Choisir l´option qui lui donne plus de choix
Scale Routing Algorithm
Routing Methods
Source: Ph.D. Thesis Armando Borrero Molina. French Version
Pos Coor. Dir. Quot
b (3,5) N 2/6
a (4,4) E 4/6
a’ (3,3) S -3/8 b’ (2,4) W -5/8
1
2
3
W E
Exemple
N
S
N
S
W a E
a’
b’
b
Nœud Courant: Coord. (3,4)
Nœud Destination: 1 Coord. (7,6)
Pos. Favorable Pos. Déflecté
Scale Routing Algorithm
Routing Methods
Metro-Access Networks
Source: Thesis Wavelength Routing for Transparent Metro-Access Interfacing. Performance Simulation.
Warsaw University of Technology. Faculty of Electronics and Information Technology. Institute of Telecommunications
Metro-Access Networks
Source: Thesis Wavelength Routing for Transparent Metro-Access Interfacing. Performance Simulation.
Topologies
Ring PON
Source: Thesis Wavelength Routing for Transparent Metro-Access Interfacing. Performance Simulation.
Warsaw University of Technology. Faculty of Electronics and Information Technology. Institute of Telecommunications
Topologies
Ring PON
Source: Thesis Wavelength Routing for Transparent Metro-Access Interfacing. Performance Simulation.
Topologies
Star PON
Source: Thesis Wavelength Routing for Transparent Metro-Access Interfacing. Performance Simulation.
Warsaw University of Technology. Faculty of Electronics and Information Technology. Institute of Telecommunications
Topologies
Tree PON
Source: Thesis Wavelength Routing for Transparent Metro-Access Interfacing. Performance Simulation.
Topologies
Tree PON
Source: Thesis Wavelength Routing for Transparent Metro-Access Interfacing. Performance Simulation.
Warsaw University of Technology. Faculty of Electronics and Information Technology. Institute of Telecommunications
Topologies
Resource Optimization
Source: Thesis Wavelength Routing for Transparent Metro-Access Interfacing. Performance Simulation.
Warsaw University of Technology. Faculty of Electronics and Information Technology. Institute of Telecommunications
Resource Optimization
Source: Thesis Wavelength Routing for Transparent Metro-Access Interfacing. Performance Simulation.
New Trends
- - Silicon Silicon Photonics Photonics
Source: Nature Photonic Technology Conference. Tokio 2007
- - Silicon Silicon Photonics Photonics
New Trends
- - Silicon Silicon Photonics Photonics
Source: Nature Photonic Technology Conference. Tokio 2007
New Trends
- - Silicon Silicon Photonics Photonics
New Trends
- - Energy Energy Consumption Consumption & “ & “ All All Optical Optical Routers Routers ” ”
New Trends
Source: Nature Photonic Technology Conference. Tokio 2007
- - Energy Energy Consumption Consumption & “ & “ All All Optical Optical Routers Routers ” ”
New Trends
- - Energy Energy Consumption Consumption & “ & “ All All Optical Optical Routers Routers ” ”
Source: Nature Photonic Technology Conference. Tokio 2007
New Trends
- - Fiber Fiber to to the the Home Home (FTTH) (FTTH)
New Trends
DIY
- - Fiber Fiber to to the the Home Home (FTTH) (FTTH)
New Trends
Source: Nature Photonic Technology Conference. Tokio 2007
- - Wireless Wireless Optics Optics
New Trends
- - Optical Optical Networks Networks
New Trends
Source: Nature Photonic Technology Conference. Tokio 2007
- - Quantum Quantum Criptography Criptography
New Trends
- - New New Devices Devices
New Trends
Source: Nature Photonic Technology Conference. Tokio 2007
