B Multi-Layer Network Design II Dr. Greg Bernstein Grotto Networking www.grotto-networking.com.

Slides:



Advertisements
Similar presentations
Cognitive Radio Communications and Networks: Principles and Practice By A. M. Wyglinski, M. Nekovee, Y. T. Hou (Elsevier, December 2009) 1 Chapter 12 Cross-Layer.
Advertisements

Outline LP formulation of minimal cost flow problem
B Capacitated Design: Part II Dr. Greg Bernstein Grotto Networking
B Topological Network Design: Link Locations Dr. Greg Bernstein Grotto Networking
Linear Programming. Introduction: Linear Programming deals with the optimization (max. or min.) of a function of variables, known as ‘objective function’,
LPs and MIPs background and solution approaches Dr. Greg Bernstein Grotto Networking
B Network Design Problems: An Overview Dr. Greg Bernstein Grotto Networking Based on Chapter 2 of Pioro and Medhi
Optical Networks BM-UC Davis122 Part III Wide-Area (Wavelength-Routed) Optical Networks – 1.Virtual Topology Design 2.Wavelength Conversion 3.Control and.
1 EL736 Communications Networks II: Design and Algorithms Class3: Network Design Modeling Yong Liu 09/19/2007.
B Flows to Paths Dr. Greg Bernstein Grotto Networking
B Network Dimensioning Problems: Where to put the capacity and how much… Dr. Greg Bernstein Grotto Networking
1 EL736 Communications Networks II: Design and Algorithms Class8: Networks with Shortest-Path Routing Yong Liu 10/31/2007.
L12. Network optimization problems D. Moltchanov, TUT, Spring 2008 D. Moltchanov, TUT, Spring 2014.
Effects of TSI/TSA (or Wavelength Conversion) on Ring Loading E E Module 8 W. D. Grover TRLabs & University of Alberta © Wayne D. Grover 2002, 2003.
PROFITABLE CONNECTION ASSIGNMENT IN ALL OPTICAL WDM NETWORKS VISHAL ANAND LANDER (Lab. for Advanced Network Design, Evaluation and Research) In collaboration.
Lecture 3. Notations and examples D. Moltchanov, TUT, Spring 2008 D. Moltchanov, TUT, Spring 2015.
1 Integrality constraints Integrality constraints are often crucial when modeling optimizayion problems as linear programs. We have seen that if our linear.
LINEAR EQUATION IN TWO VARIABLES. System of equations or simultaneous equations – System of equations or simultaneous equations – A pair of linear equations.
1 EL736 Communications Networks II: Design and Algorithms Class11: Multi-Hour and Multi-Layer Network Design 12/05/2007.
Max-flow/min-cut theorem Theorem: For each network with one source and one sink, the maximum flow from the source to the destination is equal to the minimal.
B Multi-Layer Network Design Dr. Greg Bernstein Grotto Networking
1 Slides by Yong Liu 1, Deep Medhi 2, and Michał Pióro 3 1 Polytechnic University, New York, USA 2 University of Missouri-Kansas City, USA 3 Warsaw University.
1 EL736 Communications Networks II: Design and Algorithms Class2: Network Design Problems -- Notation and Illustrations Yong Liu 09/12/2007.
L13. Shortest path routing D. Moltchanov, TUT, Spring 2008 D. Moltchanov, TUT, Spring 2014.
Lecture 15. IGP and MPLS D. Moltchanov, TUT, Spring 2008 D. Moltchanov, TUT, Spring 2015.
B Shortest Path Network Design Dr. Greg Bernstein Grotto Networking
1 Chapter-4: Network Flow Modeling & Optimization Deep Medhi and Karthik Ramasamy August © D. Medhi & K. Ramasamy, 2007.
Lecture 17. ATM VPs, circuit-switching D. Moltchanov, TUT, Spring 2008 D. Moltchanov, TUT, Spring 2015.
17 th International Teletraffic Congress Topological design of telecommunication networks Michał Pióro a,b, Alpar Jüttner c, Janos Harmatos c, Áron Szentesi.
B Topological Network Design: Access Networks Dr. Greg Bernstein Grotto Networking
Hub Location Problems Chapter 12
Logical Topology Design
Optimization Flow Control—I: Basic Algorithm and Convergence Present : Li-der.
Scalable Multi-Class Traffic Management in Data Center Backbone Networks Amitabha Ghosh (UtopiaCompression) Sangtae Ha (Princeton) Edward Crabbe (Google)
Minimax Open Shortest Path First (OSPF) Routing Algorithms in Networks Supporting the SMDS Service Frank Yeong-Sung Lin ( 林永松 ) Information Management.
Examination Committee: Dr. Poompat Saengudomlert (Chairperson) Assoc. Prof. Tapio Erke Dr. R.M.A.P. Rajatheva 1 Telecommunications FoS Asian Institute.
Examination Committee: Dr. Poompat Saengudomlert (Chairperson) Assoc. Prof. Tapio Erke Dr. R.M.A.P. Rajatheva 1 Telecommunications FoS Asian Institute.
1 Multicasting in a Class of Multicast-Capable WDM Networks From: Y. Wang and Y. Yang, Journal of Lightwave Technology, vol. 20, No. 3, Mar From:
MGTSC 352 Lecture 14: Aggregate Planning WestPlast Case H ow to deal with multiple objectives How to use binary variables AltaMetal Case Aggregating into.
DDoS Attack and Defense 郭承賓 (Allen C.B. Kuo). Autonomous System Entry node.
EE 685 presentation Optimization Flow Control, I: Basic Algorithm and Convergence By Steven Low and David Lapsley.
1 System Planning 2013 Lecture 7: Optimization Appendix A Contents: –General about optimization –Formulating optimization problems –Linear Programming.
1 Slides by Yong Liu 1, Deep Medhi 2, and Michał Pióro 3 1 Polytechnic University, New York, USA 2 University of Missouri-Kansas City, USA 3 Warsaw University.
Optical Networking University of Southern Queensland.
1 EL736 Communications Networks II: Design and Algorithms Class7: Location and Topological Design Yong Liu 10/24/2007.
1 An Arc-Path Model for OSPF Weight Setting Problem Dr.Jeffery Kennington Anusha Madhavan.
Use Cases for High Bandwidth Query and Control of Core Networks Greg Bernstein, Grotto Networking Young Lee, Huawei draft-bernstein-alto-large-bandwidth-cases-00.txt.
1 Slides by Yong Liu 1, Deep Medhi 2, and Michał Pióro 3 1 Polytechnic University, New York, USA 2 University of Missouri-Kansas City, USA 3 Warsaw University.
11/02/2001 Workshop on Optical Networking 1 Design Method of Logical Topologies in WDM Network with Quality of Protection Junichi Katou Dept. of Informatics.
Global Optimization Methods for the Discrete Network Design Problem Dr. Shuaian Wang Lecturer University of Wollongong Dr. Qiang Meng Associate Professor.
Management Science 461 Lecture 3 – Covering Models September 23, 2008.
Linear Programming Chapter 1 Introduction.
1 EL736 Communications Networks II: Design and Algorithms Class4: Network Design Modeling (II) Yong Liu 10/03/2007.
Wavelength-Routed Optical Networks: Linear Formulation, Resource Budgeting Tradeoffs, and a Reconfiguration Study Dhritiman Banergee and Biswanath Mukherjee,
1 Chapter 5 Branch-and-bound Framework and Its Applications.
Tuesday, March 19 The Network Simplex Method for Solving the Minimum Cost Flow Problem Handouts: Lecture Notes Warning: there is a lot to the network.
Management Science 461 Lecture 4b – P-median problems September 30, 2008.
L11. Link-path formulation
Constraint-Based Routing
Presented by Tae-Seok Kim
Globa Larysa prof, Dr.; Skulysh Mariia, PhD; Sulima Svitlana
An Equal-Opportunity-Loss MPLS-Based Network Design Model
Multi-Commodity Flow Based Routing
Frank Yeong-Sung Lin (林永松) Information Management Department
Routing and Logistics with TransCAD
I. Floorplanning with Fixed Modules
L12. Network optimization
Introduction Basic formulations Applications
Frank Yeong-Sung Lin (林永松) Information Management Department
L13. Capacitated and uncapacitated network design problems
Presentation transcript:

B Multi-Layer Network Design II Dr. Greg Bernstein Grotto Networking

Outline Two layer allocation problems – Link-Path, Single Path Allocation – Examples Two layer dimensioning problems Book Readings – Section 2.9, Section 12.1 (skip or skim )

Two layer capacity allocation Problem Example Ethernet over WDM – Ethernet demands: {('E1', 'E4'): 23, ('E2', 'E3'): 18, ('E2', 'E6'): 19, ('E3', 'E4'): 17} – WDM link capacities: 40Gbps

Example Solutions Upper layer selected paths: Lower layer selected paths: Upper layer link capacities: Splitting over two different lower layer paths Optimized objective =

Example Solutions II Two upper layer paths contribute to the load on link (E1, E2) Demand on (E1, E2) needs to be split over two different paths [W1, W2] and [W1, W9, W2]

Two Layer SPA Formulation I Indices – Demands – Links – Candidate paths Constants – Volume of demand d – Link in path indicator Variables – Flow allocation – Link capacity Upper Layer

Two Layer SPA Formulation II Demand Constraints Link Capacity Constraints Upper Layer

Two Layer SPA Formulation III Indices – Links (lower) – Candidate paths (lower) Constants – Link Capacity (lower) – Link in path indicator (lower) – Link cost (lower) Variables – Flow allocation (lower) – Path Selection indicator (lower, binary) Lower Layer

Two Layer CA Formulation IV Demand Constraints Link Capacity Constraints Path Selection Constraints Objective – minimize Lower Layer

Variable reduction? Do we need both and ? – Can’t we just use as follows: – Second inequality has two variables multiplied by each other and hence is a non-linear constraint, but we need an linear MIP formulation

Example SPA Solution I Upper and Lower layer selected paths: Upper layer link capacities: Optimized objective = (previous: )

Example SPA Solution II Upper layer path: [E1, E2, E4] Lower layer paths implementing upper layer links: (E1, E2): [W1, W2] (E2, E4): [W2, W10, W8, W4]

Example SPA Solution III Upper layer path: [E2, E5, E3] Lower layer paths implementing upper layer links: (E3, E5): [W3, W5] (E2, E5): [W2, W8, W5]

Dimensioning Problems Looking to size links at both upper and lower layers – Start simple then deal with modular sizing

Two Layer Dimensioning Formulation I Indices – Demands – Links – Candidate paths Constants – Volume of demand d – Link in path indicator – Cost of upper layer links Variables – Flow allocation (continuous) – Link capacity (continous) Upper Layer In CA problems we only cared about lower layer costs. Why would we care here? What values might be assigned?

Two Layer Dimensioning Formulation II Demand Constraints Link Capacity Constraints Upper Layer

Two Layer Dimensioning Formulation III Indices – Links (lower) – Candidate paths (lower) Constants – Link in path indicator (lower) – Link cost (lower) Variables – Flow allocation (continuous) – Link Capacity (continuous) Lower Layer

Two Layer Dimensioning Formulation IV Demand Constraints Link Capacity Constraints Objective (multi-layer) – minimize Lower Layer

Multi-layer Dim Example Ia Ethernet over WDM – Initially continuous variables for link capacities

Multi-layer Dim Example Ib Demands – Upper layer only – Randomly generated

Multi-layer Dim Example Ic Candidate path generation (k-shortest paths alg) – Upper layer link costs = 1 (why would this be reasonable?) – Lower layer link costs based on distance Example best and worst paths Upper LayerLower Layer

Multi-layer Dim Example Id Link Size Solutions Upper LayerLower Layer Dimensioning problem objective = 55,526.56

Multi-layer Dim Example Ie Solution Paths Upper Layer Lower Layer

Multi-layer Dim Example If Upper Layer Lower Layer Solution Paths – Realizing demand (E1, E6): 18.2

Multi-Layer Dimensioning Modular But links don’t come in continuous sizes! – Let M be the size of the capacity for the upper layer links – Let N be the size of the capacity for the lower layer links – Use a mix of continuous and integer variables in the formulation

Two Layer Dimensioning Formulation I Indices – Demands – Links – Candidate paths Constants – Volume of demand d – Link in path indicator – Cost of upper layer links – Upper layer module size M Variables – Flow allocation (continuous) – Link capacity (integer) Upper Layer

Two Layer Dimensioning Formulation II Demand Constraints Link Capacity Constraints Upper Layer Module size times the integer link capacity

Two Layer Dimensioning Formulation III Indices – Links (lower) – Candidate paths (lower) Constants – Link in path indicator (lower) – Link cost (lower) – Link Modular Capacity N Variables – Flow allocation (integer) – Link Capacity (integer) Lower Layer

Two Layer Dimensioning Formulation IV Demand Constraints Link Capacity Constraints Objective (multi-layer) – minimize Lower Layer Slightly different cost function than text so we can compare to previous results.

Modular Dimensioning Example 2a Technology Stack – 10Gbps Ethernet over WDM – Each wavelength supports 40Gbps of traffic Could use G.709 OTU3, OTU3e2 Or SONET OC-768/ SDH STM-256 In formulation – M=10 – N=40

Multi-layer Mod Dim Example 2b Link Size Solutions Upper LayerLower Layer Dimensioning problem objective = 71, Do these link sizes seem correct? Why or Why not?

Multi-layer Mod Dim Example 2b Scaled Link Size Solutions – Need to multiply by modular factors M and N Upper LayerLower Layer

Multi-layer Mod Dim Example 2c Upper Layer Solution Paths Path Splitting!

Multi-layer Mod Dim Example 2d Lower Layer Solution Paths Path Splitting!

Multi-layer Mod Dim Example 2e Demand (E2, E6) realization – Via multiple upper and lower layer paths Assuming aggregate flows between nodes and Ethernet LAG technology is it okay to split: (a)Upper layer paths? (b)Lower layer paths?