Lecture 23 Part 1: Making a Case for Using IP to Design DWDM Networks

13
1 Lecture 23 Part 1: Making a Case for Using IP to Design DWDM Networks G. Birkan – SMU Student E. Olinick – SMU Faculty A. Ortynski – Nortel Networks G. Spiride – Nortel Networks Sponsors: ONR and Nortel Networks Manuscript available on my web page http://www.engr.smu.edu/~jlk/

description

Lecture 23 Part 1: Making a Case for Using IP to Design DWDM Networks. G. Birkan – SMU Student E. Olinick – SMU Faculty Ortynski – Nortel Networks G. Spiride – Nortel Networks Sponsors: ONR and Nortel Networks Manuscript available on my web page http://www.engr.smu.edu/~jlk/. - PowerPoint PPT Presentation

Transcript of Lecture 23 Part 1: Making a Case for Using IP to Design DWDM Networks

Page 1: Lecture 23 Part 1: Making a Case for Using IP to Design DWDM Networks

1

Lecture 23 Part 1: Making a Case for Using IP to Design DWDM Networks

G. Birkan – SMU Student

E. Olinick – SMU Faculty

A. Ortynski – Nortel Networks

G. Spiride – Nortel Networks

Sponsors: ONR and Nortel Networks

Manuscript available on my web page

http://www.engr.smu.edu/~jlk/

Page 2: Lecture 23 Part 1: Making a Case for Using IP to Design DWDM Networks

2

Design Software

OPNET Technologies, Inc.

RSoft, Inc.

VPI Systems

ARTIS Software Corp.

TelOptica, Inc.

(Heuristics – No LP No IP)

Page 3: Lecture 23 Part 1: Making a Case for Using IP to Design DWDM Networks

3

Legitimate Concerns

Hard To Model Some Problems As LPs Or IPs (Polarization Mode Dispersion

Constraints)

Hard To Create Good Optimization Software

(Some Firms Want To Control All Software)

Computational Time Can Be Excessive

Convergence Can Be Slow

Professional Optimization Software Can Be Expensive

Page 4: Lecture 23 Part 1: Making a Case for Using IP to Design DWDM Networks

4

Issues Faced By Network Designers

(Slide #1)Node-Arc Models – Can Not Control The Hop

Counts

Arc-Path Models – Not All Paths Are Available

Protection For Mesh Networks – Several Possibilities

Dedicated Protection(also called 1+1 protection)

P-Cycle Protection (Grover & Stamatelakis)

Shared Protection

Page 5: Lecture 23 Part 1: Making a Case for Using IP to Design DWDM Networks

5

Issues Faced By Network Designers

(Slide #2)Uncertainty In The Demand Forecasts

(Nortel Networks Concerned About This)

{From The OR Literature}

Stochastic Programming (Linear)

Mean Value Model (Linear)

Worst Case Model (Linear)

Robust Optimization (Nonlinear)

Page 6: Lecture 23 Part 1: Making a Case for Using IP to Design DWDM Networks

6

Our Investigation

We created AMPL models addressing all of these issues

and empirically tested our models.

Used AMPL/CPLEX

Used AlphaServer

667 MHz

4096 MB of RAM

Page 7: Lecture 23 Part 1: Making a Case for Using IP to Design DWDM Networks

7

General Problem Description

Given1. Network Topology

2. Forecast Of Point-To-Point Traffic

Determine1. Routing For The Traffic

2. Equipment Configuration Required

Page 8: Lecture 23 Part 1: Making a Case for Using IP to Design DWDM Networks

8

7

4

3

1

2

5

6

AtlantaDallas

Chicago

Determine Where To Install Equipment To Light The Dark Fiber

New York

Los Angeles

San Francisco

Boston

Page 9: Lecture 23 Part 1: Making a Case for Using IP to Design DWDM Networks

9

LTE LTE

LTE LTE

LTE LTE

… …

LTE LTE

LTE LTE

LTE LTE

… …

TE TE

TE TE

TE TE

… …

R R

R R

R R

… …

R R

R R

R R

… …

R R

R R

R R

… …

A A

A A

… …A A

A A

… …A A

A A

… …A A

A A

… …A A

A A

… …A A

A A

… …

LTE LTE

LTE LTE

LTE LTE

… …

LTE LTE

LTE LTE

LTE LTE

… …

TE TE

TE TE

TE TE

… …

R R

R R

R R

… …

R R

R R

R R

… …

R R

R R

R R

… …

A A

A A

… …A A

A A

… …A A

A A

… …A A

A A

… …

Basic Building Block for the WDM Network

Optical Amplifier

Regenerator

Page 10: Lecture 23 Part 1: Making a Case for Using IP to Design DWDM Networks

10

4

2

1 3

Avoid Crossing Links

origin

destination

Working Path

Backup Path

Page 11: Lecture 23 Part 1: Making a Case for Using IP to Design DWDM Networks

11

2859

2336

10

3018

2226 33

3 49

17 16 48

394764

2

13

14

65

8 21 6720

10 1542

9

625525

5024

52

4 2760

32

44 46 41

4034

58

5311

57

43

54 7

63

612

61

37

38 56

51

66

3531

2945

5

19

Basic Test Problem (US network with average node degree of 3.15)

Page 12: Lecture 23 Part 1: Making a Case for Using IP to Design DWDM Networks

12

Cycle Generation ModelGiven

G = [N,E]

origin (o)

destination (d)

integer k

Output

k – shortest paths (unique)

k - backup paths (not unique)

Page 13: Lecture 23 Part 1: Making a Case for Using IP to Design DWDM Networks

13

Example

4

8

5

7

31 2

6 5

7

31 2

6

4

8

31 2

64

8

5

7

1 2

6