link selection algorithms for link-based ilps and applications to
TRANSCRIPT
![Page 1: Link Selection Algorithms for Link-Based ILPs and Applications to](https://reader031.vdocuments.us/reader031/viewer/2022030323/58a024b71a28ab7c4a8c50db/html5/thumbnails/1.jpg)
1 ONDM 2013 - April 17, 2013
00110001001110010011011000110111 Computer Science Department of
Link Selection Algorithms for Link-Based ILPs and Applications to RWA in Mesh Networks
Zeyu Liu and George N. Rouskas
![Page 2: Link Selection Algorithms for Link-Based ILPs and Applications to](https://reader031.vdocuments.us/reader031/viewer/2022030323/58a024b71a28ab7c4a8c50db/html5/thumbnails/2.jpg)
2
00110001001110010011011000110111 Computer Science Department of
! Routing and Wavelength Assignment (RWA)
! Fast Link Formulation with Link Selection in Mesh
! Results and Conclusions
Outline
ONDM 2013 - April 17, 2013
![Page 3: Link Selection Algorithms for Link-Based ILPs and Applications to](https://reader031.vdocuments.us/reader031/viewer/2022030323/58a024b71a28ab7c4a8c50db/html5/thumbnails/3.jpg)
3
00110001001110010011011000110111 Computer Science Department of
RWA: Problem Definition ! Input
! Network topology ! Traffic demands T=[tij]
! Output ! The lightpaths (path and wavelength), one per connection request
! Constraints ! Wavelength Continuity Constraint
! assign the same wavelength on all links along the lightpath
! Distinct Wavelength Constraint ! assign lightpaths with common link(s) different wavelengths
! A tight coupling between RA and WA ! NP-hard Problem
ONDM 2013 - April 17, 2013
![Page 4: Link Selection Algorithms for Link-Based ILPs and Applications to](https://reader031.vdocuments.us/reader031/viewer/2022030323/58a024b71a28ab7c4a8c50db/html5/thumbnails/4.jpg)
4
00110001001110010011011000110111 Computer Science Department of
Solutions - Heuristics ! Decompose into subproblems
! routing algorithm ! Dijkstra’s algorithm ! edge disjoint shortest pair algorithm
! wavelength assignment ! first-fit, random-fit, etc
! Longest first alternate path (LFAP) ! use alternate paths that cannot be established by shortest paths only ! maximize the utilization of each wavelength
! ILP -> LP and rounding
! Disadvantage ! hard to characterize the quality of solutions ! may fail to find a feasible solution
ONDM 2013 - April 17, 2013
![Page 5: Link Selection Algorithms for Link-Based ILPs and Applications to](https://reader031.vdocuments.us/reader031/viewer/2022030323/58a024b71a28ab7c4a8c50db/html5/thumbnails/5.jpg)
5
00110001001110010011011000110111 Computer Science Department of
Solutions – ILP Formulations ! Integer Linear Programming (ILP) Formulations -> can solve to
optimality ! link-based
! Links as entities of interest ! path-based
! Pre-calculate the path candidates ! maximal Independent Set (MIS)-based
! Pre-calculate the path candidates and transfer into a multi-coloring problem
ONDM 2013 - April 17, 2013
![Page 6: Link Selection Algorithms for Link-Based ILPs and Applications to](https://reader031.vdocuments.us/reader031/viewer/2022030323/58a024b71a28ab7c4a8c50db/html5/thumbnails/6.jpg)
6
00110001001110010011011000110111 Computer Science Department of
! Routing and Wavelength Assignment (RWA)
! Fast Link Formulation with Link Selection in Mesh
! Results and Conclusions
Outline
ONDM 2013 - April 17, 2013
![Page 7: Link Selection Algorithms for Link-Based ILPs and Applications to](https://reader031.vdocuments.us/reader031/viewer/2022030323/58a024b71a28ab7c4a8c50db/html5/thumbnails/7.jpg)
7
00110001001110010011011000110111 Computer Science Department of
Link-based Formulation ! Links are the entities of interest
! Natural advantage in solution quality
! Main set of decision variables ! binary variables indicating whether a wavelength is assigned on a link
for a lightpath
ONDM 2013 - April 17, 2013
![Page 8: Link Selection Algorithms for Link-Based ILPs and Applications to](https://reader031.vdocuments.us/reader031/viewer/2022030323/58a024b71a28ab7c4a8c50db/html5/thumbnails/8.jpg)
8
00110001001110010011011000110111 Computer Science Department of
Link-based Formulation (2) ! Main set of constraints - multi-commodity flow equation
! Constraints ! multi-commodity flow (implicitly ensure wavelength continuity
constraint) ! distinct wavelength constraints ! traffic demands constraints
8 ONDM 2013 - April 17, 2013
![Page 9: Link Selection Algorithms for Link-Based ILPs and Applications to](https://reader031.vdocuments.us/reader031/viewer/2022030323/58a024b71a28ab7c4a8c50db/html5/thumbnails/9.jpg)
9
00110001001110010011011000110111 Computer Science Department of
Link-based Formulation (3) ! Scalability Issue – large problem size
! # of dominant variables ! For each node pair, consider each link : N2|E|W
! # of dominant constraints ! For each node pair, consider each node : N3 tij
9 ONDM 2013 - April 17, 2013
![Page 10: Link Selection Algorithms for Link-Based ILPs and Applications to](https://reader031.vdocuments.us/reader031/viewer/2022030323/58a024b71a28ab7c4a8c50db/html5/thumbnails/10.jpg)
10
00110001001110010011011000110111 Computer Science Department of
Link-based Formulation (4) ! But, do we really need to consider each link?
10 ONDM 2013 - April 17, 2013
![Page 11: Link Selection Algorithms for Link-Based ILPs and Applications to](https://reader031.vdocuments.us/reader031/viewer/2022030323/58a024b71a28ab7c4a8c50db/html5/thumbnails/11.jpg)
11
00110001001110010011011000110111 Computer Science Department of
Link-based Formulation (4) ! But, do we really need to consider each link?
11 ONDM 2013 - April 17, 2013
![Page 12: Link Selection Algorithms for Link-Based ILPs and Applications to](https://reader031.vdocuments.us/reader031/viewer/2022030323/58a024b71a28ab7c4a8c50db/html5/thumbnails/12.jpg)
12
00110001001110010011011000110111 Computer Science Department of
Link-based Formulation (4) ! But, do we really need to consider each link?
12 ONDM 2013 - April 17, 2013
![Page 13: Link Selection Algorithms for Link-Based ILPs and Applications to](https://reader031.vdocuments.us/reader031/viewer/2022030323/58a024b71a28ab7c4a8c50db/html5/thumbnails/13.jpg)
13
00110001001110010011011000110111 Computer Science Department of
Link-based Formulation (4) ! But, do we really need to consider each link?
! NO. Two reasons: ! Waste network resources ! Increase # of wavelengths needed.
13 ONDM 2013 - April 17, 2013
![Page 14: Link Selection Algorithms for Link-Based ILPs and Applications to](https://reader031.vdocuments.us/reader031/viewer/2022030323/58a024b71a28ab7c4a8c50db/html5/thumbnails/14.jpg)
14
00110001001110010011011000110111 Computer Science Department of
Link Formulation with Link Selection ! Reduce the problem size – prune redundant variables
! Link selection algorithm 1 – k-thres algorithm
14 ONDM 2013 - April 17, 2013
d s dist(s,d)
i j
link l
dist(s,i) dist(j,d)
![Page 15: Link Selection Algorithms for Link-Based ILPs and Applications to](https://reader031.vdocuments.us/reader031/viewer/2022030323/58a024b71a28ab7c4a8c50db/html5/thumbnails/15.jpg)
15
00110001001110010011011000110111 Computer Science Department of
Link Formulation with Link Selection (2) ! Reduce the problem size – prune redundant variables
! Link selection algorithm 2 – k-path algorithm ! Select links on the routes of k-shortest paths
15 ONDM 2013 - April 17, 2013
d
s
i j
link l
route 1
route 2
![Page 16: Link Selection Algorithms for Link-Based ILPs and Applications to](https://reader031.vdocuments.us/reader031/viewer/2022030323/58a024b71a28ab7c4a8c50db/html5/thumbnails/16.jpg)
16
00110001001110010011011000110111 Computer Science Department of
Link Formulation with Link Selection (2) ! Reduce the problem size – prune redundant variables
! Link selection algorithm 2 – k-path algorithm ! More likely to give better solution ! Tend to have less links selected as link reuse among the k paths
16 ONDM 2013 - April 17, 2013
![Page 17: Link Selection Algorithms for Link-Based ILPs and Applications to](https://reader031.vdocuments.us/reader031/viewer/2022030323/58a024b71a28ab7c4a8c50db/html5/thumbnails/17.jpg)
17
00110001001110010011011000110111 Computer Science Department of
Link Formulation with Link Selection (3) ! Reduce the problem size – prune redundant variables
! Problem size decrease ! # of variables
! Only a fraction of all links is considered ! # of constraints
! Only nodes that are endpoints of the selected links
17 ONDM 2013 - April 17, 2013
![Page 18: Link Selection Algorithms for Link-Based ILPs and Applications to](https://reader031.vdocuments.us/reader031/viewer/2022030323/58a024b71a28ab7c4a8c50db/html5/thumbnails/18.jpg)
18
00110001001110010011011000110111 Computer Science Department of
Link Formulation with Link Selection (4) ! Analysis 1 - # of variables vs. k
! # of variables increases as k increases ! k-path algorithm tends to have less # of variables
18 ONDM 2013 - April 17, 2013
![Page 19: Link Selection Algorithms for Link-Based ILPs and Applications to](https://reader031.vdocuments.us/reader031/viewer/2022030323/58a024b71a28ab7c4a8c50db/html5/thumbnails/19.jpg)
19
00110001001110010011011000110111 Computer Science Department of
Link Formulation with Link Selection (4) ! Analysis 1 - # of variables vs. k
! # of variables increases as k increases ! k-path algorithm tends to have less # of variables
19 ONDM 2013 - April 17, 2013
![Page 20: Link Selection Algorithms for Link-Based ILPs and Applications to](https://reader031.vdocuments.us/reader031/viewer/2022030323/58a024b71a28ab7c4a8c50db/html5/thumbnails/20.jpg)
20
00110001001110010011011000110111 Computer Science Department of
Link Formulation with Link Selection (5) ! Analysis 2 - trade off between solution quality and running time
! As the # of variables increases ! Solution quality increases (# of wavelengths needed decrease) ! Running time increases
20 ONDM 2013 - April 17, 2013
![Page 21: Link Selection Algorithms for Link-Based ILPs and Applications to](https://reader031.vdocuments.us/reader031/viewer/2022030323/58a024b71a28ab7c4a8c50db/html5/thumbnails/21.jpg)
21
00110001001110010011011000110111 Computer Science Department of
Link Formulation with Link Selection (6) ! Analysis 3 - link formulation with link selection vs. path formulation
21 ONDM 2013 - April 17, 2013
![Page 22: Link Selection Algorithms for Link-Based ILPs and Applications to](https://reader031.vdocuments.us/reader031/viewer/2022030323/58a024b71a28ab7c4a8c50db/html5/thumbnails/22.jpg)
22
00110001001110010011011000110111 Computer Science Department of
! Routing and Wavelength Assignment (RWA)
! Fast Link Formulation with Link Selection in Mesh
! Results and Conclusions
Outline
ONDM 2013 - April 17, 2013
![Page 23: Link Selection Algorithms for Link-Based ILPs and Applications to](https://reader031.vdocuments.us/reader031/viewer/2022030323/58a024b71a28ab7c4a8c50db/html5/thumbnails/23.jpg)
23
00110001001110010011011000110111 Computer Science Department of
Link Formulation with Link Selection (8) ! Experimental study 1 – k-thres vs. k-path
23 ONDM 2013 - April 17, 2013
![Page 24: Link Selection Algorithms for Link-Based ILPs and Applications to](https://reader031.vdocuments.us/reader031/viewer/2022030323/58a024b71a28ab7c4a8c50db/html5/thumbnails/24.jpg)
24
00110001001110010011011000110111 Computer Science Department of
Link Formulation with Link Selection (8) ! Experimental study 1 – k-thres vs. k-path
24 ONDM 2013 - April 17, 2013
![Page 25: Link Selection Algorithms for Link-Based ILPs and Applications to](https://reader031.vdocuments.us/reader031/viewer/2022030323/58a024b71a28ab7c4a8c50db/html5/thumbnails/25.jpg)
25
00110001001110010011011000110111 Computer Science Department of
Link Formulation with Link Selection (8) ! Experimental study 1 – k-path in NSF network
25 ONDM 2013 - April 17, 2013
![Page 26: Link Selection Algorithms for Link-Based ILPs and Applications to](https://reader031.vdocuments.us/reader031/viewer/2022030323/58a024b71a28ab7c4a8c50db/html5/thumbnails/26.jpg)
26
00110001001110010011011000110111 Computer Science Department of
Link Formulation with Link Selection (8) ! Experimental study 1 – k-path in NSF network
26 ONDM 2013 - April 17, 2013
![Page 27: Link Selection Algorithms for Link-Based ILPs and Applications to](https://reader031.vdocuments.us/reader031/viewer/2022030323/58a024b71a28ab7c4a8c50db/html5/thumbnails/27.jpg)
27
00110001001110010011011000110111 Computer Science Department of
Link Formulation with Link Selection (9) ! Experimental study 2 – running time, compared with existing
27 ONDM 2013 - April 17, 2013
![Page 28: Link Selection Algorithms for Link-Based ILPs and Applications to](https://reader031.vdocuments.us/reader031/viewer/2022030323/58a024b71a28ab7c4a8c50db/html5/thumbnails/28.jpg)
28
00110001001110010011011000110111 Computer Science Department of
Link Formulation with Link Selection (9) ! Experimental study 2 – running time, compared with existing
28 ONDM 2013 - April 17, 2013
![Page 29: Link Selection Algorithms for Link-Based ILPs and Applications to](https://reader031.vdocuments.us/reader031/viewer/2022030323/58a024b71a28ab7c4a8c50db/html5/thumbnails/29.jpg)
29
00110001001110010011011000110111 Computer Science Department of
Link Formulation with Link Selection (9) ! Experimental study 2 – running time, compared with existing
29 ONDM 2013 - April 17, 2013
![Page 30: Link Selection Algorithms for Link-Based ILPs and Applications to](https://reader031.vdocuments.us/reader031/viewer/2022030323/58a024b71a28ab7c4a8c50db/html5/thumbnails/30.jpg)
30
00110001001110010011011000110111 Computer Science Department of
Link Formulation with Link Selection (9) ! Experimental study 2 – running time, compared with existing
30 ONDM 2013 - April 17, 2013
![Page 31: Link Selection Algorithms for Link-Based ILPs and Applications to](https://reader031.vdocuments.us/reader031/viewer/2022030323/58a024b71a28ab7c4a8c50db/html5/thumbnails/31.jpg)
31
00110001001110010011011000110111 Computer Science Department of
Link Formulation with Link Selection (10) ! Experimental study 3 – solution quality, compared with existing
31 ONDM 2013 - April 17, 2013
![Page 32: Link Selection Algorithms for Link-Based ILPs and Applications to](https://reader031.vdocuments.us/reader031/viewer/2022030323/58a024b71a28ab7c4a8c50db/html5/thumbnails/32.jpg)
32
00110001001110010011011000110111 Computer Science Department of
Link Formulation with Link Selection (10) ! Experimental study 3 – solution quality, compared with existing
32 ONDM 2013 - April 17, 2013
![Page 33: Link Selection Algorithms for Link-Based ILPs and Applications to](https://reader031.vdocuments.us/reader031/viewer/2022030323/58a024b71a28ab7c4a8c50db/html5/thumbnails/33.jpg)
33
00110001001110010011011000110111 Computer Science Department of
Link Formulation with Link Selection (10) ! Experimental study 3 – solution quality, compared with existing
33 ONDM 2013 - April 17, 2013
![Page 34: Link Selection Algorithms for Link-Based ILPs and Applications to](https://reader031.vdocuments.us/reader031/viewer/2022030323/58a024b71a28ab7c4a8c50db/html5/thumbnails/34.jpg)
34
00110001001110010011011000110111 Computer Science Department of
Conclusions ! Benefits
! greatly improved existing ILP formulation ! possible to solve WDM networks representative to backbone and
regional networks ! speed up several optical network design problems that includes RWA
as a subproblem (e.g., traffic grooming, survivability design etc.) ! able to characterize the performance of heuristics and develop new
efficient ones
ONDM 2013 - April 17, 2013
![Page 35: Link Selection Algorithms for Link-Based ILPs and Applications to](https://reader031.vdocuments.us/reader031/viewer/2022030323/58a024b71a28ab7c4a8c50db/html5/thumbnails/35.jpg)
35
00110001001110010011011000110111 Computer Science Department of
Future Work ! Speeding up traffic grooming in mesh
! One direction is to extend link selection to grooming assignment
! Apply link selection to: ! other flow-based problems ! problems with path constraints (e.g., impairment-aware RWA)
ONDM 2013 - April 17, 2013