Network Optimization and its Applications in Optical Network Design

Supervised by
Prof. Dr. Abd ElKarim Omar Hassan Dr. Khaled Fouad Elsayed Faculty of Engineering, Cairo University

Submitted By
Zein ElAbedin Mohamed Wali

7/24/2011

Motivation
1. Growth & wide application of optical communication networks
More users More bandwidth requirement (audio, video, .) New generation networks combining: data / audio/ video/ HD-TV, Video mail, etc)

2. Optical network design is still an active research area 3. Possibility of application to other OR problems

7/24/2011

Agenda
1. Optical fiber networks
   

Multiplexing techniques WRONs Lightpath Routing and Wavelength Assignment

2. Approaches for RWA 3. Proposed approach 4. Future work

7/24/2011 3

Optical fiber networks

Mainly based on 2 factors:

Optical fiber advantages Multiplexing techniques

7/24/2011


     

Optical fiber advantages

Huge bandwidth (nearly 50 Tbps) Low signal attenuation (as low as 0.2 dB/km) Low power requirement Small space requirement Low cost Flexibility

7/24/2011




Multiplexing techniques

Space-division multiplexing (SDM)  Frequency/Wavelength-division multiplexing (FDM/WDM) several independent logical channels each carried on different wavelength
Fiber Tx Tx Tx
7/24/2011

Rx Rx Rx
6




LigthPath

A lightpath is the basic mechanism of communication in WRON.  lightpath (also referred to as P-channel), bypasses electronic processing at intermediate nodes.  Realized by finding:
physical path allocating a free wavelength on each link of that path
7/24/2011 7


 

Routing and Wavelength Assignment (RWA)

Problem statement: Given:
A network topology Set of connection requests to be established.

Required:
To determine lightpath for each connection:  Physical route  Assigned wavelength

7/24/2011




Routing and Wavelength Assignment (RWA) (Ctd)

Constraints: 1. Wavelength continuity constraint: A lightpath must use the same wavelength on all the links along its path from source to destination 2. Distinct wavelength (capacity) constraint: All lightpaths using the same link (fiber) must be allocated distinct wavelengths.
9

7/24/2011




Routing and Wavelength Assignment (RWA) (Ctd)

Illustration (wavelength continuity):

7/24/2011

10




Routing and Wavelength Assignment (RWA) (Ctd)

Illustration (distinct wavelength constraint)
Lightpath

C P1

D P2

P1

A
7/24/2011

Distinct Wavelengths
11

Routing and Wavelength Assignment (RWA) (Ctd)

Distinct Wavelengths

Example WRON:

P1 P2
7/24/2011

Optical CrossConnect
12




Routing and Wavelength Assignment (RWA) (Ctd)

Traffic Type Type
Static / Incremental / Dynamic

Objective
Min-RWA // Max-RWA Max-RWA

Fiber Multiplicity
Single / Multiple

Request Multiplicity
Single / Multiple

7/24/2011

13

Agenda
1. Network Optimization 2. Optical fiber networks 3. Approaches for RWA
  

Link-based Path-based Heuristic

4. Proposed approach 5. Future work

7/24/2011 14




Approaches for RWA

Link-based (ILP)
variables reflect link-flows Huge number of variables but considering the whole search space Explicit wavelength continuity constraint

Path-based (ILP)
ILP formulation variables reflect path-flows Lower number of variables with reduced search space Implicit wavelength continuity constraint

Heuristics
Greedy, Tabu search
15

7/24/2011

Agenda
1. 2. 3. 4. Network Optimization Optical fiber Approaches for RWA Proposed approach
1. 2. 3. 4.


Related work Candidate path calculation Addressing Multiple fiber Min-RWA objective Network growing problem

5. Practical examples 6. Future work

7/24/2011 16

3. Proposed approach
 Path-based approach  Related Work:
Ozdaglar et. al.(2003): Min-RWA, unique requests, single fiber. Lee et. al.(2004): Min-RWA, multiple requests, multi-fiber. multi-fiber incorporated into the ILP, Based on lagrangean heuristic. Saad et. al.(2004): Max-RWA, multiple requests, multi-fiber. multi-fiber incorporated into the ILP, Based on Maximum coverage heuristic.

7/24/2011

17

3. Proposed approach
 Based on the work of Ramaswami et. al. 1995 1. Candidate path calculation for each SD pair  Link-disjoint paths  Link-distinct paths We adopted the link-disjoint paths criterion:  Avoid congested links (load balancing).  No. of link-disjoint paths is less than linkdistinct path  Contributes to lower the number of Branch and Bound iterations.
7/24/2011 18

Addressing multi-fibers

Network is modeled to an undirected multi-graph instead of a simple undirected graph

7/24/2011

19

ILP Model
Given:
SD1 P(sd1)

m: traffic demand vector Calculate: A, PxSD incidence matrix

SD2

P(sd2)

A matrix SDR P(sdR)

B matrix

B, PxM incidence matrix Required:

Connection requests
7/24/2011

Candidate paths

Links

C, PxW incidence matrix

20

W i, j i, j

C G
i !1 j !1

ILP Model (Ctd)

Minimize

 Min-RWA objective:
Assign increasing weights to increasing index of used P W wavelengths

Objective

C G
i, j i!1
T

i, j

j!1

Capacity constraint: Traffic demand Constraint: Integrality constraint:

7/24/2011

C B
w

1
T

WxL

m e1 C A
m u0
i

, integeri !1,....,R
,integeri !1,...., , j !1,...., P W
21

i, j

u0

Network Growing problem

 Current network topology and resources can not satisfy the demanded requests


Required
to obtain the minimum set of modifications to satisfy the connection requests.

Our assumption: the suggested modifications are only the addition of fibers to already existing links.
22

7/24/2011

Network Growing problem (Ctd)

Start

A
Solve the model Yes Feasible ? Build new model with Max No solution #. of wavelengths Solve the model No LP solve library

Calculate Candidate Paths Calculate A, B matrices and Build the LP model

Report solution Calculate modifications

7/24/2011

End

Network growing
23

Agenda
1. 2. 3. 4. 5. Network Optimization Optical fiber Approaches for RWA Proposed approach Practical examples
   

Performance metrics Performance evaluation Network models Results

6. Future work
7/24/2011 24




Performance metrics

Objective value (Min. no. of wavelengths, W)  Elapsed time (T in mSec)  Total no. of iterations  Branch & Bound iterations (B&B)

7/24/2011

25

Performance Evaluation

1. Model test results: Variable no. of SD pairs Variable no. of requests (increasing multiplicity for the same SD pairs) Variable no. of candidate paths (search space) 2. Comparison with Greedy EDP

7/24/2011

26

Network models
Cost239 Network (11 nodes, 23*2=46 links)
Co en ondon Amsterd m en erlin

r r ssels em o r ris

ienn Z ric

7/24/2011

Mil n

27

Network models (Ctd)

NSFNET Network (14 nodes, 21*2=42 links)
2 5 12

1 7 8 11 13 10 3 6 4

14 9
7/24/2011 28

Results
NSFNET network, increasing SD pairs
W 3 3 3 7 7 8 9 # of iterations 195 219 790 1635 4632 16578 16462 T (mSec) 66 140 162 1040 3E3 28E3 27E3 B&B iterations 100 59 602 1295 4005 14085 13912

1. Increasing SD pairs
# of SD pairs 20 25 30 40 60 80 100

Increasing no. of iterations with increasing SD pairs

7/24/2011 29

2. Increasing requests for the same 10 SD pairs (through multiplicity)

NSFNET network, increasing requests # of Requests 10 20 30 40 50 W 2 4 5 7 9 # of iterations 23 66 176 205 263 T (mSec) 19.5 40 60 87 110 B&B iterations 0 0 28 8 0

Results (Ctd)

Increasing no. of iterations is less grave with multiplicity

7/24/2011 30

Results (Ctd)
Cost239 network, 80 requests, varying candidate paths W # of Iterations T ( mSec) B&B iterations # of candidate Paths

3. Increasing candidate paths

1 2 3 4

8 4 4 4

225 1250 1656 1849

190 500 900 1470

0 578 737 1076

Minimizing the no. of candidate paths can lead to false optimum

7/24/2011 31




Results (Ctd)
Comparison Comparison between proposed and Greedy-EDP approaches Model Proposed Approach W # of Iterations T (mSec) Greedy-EDP W T (mSec)

(Nodes, links, requests)

4,8,4 7,18,9 5,10,6 14,42,120 11,46,80

7/24/2011

2 2 1 12 4

7 (0 B&B) 15(0 B&B) 3 (0 B&B) 63560 (61365 B&B) 1250 (578 B&B)

<R <R 17 17E4 500

2 2 3 21 7

<R <R 15 280 60

32

Agenda
1. 2. 3. 4. 5. Network Optimization Optical fiber networks Approaches for RWA Proposed approach Future work

7/24/2011

33

5. Future work
1. Network optimization
Place and route problem in VLSI Assignment problems (scheduling, crew assignment, job assignment )

2. Optical fiber network problems

Multicasting Dynamic traffic Wavelength conversion

7/24/2011

34

Thank You!

Even if the researcher does not find what was initially expected, the pursuit of a personally important topic is still rewarding and generally produces continuing researches.
7/24/2011 35

References
1. 2. B. Mukherjee, "Optical communication networks", McGraw-Hill Publishers, 1997. I.Chlamtac, A.Ganz, and G.Karmi, Lightpath Communications: An Approach to High Bandwidth Optical WANs IEEE Transactions on Communications, vol.40, no.7, July1992. H. ang, J. P. Jue, and B. Mukherjee, A Review of Routing and Wavelength Assignment Approaches for Wavelength-Routed Optical WDM Networks, SPIE/Baltzer Optical Networks Magazine (ONM), vol. 1, no. 1, January 2000. J. S. Choi, N. Golmie, F. Lapeyrere, F. Mouveaux, and D. Su, A Functional Classification of Routing and Wavelength Assignment Schemes in DWDM Networks: Static Case, Journal of Optical Communication and Networks, January 2000.

3.

4.

7/24/2011

36

References
5. D. Banerjee, and B. Mukherjee, A Practical Approach for Routing and Wavelength Assignment in Large Wavelength-Routed Optical Networks," IEEE Journal on Selected Areas in Communications, Vol. 14 No. 5, 1996. R.M. Krishnaswamy, and K.N. Sivarajan, Algorithms for Routing and Wavelength Assignment Based on Solutions of the LPRelaxation, IEEE Communications Letters, vol. 5, no. 10, October 2001. A. E. Ozdaglar, and D. P. Bertsekas, Routing and Wavelength Assignment in Optical Networks, IEEE/ACM Transactions on Networking, vol. 11, no. 2, April 2003. M. Saad, and -Q. Luo, "On the Routing and Wavelength Assignment in Multifiber WDM Networks", IEEE Journal on Selected Areas in Communications (special series on optical communications and networking), vol. 22, no. 9, November 2004.

6.

7. 8.

7/24/2011

37

References
9. 10. R. Ramaswami and K. Sivarajan, Routing and Wavelength Assignment in All-Optical Networks, IEEE/ACM Trans. Networking, vol. 3, October 1995. P. Manohar, D. Manjunath, and R. K. Shevgaonkar, Routing and Wavelength Assignment in Optical Networks from Edge Disjoint Path Algorithms, IEEE communication letters, Vol. 6, No. 5, May 2002. C. Dzongang, P. Galinier, and S. Pierre, "A Tabu Search Heuristic for the Routing and Wavelength Assignment Problem in Optical Networks", IEEE Communications letters, Vol. 9, No. 5, May 2005. R.K. Ahuja, T.L. Magnanti and J.B. Orlin, "Handbooks in Operations Research and Management Science", Network Flows chapter, Elsvier science publisher B.V., 1989. X. Jia, D. Du, X. Hu, H. Huang, and D. Li, Placement of Wavelength Converters for Minimal Wavelength Usage in WDM Networks, IEEE INFOCOM'02, New York, June 2002.

11. 12. 13.

7/24/2011

38