zero touch photonic networks: implementation of gmpls for hybrid optical networking

Zero Touch Photonic Networks:Implementation of GMPLS for Hybrid Optical Networking

Gert Grammel

PLM Crossconnect Product Group

Sept 15, 2009

2 | GMPLS for Hybrid Optical Networking | May 2009 All Rights Reserved © Alcatel-Lucent 2009, XXXXX

The challenge Zero Touch Photonics

GMPLS CONTROL PLANE

REAL TIME RESTORATION

HIGH SURVIVABILITY

10/40/100 G LAMBDAS

AUTOMATIC PROVISIONING

OPTICAL PATH FEASIBILITY

A B C D

BCD

A

PLANNING&DESIGN


GMPLS Path computationPath feasibility

When the OSNR and/or NLE thresholds are crossed, the physical path is considered unfeasible

Transponder type (bit rate, modulation format, FEC type…):

Transponder types have different OSNR, NLE and PMD penalties/tolerances

Optical route impairment accumulation (wavelength independent):

OSNR margin: remaining margin before reaching the OSNR Threshold

NLE margin: remaining margin before reaching the Nonlinear Threshold

PMD: accumulated PMD (also influencing the OSNR margin, by imposing a penalty)

NLE1

OSNRLink1

PMDLink1

Section/OMS1

Node1 Node2 Node3 Node4

Path

NLE2

OSNRLink2

PMDLink2

NLE3

OSNRLink3

PMDLink3

Section/OMS2

Section/OMS3


Domain considerations1


Control Plane NetworkingHow to manage growth?

GMPLS / WDM

λ GMPLS control plane

3R3R

ODU/OTH



3R3RODU/OTH


Control Plane Networkingusing E-NNI?


λ GMPLS control plane λ E-NNI

3R3R


ODU E-NNI

3R3R 3R3R





ODU E-NNI

3R3R 3R3R


3R3R

3R 3R

CP architecture forcingTransponder duplication

to cross domains




ODU E-NNI

3R3R 3R3R


3R3R

λ E-NNI

How to decide at the source node which E-

NNI to use?




ODU E-NNI

3R3R 3R3R


3R3R

λ E-NNI E-NNI Network abstraction

does not allow to reliably decide

which way to use: λ or ODU?

How to decide at the source node which E-NNI to use?

λ or ODU?


Control Plane NetworkingIntegrated Control

3R3R

Integrated GMPLS control plane

3R3R

Shared knowledge of optical parameters and 3R resources

3R3R


GMPLS Implementation based on

RFC 3945 Generalized Multi-Protocol Label Switching

Architecture2


GMPLS Path computationPath restoration (functional scheme)

Calculate Path

Hard constraints: SRLG, opt. feasibility

Soft Constraints: Cost, Wavelength

Calculate Path

Hard constraints: SRLG, opt. feasibility


StartStart

Route

found

Route

found

Establish Path e2eEstablish Path e2e

Calculate Path

Hard constraints: SRLG, opt. feasibility, 3R-Regen


Calculate Path

Hard constraints: SRLG, opt. feasibility, 3R-Regen


Route

found

Route

found

Notify operatorNotify operator

yes

no

no

yes


Routing Constraints

Hard constraints are:

Shared Risk Link Group: Diversity constraint imposed by Operator

Transponder type (bit rate, modulation format, FEC type…):

Optical Parameters:

Wavelength available

OSNR margin: remaining margin before reaching the OSNR Threshold

NLE margin: remaining margin before reaching the Nonlinear Threshold

PMD: accumulated PMD (also influencing the OSNR margin, by imposing a penalty)

Soft constraints are:

cost of link: parameter to prefer/avoid a link configured by the operator

GMPLS parametersOptical parameters

S

T

O

c


Routing information:

•Link characteristic: OSNR, NLE, PMD, SRLG, cost

•Available TRBs: capacity, Modulation, tuning capability

•Available Regenerator sites

Example Network

11

22 33

44 5588

99 1010 66 77

1111

Source Node

Tail Node

3R3R 3R3R 3R3R

3R

3R

ST

Oc

S T O c S T O c

S T O c

S T O c S T O c S T O c

STOc

STOc

STOc

STOc

STOc

ST

Oc

ST

Oc

S TO c

S TO c

S TO c

ST

Oc

ST

Oc

S TO c 3R site

Shared Risk Link GroupTransponder typeOptical Parameters: :cost

S

T

O

c


3R3R 3R3R 3R3R

1) Apply Unconstraint Dijkstra Algorithm:find all possible ways from Source to destination

11

22 33

44 5588

99 1010 66 77

1111

1-3-5-7-111-3-5-6-111-3-4-6-111-2-8-10-6-111-2-4-5-6-111-2-4-6-111-2-8-4-6-111-2-3-5-7-11...............

3R3R


2) Apply optical constraints:remove all unfeasible path from the list

NLE1

OSNRLink1

PMDLink1

Section/OMS1


Path

NLE2

OSNRLink2

PMDLink2

NLE3

OSNRLink3

PMDLink3

Section/OMS2

Section/OMS3

11

22 33

44 5588

99 1010 66 77

1111

opt.-constraints: 1-3-5-7-11opt.-constraints: 1-3-5-6-11opt.-constraints: 1-3-4-6-11opt.-constraints: 1-2-8-10-6-11opt.-constraints: 1-2-4-5-6-11opt.-constraints: 1-2-4-6-11opt.-constraints: 1-2-8-4-6-11opt.-constraints: 1-2-3-5-7-11

NOKNOKNOK NOK NOK NOKNOKNOK


3R3R 3R3R 3R3R

3) If list was empty: apply again Dijkstra Algorithm:find all possible ways from Source to destination considering intermediate 3R

11

22 33

44 5588

99 1010 66 77

1111

1-3-5 + 5-7-111-3-5 + 5-6-111-3-4 + 4-6-111-2-8 + 8-10-6-111-2-4-5 + 5-6-111-2-4 + 4-6-111-2-8-4 + 4-6-111-2-3-5 + 5-7-11...............

3R3R


4) Apply optical constraints:remove all unfeasible path from the list

NLE1

OSNRLink1

PMDLink1

Section/OMS1


Path

NLE2

OSNRLink2

PMDLink2

NLE3

OSNRLink3

PMDLink3

Section/OMS2

Section/OMS3

opt.-constraints: 1-3-5opt.-constraints: 1-3-5 opt.-constraints: 1-3-4 opt.-constraints: 1-2-8opt.-constraints: 1-2-4-5opt.-constraints: 1-2-4 opt.-constraints: 1-2-8-4opt.-constraints: 1-2-3-5

opt.-constraints: 5-7-11opt.-constraints: 5-6-11 opt.-constraints: 4-6-11 opt.-constraints: 8-10-6-11opt.-constraints: 5-6-11opt.-constraints: 4-6-11 opt.-constraints: 4-6-11opt.-constraints: 5-7-11

OKOKOK OK OK OKOKOK

OKOKOK NOK OK OKOKOK

with regeneration


5) Optimization: Find path without tuning colors:Prioritize path without re-tuning

opt.-constraints: 1-3-5opt.-constraints: 1-3-5 opt.-constraints: 1-3-4 opt.-constraints: 1-2-8opt.-constraints: 1-2-4-5opt.-constraints: 1-2-4 opt.-constraints: 1-2-8-4opt.-constraints: 1-2-3-5

opt.-constraints: 5-7-11opt.-constraints: 5-6-11 opt.-constraints: 4-6-11 opt.-constraints: 8-10-6-11opt.-constraints: 5-6-11opt.-constraints: 4-6-11 opt.-constraints: 4-6-11opt.-constraints: 5-7-11

OKOKOK OK OK OKOKOK

OKOKOK NOK OK OKOKOK

c=5c=5 c=5 c=6c=5c=6c=6

hard constraints soft constraints

3R3R 3R3R 3R3R

11

22 33

44 5588

99 1010 66 77

1111

3R

3R


Summary

•Hybrid optical Networks must deal dynamically with 3R resources and optical parameters thereby integrating 2 layer information in one control plane

•Control plane concepts enforcing administrative boundaries are suitable for multi-vendor/multi-domain networks but are not cost efficiently address regeneration issues in single-vendor hybrid optical networks.

•Experience in deployed networks confirm that control plane performance is not critical.


Acknowledgements

We acknowledge gratefully that part of this work

has been supported by the German Ministry for

Research and Education (BMBF) under the EUREKA

project “100GET—100Gbit/s Carrier-Grade Ethernet

Transport Technologies” (grant 01BP0720).


Material:What’s going on …

1. ITG-Fachtagung (Leipzig) May, 4 2009:

Implementation of GMPLS for Hybrid Optical Networking

Gert Grammel

2. Sept, 8 2009 [Docs] [txt] [pdf] [WG] [Email] [Diff1] [Diff2] [Nits]

Versions: (draft-ietf-ccamp-wavelength-switched-framework) 00 01 02 03

Network Working Group Y. Lee (ed.) Internet Draft Huawei Intended status: Informational G.

Bernstein (ed.) Expires: March 2010 Grotto Networking Wataru Imajuku NTT September 8,

2009 Framework for GMPLS and PCE Control of Wavelength Switched Optical

Networks (WSON) draft-ietf-ccamp-rwa-wson-framework-03.txt

3. Oct, 1 2009 http://ieeexplore.ieee.org/stamp/stamp.jsp?

tp=&arnumber=4982668&isnumber=5210716

JOURNAL OF LIGHTWAVE TECHNOLOGY, VOL. 27, NO. 19, OCTOBER 1, 2009; Accounting for

Shared Regenerators in GMPLS-Controlled Translucent Optical Networks; Nicola Sambo,

Alessio Giorgetti, Filippo Cugini, Nicola Andriolli, Luca Valcarenghi, Member, IEEE, and

Piero Castoldi, Member, IEEE


www.alcatel-lucent.comwww.alcatel-lucent.com

zero touch photonic networks: implementation of gmpls for hybrid optical networking

Documents

implementation of gmpls

remaining margin

osnr thresholdnle margin

different osnr

feasibilitysoft constraints

physical path

rregensoft constraints

fec type