Framework for Path Finding in Multi-Layer Transport Networks

(1)

Freek Dijkstra

19 juni 2009

SARA Reken- en Netwerkdiensten

Framework for

Path Finding in

Multi-Layer

Transport Networks

Freek Dijkstra

– SARA

with help of:

Ronald van der Pol

– SARA,

Rob Juffermans

– SARA / Technische Universiteit Delft

Jeroen van der Ham

– Universiteit van Amsterdam

,

Fernando Kuipers

– Technische Universiteit Delft,

(2)

Applications

(3)

Freek Dijkstra

19 juni 2009

SARA Reken- en Netwerkdiensten

Tiled Panel Display

Ultra high resolution display

e.g. 4K video viewing

Remote collaboration

e.g. HD videoconferencing, multi-modal visualization

Parameter studies

e.g. climate research

Source: Ray Idaszak, RENCI

Source: Oak Ridge National

Center for Supercomputing

Source: SARA

Source: Tijs de Kler, SARA

Requires high bandwidth

4K video uncompressed: 7.6 Gb/s

8K video uncompressed: 24 Gb/s

Requires low latency

Requires large storage / computing capacity

Visualization apps that require network. Di

ff

erent network requirements.

Demos: ESSENCE (climate research), Flysafe (plane bird collision avoidance)

(4)

Freek Dijkstra

19 juni 2009

SARA Reken- en Netwerkdiensten

Videoconferencing demo

Brno

Amsterdam

Internet

(GÉANT2 network)

No jumbo packets (> 1500 bytes)

Jitter (fluctuating latency)

(5)

Freek Dijkstra

19 juni 2009

SARA Reken- en Netwerkdiensten

Lambda Networking

(Dedicated Circuits)

GLIF world map. Source: Maxine Brown and Robert Patterson.

See www.glif.is

Lightpaths

GLIF: Global Lambda Integrated Facility.

(6)

Freek Dijkstra

19 juni 2009

SARA Reken- en Netwerkdiensten

Videoconferencing demo

Brno

Amsterdam

CzechLight only supports LEX adaptation.

GLIF “standard” is to use GFP adaptation.

NetherLight supports both LEX and GFP adaptation.

Only 1 Gb/s circuit possible.

10 Gb/s link

NetherLight

CzechLight

2 Gb/s circuit required

SDH only support WAN PHY (10 Gb/s) or 1 Gb/s. Not 2 Gb/s. 10 Gb/s not

possible due to other users.

(7)

Freek Dijkstra

19 juni 2009

SARA Reken- en Netwerkdiensten

Videoconferencing demo

Brno

Amsterdam

VLAN-based circuits (instead of SDH-based circuit)

Took time to resolve packet fragmentation problem.

Chicago-Amsterdam went down Thursday morning

Switch broke down at CzechLight Thursday evening

10 Gb/s link

NetherLight

CzechLight

StarLight (Chicago)

10 Gb/s link

(8)

Example

First, I like to talk about the background of our work.

I’m not formally employed by Phosporous or FEDERICA (Bert Andree is).

I and Jeroen van der Ham did most of the work of the network modelling and the Network

Description Language.

(9)

Freek Dijkstra

19 juni 2009

SARA Reken- en Netwerkdiensten

Université

du Quebec

CAnet

Canada

Universiteit

van

Amsterdam

StarLight

Chicago

MAN LAN

New York

NetherLight

Amsterdam

Gigabit Ethernet

OC-192

2x OC-192

GE

can adapt GE

in STS-24c

can adapt GE in

STS-24c or STS-3c-7v

can adapt GE

_{in STS-3c-7v}

(22 free)

(38 free)

(87 free)

(63 free)

Historic Example

(modified)

Path finding through multi-layer networks is hard. In fact, I claim that

link-constrained algorithms are not su

ffi

cient. This is a counter example that

proves this claim.

(10)

Freek Dijkstra

19 juni 2009

SARA Reken- en Netwerkdiensten

Gigabit Ethernet

OC-192

2x OC-192

GE

can adapt GE in

STS-24c or STS-3c-7v

(22 free)

(38 free)

(87 free)

(63 free)

Historic Example

(modified)

Université

du Quebec

CAnet

Canada

Universiteit

van

Amsterdam

StarLight

Chicago

MAN LAN

New York

NetherLight

Amsterdam

can adapt GE

in STS-24c

can adapt GE

in STS-3c-7v

First attempt: invalid path, since adaptation of GE in STS-24c is not

compatible with adaptation of GE in STS-3c-7v.

(11)

Freek Dijkstra

19 juni 2009

SARA Reken- en Netwerkdiensten

Gigabit Ethernet

OC-192

2x OC-192

GE

can adapt GE in

STS-24c or STS-3c-7v

(22 free)

(38 free)

(87 free)

(63 free)

Historic Example

(modified)

Université

du Quebec

CAnet

Canada

Universiteit

van

Amsterdam

StarLight

Chicago

MAN LAN

New York

NetherLight

Amsterdam

can adapt GE

in STS-24c

can adapt GE

in STS-3c-7v

Second attempt: this is an invalid path because there are only 22 free STS

channels between CA*net and StarLight, but 24 are required.

(12)

Freek Dijkstra

19 juni 2009

SARA Reken- en Netwerkdiensten

Gigabit Ethernet

OC-192

2x OC-192

GE

can adapt GE in

STS-24c or STS-3c-7v

(22 free)

(38 free)

(87 free)

(63 free)

Historic Example

(modified)

Université

du Quebec

CAnet

Canada

Universiteit

van

Amsterdam

StarLight

Chicago

MAN LAN

New York

NetherLight

Amsterdam

can adapt GE

in STS-24c

can adapt GE

in STS-3c-7v

This is the shortest path through this network. You can not just consider one layer

in this example: Quebec and Amsterdam do not even know about SDH. MAN LAN

does not understand Ethernet. Adaptations are important. We need a new path

finding algorithm.

(13)

(14)

Freek Dijkstra

19 juni 2009

SARA Reken- en Netwerkdiensten

Goal

Create a

computer-readable

network description

, that provides

enough

information for path

finding

in

multi-layer networks

Network Description

Language (NDL)

What is NDL?

(15)

Freek Dijkstra

19 juni 2009

SARA Reken- en Netwerkdiensten

Functional

Elements

Network

Elements

Syntax

<

ndl:Device

rdf:about

="

#Force10

">

<

ndl:hasInterface

rdf:resource

=

"

#Force10:te6/0

"/>

</

ndl:Device

>

<

ndl:Interface

rdf:about

="

#Force10:te6/0

">

<

rdfs:label

>te6/0</

rdfs:label

>

<

ndl:capacity

>1.25E6</

ndl:capacity

>

<

ndlconf:multiplex

>

<

ndlcap:adaptation

rdf:resource

=

"

#Tagged-Ethernet-in-Ethernet

"/>

<

ndlconf:serverPropertyValue

rdf:resource

="

#MTU-1500byte

"/>

</

ndlconf:multiplex

>

<

ndlconf:hasChannel

>

<

ndlconf:Channel

rdf:about

=

"

#Force10:te6/0:vlan4

">

<

ndleth:hasVlan

>4</

ndleth:hasVlan

>

<

ndlconf:switchedTo

rdf:resource

=

"

#Force10:gi5/1:vlan7

"/>

</

ndlconf:Channel

>

</

ndlconf:hasChannel

>

</

ndl:Interface

>

The Modelling Process

- Network elements: physical devices

- Map to functional elements (G.805 elements, graphs, etc.)

- Describe model in a concise, but compact syntax (e.g. NDL, OSPF-TE LSA’s,

etc.)

* It is easy to translate between two syntaxes.

* It is hard to convert between two models.

(16)

Freek Dijkstra

19 juni 2009

SARA Reken- en Netwerkdiensten

Ethernet layer

STS layer

UTP layer

OC-192 layer

Ethernet

device

Ethernet

device

SONET

switch

SONET switch

with Ethernet

interface

G805: multi layer network

Functional Elements

There are no models to describe state changes (= capabilities).

(17)

Freek Dijkstra

19 juni 2009

SARA Reken- en Netwerkdiensten

0..1

*

hasInterface

Instantiated Mux

Interface

ingressLabelSet:

LabelSet

egressLabelSet:

LabelSet

Potential Mux

Interface

*

connectedTo

*

connectedTo

0..1

linkTo

0..1

switchedTo

0..1

*

hasSwitchMatrix

0..1

*

hasInterface

0..1

*

1 *

clientLayer

1 *

serverLayer

0..1

*

hasInterface

0..1

*

hasDevice

0..1

*

inAdminDomain

0..1

_*

hasService

0..1

*

inAdminDomain

0..1

*

locatedAt

1 *

adaptation

clientInterface

serverInterface

Topology

Layer

Capability

Domain

Physical

UML representation of NDL schemas

0..1

*

hasSwitchMatrix

2008-12-20

0..1

*

0..1

switchedTo

*

linkTo

*

0..2

linkTo

Static Interface

Broadcast

Segment

Link

Path

Cross Connect

ingresslabel: Label

egresslabel: Label

Interface

ingressLabelSet:

LabelSet

egressLabelSet:

LabelSet

Configurable

Interface

Network Element

TransportNetwork

Element

address

geo84 coords

room

facility

rack

panel

Location

_blade

chassis

slotnumber

manufacturer

serialnumber

Physical Element

switchingCapability

swappingCapability

hasCastType:

{UniCast,

Cast, BroadCast}

memoryBuffer

SwitchMatrix

address

Administrative

Domain

Device

Network Domain

capacity

Connection Point

clientCount

serverCount

Adaptation

Function

Layer

Adaptation

Property

accessmethod

informationview

serviceStage

realm

scope

timeout

Service

LabelSet

*

segments

*

hops

(18)

Freek Dijkstra

19 juni 2009

SARA Reken- en Netwerkdiensten

Administrative Domain

Network Domain

Device

Switch Matrix

(

Logical

)

Interface

in admin domain

has device

has switch matrix

has interface

in admin domain

Location

has switch matrix

(19)

Network Description

Language

(20)

Freek Dijkstra

19 juni 2009

SARA Reken- en Netwerkdiensten

<

Domain

“#StarLight”>

<

hasInterface

>

<

Interface

“#intf3”>

<

connectedTo

“http://internet2.edu/

manlan.rdf#intf8”/>

<

“ http://internet2.edu/

manlan.rdf”/>

</

Interface

>

</

hasInterface

>

</

Domain

>

StarLight

Chicago

intf3

intf8

MAN LAN

http://internet2.edu/manlan.rdf

http://startap.net/starlight.rdf

<

Domain

“#MANLAN”>

<

hasInterface

>

<

Interface

“#intf8”>

<

connectedTo

“http://startap.net/

starlight.rdf#intf3”/>

<

“ http://startap.net/

starlight.rdf”/>

</

Interface

>

</

hasInterface

>

</

Domain

>

RDF Based Syntax

Every domain publishes its own data. The seeAlso connect the di

ff

erent data

publications together. This is a distributed topology description.

(21)

Freek Dijkstra

19 juni 2009

SARA Reken- en Netwerkdiensten

Different Subtopics

Topology

First NDL schema. Recent addition: Path description

Device capabilities

Configurable Interfaces, switching & swapping capability.

Layer specification

Definition of different technologies: Layer, Label, Adaptation, etc.

Device configuration

Internal connections, available labels (e.g. free VC-4 channels)

Domain aggregation

Functional (network domain) and organizational (admin domain)

Physical properties

(22)

Freek Dijkstra

19 juni 2009

SARA Reken- en Netwerkdiensten

Technology

Description

Network

(23)

Freek Dijkstra

19 juni 2009

SARA Reken- en Netwerkdiensten

Technology Properties

Layer = Specific Encoding

(1 technology: >1 layers)

Adaptations

(from ITU-T G.805)

Label = Channel Identifier and

Switching Capability Identifier

(from GMPLS)

Other layer-specific properties

e.g. MTU size, power level

Ethernet

SONET/SDH

ATM

WDM

Physical layer

Fiber bundle

IP

Wireless

(24)

Freek Dijkstra

19 juni 2009

SARA Reken- en Netwerkdiensten

Standardization

Network Markup Language (NML)

working group

Participants:

cNIS (GÉANT / Dante)

UNIS (PerfSONAR model)

Internet2, ESnet

NDL University of Amsterdam (NDL)

https://forge.gridforum.org/sf/projects/nml-wg

The goal of the NML-WG is to create a multi-layer network model. Agreed was to

make a model in UML, and allow descriptions in XML and RDF.

Discussions are about e.g. definition of domain, network, identifiers (name vs.

address), etc.

(25)

(26)

Freek Dijkstra

19 juni 2009

SARA Reken- en Netwerkdiensten

SONET Layer

Network

Ethernet

Layer

Network

GE in STS-24c

GE in

STS-3c-7v

GE in ST-24c or

STS-3c-7v

Amsterda

Nether

Light

Quebec

StarLight

StarLigh

CA*net

MAN

LAN

Université

du Quebec

CAnet

Canada

StarLight

Chicago

MAN LAN

New York

NetherLight

Amsterdam

can adapt GE

in STS

-24

c

can adapt GE in

STS

-24

c or

STS

-3

c

-7

v

can adapt GE

in STS

-3

c

-7

v

Universiteit

van

Amsterdam

OC-192

GE

mapping of the network to function elements. (domains & devices

→

subnetwork; links

→

link connections; adaptations; logical interface

→

(27)

Freek Dijkstra

19 juni 2009

SARA Reken- en Netwerkdiensten

UTP

Layer

Network

1 1a

7a

7 Fiber

Layer

Network

2 ₄

2

3 ₃

4

5

6

5

6 Lambda

Layer

Network

2 ₄

2

3 ₃

4

5

6

5

6

1 1a

7a

7

1 1a

7a

7 OC

Layer

Network

CA*net

Star

Light

Nether

Light

MAN

LAN

CA*net

Star

Light

MAN

_LAN

Nether

_Light

1b

1c

2

4

2

3 7c

7b

5

6

5

6

3

4 VC-4

Layer

Network

Star

Light

Quebec

Amster

dam

Ethernet

Layer

Network

Quebec

Amster

dam

1 1a 1b

2

3 7b

7a

7 Star

Light

(28)

Freek Dijkstra

19 juni 2009

SARA Reken- en Netwerkdiensten

Path Find Algorithm

Quebec

CAnet

StarLight

MAN LAN

NetherLight

Amsterdam

Graph of logical interfaces (each colour is a di

ff

erent layer).

Diamond shapes are switch matrices (subnetworks in G.805).

Labels are adaptations functions. Labels are not represented in this

visualization.

(29)

(30)

Freek Dijkstra

19 juni 2009

SARA Reken- en Netwerkdiensten

Hybrid network

IP routed & lightpaths

Over 8800 km dark fiber

Cross border fibers

Hamburg

Muenster

Aachen

Over 250 lightpaths

(31)

OADM

Amplifier

Dordrecht1

Breda1

Tilburg1

NLR

40 km

Tilburg

70 km

Amsterdam1

Terminal

BT

Surfnet6 Photonic Layer

Zutphen1

Lelystad1

Sub network 4:

Blue Azur

Subnetwork 3:

Red

Sub network 1:

Green

Subnetwork 2:

Dark blue

Subnetwork 5:

Grey

Emmeloord

Zwolle1

Venlo1

Glassthrough

Enschede1

Leeuwarden

Harlingen

Den Helder

Alkmaar1

Haarlem1

Assen1

Meppel1

Emmen1

Alkmaar

Haarlem

Non-DWDM sections

Arnhem

Apeldoorn1

Bergen-op-Zoom

Zierikzee

Middelburg

Vlissingen

Krabbendijke

Breukelen1

Ede

Heerlen2

DLO

Schiphol-Rijk

Hilversum1

Hoogeveen1

Lelystad2

Dwingeloo1

Den Bosch1

Utrecht1

Nieuwegein1

Heerlen1

Nijmegen1

Rotterdam4

3XLSOP

Winschoten1

Middenmeer1

NNI

InHolland

Schiphol

Oegstgeest

Lisse

Zoetermeer

LSOP Rtd

SWOV

NBD

DenHaag

Rotterdam1

Delft1

Leiden1

Amsterdam1

Roermond1

Sittard1

Venlo2

Maastricht7

Muenster1

Almere1

TNO

Soesterberg

Wageningen1

Groningen1

Hamburg

Aaken

Maastricht1

Beilen1

Amsterdam2

Thin OADM

Amersfoort1

Eindhoven1

ROADM

CPL spur

ROADM

Photonic_Layer

Page no. 1

SURFnet Blueprint/Blueprint_diagrams_2.37

3/16/2009

Freek Dijkstra - Planning Tool | 17 maart 2009

SARA Reken- en Netwerkdiensten

SURFnet6 - WDM layer

Rings don’t close, but terminate in Amsterdam1 (SARA) and Amsterdam2 (Telecity).

Consider red ring: Asd2-Amf-Wageningen-Nijmegen-Enschede-Zwolle-Asd1

(32)

Ut001A_ OME02 Gv001A_ O1E03

DAS-3

‘Sandbox‛

CPL Red

CPL Green

CPL Red

Bd001A_ OME01 10 A sd 00 1A _ O M E0 1 A sd 00 1A _ O M E0 2 A sd 00 2A _ O M E0 1 A sd 00 2A _ O M E0 2 Asd002A_ OME03 Asd002A_ OME04 Asd002A_ OME05 Asd002A_ OME06 Asd002A_ OME07 Gn001A_ OME01 Tb001A_ OME01 CPL OME6500 OM5000 COLAN COLAN X 1X N/A COLAN A N/A ILAN 1 ILAN In 2X ILAN 2 ILAN Out N/A Ethernet Wayside N/A N/A DCN External DCN Connection x Ethernet Straight Ethernet with Crossover

DCN Cables and Connections

CPL logical OSC wayside Connection Gv001A_ O1E02 Asd001A_ OME08 5

CPL Green

Asd001A_ OME03 10 5 Asd001A_ OME04 ₉ 4 5 6 Asd001A_ OME05 9 10 5 6 Asd001A_ OME06 10 5 6 Asd001A_ OME07 9 10 9 9 10 5 6 10 5 6 Ledn001A_ OME016 9 4 5 Gv001A_ OME02 6

CPL Green

Hvs001A_ OME01 9 6 Ledn001A_OME01 2x Ut001A_OME01 Hvs001A_OME01 9 6

CPL Blue

Ht001A_ OME01 9 6 Ehv001A_ OME01 10 9 11 6

CPL Blue

5 9 10 6

CPL Blue

2x 2x 2x 2x Ddt001A_ OME01 9 5 6 9 Rt001A_OME01 10 6

CPL Blue

2x

CPL Blue

Rt001A_OME01 Ddt001A_OME01 Tb001A_OME01 2x Ehv001A_OME01 + Ehv001A_OME02 Rt001A_OME01 Ddt001A_OME01 Tb001A_OME01 Ehv001A_OME01 slot 6 9 10 5 6 10 5 6 Boz001A_ OME01 11 6 4 9 Zr001A_ OME01 11 6 4 9 Mdb001A_ OME01 11 6 4 9 Vs001A_ OME01 11 6 4 9 Kb001A_ OME01 11 6 4 9

CPL Red

Wg001A_ OME01 9 6 Nm001A_ OME01 6 5 4

CPL Red

Es001A_ OME01 5 9 10 6

CPL Red

Zl001A_ OME01 5 10 9 6

CPL Grey

Mt001A_ OME01 5 9 6

CPL Grey

9 Ah001A_ OME01 5 9 6 Ap001A_ OME01 5 9 6 ? 9 2 6

CPL Azur

Dgl001A_ OME01 9 6

CPL Azur

1 4 14 5 9 10 5 6 9 10 5 6 10 5 12 9 10 5 6 9 6 Wg001A_OME01 2x Nm001A_OME01 Es001A_OME01 2x Zl001A_OME01

CPL Azur

Wg001A_OME01 Zl001A_OME01 Es001A_OME01 Dgl001A_OME01

CPL Green

2x Ledn001A_OME01 Dt001A_OME01 Gv001A_OME01 Ut001A_OME01 Hvs001A_OME01

CPL Blue

2x Ehv001A_OME01

CPL Red

Nm001A_OME01-port11 Nm001A_OME01-port9

CPL Azur

Ledn001A_OME01-port9 Gv001A_OME01 Dt001A_OME01 Ut001A_OME01 slot 6 Rt001A_OME01 Ht001A_OME01 Tb001A_OME01 Wg001A_OME01 Es001A_OME01 Gn001A_OME01 Dgl001A_OME01

Surfnet_Network_Design_Drawing-NDD-v1.32.vsd

LEGENDA

10G line

2.5G line

9 10 Ehv001A_OME01 slot 9 Gn001A_OME01 Hvs001A_OME01 6

HDXc

8a 8b 5 Bd001A_ O1 Asd002A_ O1 1 Ap001A_ O1 Ah001A_ O1 Gv001A_ O1 Es001A_ O1 Gn001A_ O1 Hvs001A_ O1 Tb001A_ O1 Ut001A_ O1 Wg001A_ O1 Vs001A_ O1 Mdb001A_ O1 Kb001A_ O1 Boz001A_ O1 Zl001A_ O1 2 4 11 2 2 2 2 2 x x x x x x x x 13 14 Ehv001A_ O1 5 Ht001A_ O1 Ut001A_ O2 12 13 Ledn001A_OME01 Ledn001A_OME01 12 Ut001A_OME01 slot 6 Nm001A_OME01 port 3 12 Nm001A_OME01 port 4 Zl001A_OME01-port10 6 3 11 12 11 11 13 11 11 11 11 11 11 11 11 14 13 12 14 13 12 13

CPL Red

11 11 x2 x4 x4 x3 x1 x1 x3 x2_x2

Muenster

_{Msr001A_OME01}1 2 Alr001A_ OME01 6 10 9 Amf001A_ OME01 9 6 Alr001A_OME01 Amf001A_OME01

Click View ->

Layer properties

to select layers

to be viewed

Gv001A_OME01 Dt001A_OME01 Gv001A_OME01 Dt001A_OME01 Vl002A_ OME01 9 6 Rm001A_ OME01 9 6 Std001A_ OME01 6 9 Mt007A_ OME01 6 9 11 Nm001A_ O1 Alr001A_ O1 12

Active Layers

Layer Type

Planned

Post

Asd001A_ OME21 1 2 Lls001A_ OME01 6 9 Gen001A_ OME01 Rt001A_ O2

Phy:

Synch:

DCN:

Transparent HDX MS DCCr Asd001A_ O1 Asd001A_ O2 3 12 Ehv001A_OME01 slot10 12 Ehv001A_OME01 port 11 Ed001A_ OME01 6 9 Ws001A OME01 6 Emn001A_ OME01 6 9 Hgv001A_ OME01 6 9 Asn001A_ OME01 9 6 Mp001A_ OME01 6 9 Lw001A_ OME01 11 9 2 Hl001A_ OME01 1 Mdmr001A_ OME01 2 Hedr001A_ OME01 6 Amr001A_ OME01 10 Hlm001A_ OME01 9 6 Asd003A_ OME01(VU) 6 9 Asdx003A_OME01(VU) Asd003A_OME01(VU) Lw001A_ O1 Ws001A_ O1 Emn001A_O1 Rt002A_ OME01 14 13 Asd001A_ OME09 65 9 10 Asd006A_ OME01 4 11 Asd009A_ OME01 6 11 Asd011A_ OME01 6 9 Asd012A_ OME01 6 9 2x 2x 2x Amr001A_ O1

CPL Hamburg

Hb001A_OME01(3x) Asd001A_

OME231 23 Hb001A_OME01 123

Dt001B_ OME02 1234 Dt008A_ OME0156910 9 5 10 3 9 5 2 11 13 Bd001A_ O2 Ehv001A_ O2 Es001A_ O2 Gn001A_ O2 Tb001A_ O2 Zl001A_ O2 Amr001A_ O2 Gn001A_ TSV01 Tb001A_ TSV Ehv001A_ TSV 9 1 6 13 5 6 Ut001A_ OME01 13 9 14 6 Asd001A_ OME225 61234 Gv002A_ OME01 6 9 Gv008A_ OME01 11 4 Asd003A_ OME02 1 2 34 Ledn001A_ OME02 1234 Dt001B_ OME01 4 9 12 6 Dt001A_ O1 Dt008A_ O1 Ztm004A _OME01 69 2x 2x Spl001B_ OME01 6 9 Schiphl001B_OME01 Schiphl001B_OME01 Spl001B_ O1 Gv001A_ OME01 9 6 9 12 5 2x 12 14 Ut001A_OME01 slot 12 2x CBF Muenster 2 12 12 3 DAS3 regenDAS3 regen

13 Ut001A_OME01 slot 11 10 12 12 11 10 13 11 14 5 Ut015A_ OME01 9 6 14 Lls001A_ O1 9 6 13 10 10 14 11 12 2 10 14 Mt001A_ O1 Ehv001A_ OME02 Aac001A _OME01 Ledn001A_ O2 Ledn001A_ O1 1 1 1 1 14 10 12 Asd001A_ OME10 5 9 6 10 10 5 11 11 12 Rt001A_ O1 Ut001A_ OME01 9 6 5 10 13 13 Msr001A_OME01 slot9 Msr001A_ OME01 249 Asd002A_ OME21 1 2 3 Ah003A_ OME01 9 6 11 12

Freek Dijkstra - Planning Tool | 17 maart 2009

SARA Reken- en Netwerkdiensten

SURFnet6 - TDM layer

TDM (OME) act like optical add-drop multiplexers. Each OME only breaks out a single

wavelength, not all wavelenghts!

(33)

Freek Dijkstra

19 juni 2009

SARA Reken- en Netwerkdiensten

Lightpaths in SURFnet6

Type

Total

150 Mbps

300 _Mbps

450 _Mbps

600 _Mbps

750 _Mbps

900 _Mbps

1 Gbps

10 Gbps

unprotected

₃₉

₇

₀

₃₂

₄

protected

₈₇

₂₃

₃

₁

₃

₀

₅₆

₀

redundant

₁₅₂

₅₀

₂₁

₄

₆

₀

₄

₆₇

₀

For unprotected path: Dijkstra algorithm

For protected path: Suurballe algorithm

but...

(34)

Freek Dijkstra - Planning Tool | 17 maart 2009

SARA Reken- en Netwerkdiensten

Shared Risk Link Groups

(SRLG)

A

D

B

C

SRLG1

SRLG2

(35)

Freek Dijkstra - Planning Tool | 17 maart 2009

SARA Reken- en Netwerkdiensten

Shared Risk Link Groups

(SRLG)

A

D

B

C

SRLG1, SRLG2

SRLG2

SRLG1

(36)

Freek Dijkstra - Planning Tool | 17 maart 2009

SARA Reken- en Netwerkdiensten

Shared Risk Resource Groups

SURFnet6

~5 Shared Risks due to physical restrictions (same street)

~27 Shared Risks due to use of different wavelength in a fibre

Total: 32 Shared Risk Link Groups

2^32 = 4294967296 possible combinations of SRLGs to test.

Prevent Single Point of Failures for backup connections

Don’t use the same link twice

Don’t use the same device twice

Don’t use the same site twice

NP-hard problem

Maximum running time of each algorithm is non-polynomial ∝(n

2 _{), but}

exponential ∝(2

n

_{) with the number of nodes n.}

Algorithm implemented by Rob Juffermans

(under supervision of TU Delft)

(37)

Freek Dijkstra - Planning Tool | 17 maart 2009

SARA Reken- en Netwerkdiensten

(38)

Freek Dijkstra - Planning Tool | 17 maart 2009

SARA Reken- en Netwerkdiensten

(39)

Freek Dijkstra - Planning Tool | 17 maart 2009

SARA Reken- en Netwerkdiensten

(40)

Freek Dijkstra - Planning Tool | 17 maart 2009

SARA Reken- en Netwerkdiensten

(41)

Freek Dijkstra - Planning Tool | 17 maart 2009

SARA Reken- en Netwerkdiensten

3-Way Backup Paths

(Heuristic Algorithm)

Amf

Zl

Asd2

Asd1

100

300

300 R

e

d

W D M

r

i n

g

centre stage

(42)

Freek Dijkstra - Planning Tool | 17 maart 2009

SARA Reken- en Netwerkdiensten

3-Way Backup Paths

(Heuristic Algorithm)

Amf

Zl

Asd2

Asd1

100

300

300 SRLG1

SRLG2

SRLG3

(43)

Freek Dijkstra - Planning Tool | 17 maart 2009

SARA Reken- en Netwerkdiensten

Attribution

Jeroen van der Ham

Rob Juffermans

Fernando Kuipers

Ronald van der Pol

(44)