Embed Size (px)
Citation preview
Page 1
Net2PlanOpen Source Network Planner
Communication Network Design Lab(course of Prof. Massimo Tornatore)
Lab Session #1
Omran Ayoub, Leila AskariDept. of Electronics, Information and Bioengineering
Politecnico di MilanoPiazza Leonardo da Vinci 32 - 20133 Milan, Italy
Page 2
Email & Website
• Website
– http://ayoub.faculty.polimi.it/teaching/cnd/
• contains downloadable lab material
– Net2plan.com
• contains documentation, forum, etc
• Office hours possible by appointment
Page 3
Schedule & Topics Covered
• Session 1: Friday 08/11/2019
– Introduction to Net2Plan
– Flow Formulation
• Task to be done in class
• Session 2: Monday 11/11/2019
– Route Formulation
• With and without wavelength continuity
• 2 tasks to be done in class
Page 4
Schedule & Topics Covered
• Session 3: Friday 15/11/2019
– Elastic Optical Networks
– Heuristic algorithm for Routing and Spectrum Assignment (RSA)
• Task to be done in class
• Session 4: Monday 18/11/2019
– IPoWDM Network Design
• Task to be done in class
– Projects’ presentation from Nokia
Page 5
SESSION 1
Page 6
Outline
• Introduction to Net2Plan
– What is Net2Plan? Why is it used?
• Demo
– How to use Net2Plan? Example network scenario
• Flow Formulation in Net2Plan
– Splittable and unsplittable flows
– Task #1
Page 7
Outline
• Introduction to Net2Plan
– What is Net2Plan? Why is it used?
• Demo
– How to use Net2Plan? Example network scenario
• Flow Formulation in Net2Plan
– Splittable and unsplittable flows
– Task #1
Page 8
Introduction to Net2Plan
• Net2Plan
– Network Planner: Tool to create, plan and simulate telecom network instances
– Allows to integrate user-made algorithms to perform studies and simulations
• Static
• Dynamic
– Publicly-available (open-source)
– Java-based
Page 9
Session 1 - Outline
• Introduction to Net2Plan
– What is Net2Plan? Why is it used?
• Demo
– How to use Net2Plan? Example network scenario
• Flow Formulation in Net2Plan
– Splittable and unsplittable flows
– Task #1
Page 10
Demo
• Step 1: Open Net2Plan.jar
Page 11
Demo
• Step 2: Go to Tools-> offline network design and online network simulation
Page 12
Demo
• Step 3: Load a pre-defined network
Page 13
Demo
• Step 3: Load a pre-defined network
Page 14
Demo
• Step 4: Click on to show the exact location of network nodes
Page 15
Demo
• Steps 5 & 6: Inspect Nodes, Links and Traffic Matrix
Page 16
Demo
• Step 7: Go to Offline algorithmtab, in algorithm section click on Load
Page 17
Demo
• Step 8: Select “SplitableFlowFormulation.class” and click on Execute
Page 18
Demo
• Step 9: Go to View/edit network state and check status of demands
Page 19
Session 1 - Outline
• Introduction to Net2Plan
– What is Net2Plan? Why is it used?
• Demo
– How to use Net2Plan? Example network scenario
• Flow Formulation in Net2Plan
– Splittable and unsplittable flows
– Task #1
Page 20
Flow Formulation - Notation
Graph G(N,E)
N set of Nodes, E set of Links
c node pair (source sc, destination dc) having requested connection request(s)
l,k link identifiers (source-destination pairs)
Vc number of connection requests having sc
as source and dc as destination
xlkc number of connections of c routed on link l,k
W Link capacity, number of wavelengths
Page 21
Flow Formulation (Splittable Flow)
• Routing of demands uses ‘flow-link’ decision variables:
xlkc = number of connections of c
routed on link l,k
xlkc ≥ 0• Objective function: minimize total
amount of traffic routed on all links
min
𝑐∈𝐶,𝑙𝑘∈𝐸
𝑥𝑙𝑘𝑐
Page 22
Flow Formulation (Splittable Flow)
• Subject to:
𝑘:(𝑘,𝑙)∈𝐸
𝑥𝑘𝑙𝑐 −
𝑘:(𝑙,𝑘)∈𝐸
𝑥𝑙𝑘𝑐 =
Vc k = dc
-Vc k = sc ∀ l, c
0 Otherwise
𝑐∈𝐶
xlkc ≤ 𝑊𝐹𝑙𝑘 ∀ l, k Nr. of fibers on
link l,k = 1
Page 23
Flow Formulation (Splittable Flow)
• Compile and inspect the java code of flow formulation to use in Net2Plan
• File: FlowFormulation.java
• Can be downloaded from:
ayoub.faculty.polimi.it/teaching/cnd/
found in a zip file under Lab Material for Lecture #1
Page 24
Flow Formulation (Unsplittable Flow)
• Routing of demands uses ‘flow-link’ decision variables:
xlkc = {0,1} if offered traffic of c is
routed on link l,k
• Objective function: minimize total amount of traffic routed on all links
Page 25
Flow Formulation (Unsplittable Flow)
• Subject to:
𝑘∈𝐴𝑙
𝑥𝑘𝑙𝑐 −
𝑘∈𝐴𝑙
𝑥𝑙𝑘𝑐 =
1 k = dc
-1 k = sc ∀ l, c
0 Otherwise
∀ l, k
𝑐∈𝐶
𝑥𝑙𝑘𝑐 = {0,1} ∀ l, k ∀ c
𝑐∈𝐶
Vc xlkc ≤ 𝑊𝐹𝑙𝑘 Nr. Of fibers on
link l,k = 1
Page 26
Flow Formulation (Task #1)
• Modify FlowFormulation.java to assume unsplittable flows
• Load the 7-nodes network topology with traffic
– Compare ‘splittable’ & ‘unsplittable’ varying link capacity C = {10,15, 17, 20, 30, 40, 50}
– Plot/tabulate total bandwidth w.r.t capacity C
– Send us the [email protected]
