Network and Capacity Planningin SURFnet6

(first results)Ronald van der Pol

<rvdp@sara.nl>

TNC2009, 8-11 June 2009, Malaga, Spain

SURFnet6Hybrid networkIP routed & lightpathsOver 8800 km dark fiberCross border fibers

HamburgMünsterAachen

Over 200 lightpaths

TNC2009, 8-11 June 2009, Malaga, Spain

SURFnet6 Lightpath Usage

TNC2009, 8-11 June 2009, Malaga, Spain

Lightpaths in SURFnet6Type Total 150

Mbps300Mbps

450Mbps

600Mbps

750Mbps

900Mbps

1 Gbps

10 Gbps

unprotected 43 7 0 0 0 0 0 32 4

protected 87 23 3 1 3 0 0 56 0

redundant 76 25 10 2 3 0 2 34 0

TNC2009, 8-11 June 2009, Malaga, Spain

Lightpath Duration and Provisioning Activity

TNC2009, 8-11 June 2009, Malaga, Spain

Planning Tool

Used for lightpath planningIn-house built tool, open sourceWritten in Java (previous version written in Perl)Web application based on JSP and ServletsRuns on Apache TomcatDijkstra Shortest Path for unprotected lightpathsSuurballe Shortest Cycle for protected lightpathsAdapted Dijkstra Algorithm for (SRLG) contraint based protected lightpathsConfiguration file for defining metrics

Cost per interface or link (based on regular expressions)Cost based on link utilisation

TNC2009, 8-11 June 2009, Malaga, Spain

Planning Tool Building Blocks

TL1 Toolkit Perl script extracts topology from networkAlways up to date informationNeighbour information based on section traces

Network topology stored in NDL formatNetwork Description Language

TL1 Toolkit Perl script extracts configuration data from network

Retrieves resource usage of all currently configured lightpaths from the networkAll data is stored in MySQL databaseMySQL database also contains lightpath reservations (resources reserved, but not configured in network yet)

TNC2009, 8-11 June 2009, Malaga, Spain

Planning Tool Architecture

TNC2009, 8-11 June 2009, Malaga, Spain

Planning Tool Algorithm

1. Read NDL topology and build mathematical graph2. Read current resource usage from database3. Prune links with too little available bandwidth from graph4. Run path finding algorithm5. Reserve resources in database

TNC2009, 8-11 June 2009, Malaga, Spain

Planning Tool User Interface

TNC2009, 8-11 June 2009, Malaga, Spain

Path Finding and SRLG

SRLG: Shared Risk Link GroupFibers going through the same ductWavelengths going over the same fiber

In general, finding a protected path with SRLG constraints is an NP-complete problemSURFnet6 has topology with several rings starting and ending at two locations in AmsterdamMost SRLGs are wavelengths over the same fiberLimited number of possible paths, therefore path found in less than a second

TNC2009, 8-11 June 2009, Malaga, Spain

SURFnet6 DWDM Topology

TNC2009, 8-11 June 2009, Malaga, Spain

Analysis of SURFnet6

SURFnet6 contains almost 300 lightpathsQuestion: are these lightpaths optimally routed?

First lightpaths were planned manuallyNetwork evolved (links added, more capacity)Protected lightpaths found with 2x Dijkstra (Suurballe algorithm very recent addition)

Analysis with two strategies:Replanning all lightpaths on empty networkRemove and replan each lightpath (keep all other lightpaths the same)

TNC2009, 8-11 June 2009, Malaga, Spain

Analysis Results

Potentially 47 lightpaths in SURFnet6 are not optimally routedThere is no difference between rerouting on an empty network and per lightpath reroutingFurther detailed analysis neededExample of some optimisations:

ID # interfaces After reroute(existing network)

After reroute(empty network)

2030LE 6 4 4

2032IE 8 6 6

2112LP 12 10 10

2098LP 16 14 14

TNC2009, 8-11 June 2009, Malaga, Spain

Thank YouRonald van der Pol

rvdp@sara.nlhttp://nrg.sara.nl/

AcknowledgementsFreek Dijkstra (SARA)

Rob Juffermans (TU Delft)Wouter Huisman (SURFnet)

Funded byGigaPort2SURFnet

TNC2009, 8-11 June 2009, Malaga, Spain