Peter Ruzicka
description
Transcript of Peter Ruzicka
![Page 1: Peter Ruzicka](https://reader036.fdocuments.us/reader036/viewer/2022062314/568141f9550346895dadd6f5/html5/thumbnails/1.jpg)
Sirocco 2004 1
Peter Ruzicka
![Page 2: Peter Ruzicka](https://reader036.fdocuments.us/reader036/viewer/2022062314/568141f9550346895dadd6f5/html5/thumbnails/2.jpg)
Sirocco 2004 2
Results and research Results and research directions directions
in ATM and optical in ATM and optical networksnetworks
[email protected]/~zaks
Shmuel ZaksTechnion,
Israel
![Page 3: Peter Ruzicka](https://reader036.fdocuments.us/reader036/viewer/2022062314/568141f9550346895dadd6f5/html5/thumbnails/3.jpg)
Sirocco 2004 3
![Page 4: Peter Ruzicka](https://reader036.fdocuments.us/reader036/viewer/2022062314/568141f9550346895dadd6f5/html5/thumbnails/4.jpg)
Sirocco 2004 4
![Page 5: Peter Ruzicka](https://reader036.fdocuments.us/reader036/viewer/2022062314/568141f9550346895dadd6f5/html5/thumbnails/5.jpg)
Sirocco 2004 5
![Page 6: Peter Ruzicka](https://reader036.fdocuments.us/reader036/viewer/2022062314/568141f9550346895dadd6f5/html5/thumbnails/6.jpg)
Sirocco 2004 6
Works with
O. GerstelT. Eilam M. Shalom M.
Feigelstein I. Cidon S. Moran M. Flammini
References
Works ofC. Kaklamanis G. GambossiE. Kranakis L. Bechetti D. Krizanc D. PelegA. Pelc J.C. BermondI. Vrt’o A. RosenbergV. Stacho L. Gargano
and many more
and many more …
![Page 7: Peter Ruzicka](https://reader036.fdocuments.us/reader036/viewer/2022062314/568141f9550346895dadd6f5/html5/thumbnails/7.jpg)
Sirocco 2004 7
• graph-theoretic models• algorithmic issues greedy constructions recursive constructions complexity issues approximation algorithms dynamic and fault-tolerance• combinatorial design issues• upper and lower bounds analysis• …• many open problems
![Page 8: Peter Ruzicka](https://reader036.fdocuments.us/reader036/viewer/2022062314/568141f9550346895dadd6f5/html5/thumbnails/8.jpg)
Sirocco 2004 8
OutlineOutline
ATM networks modelATM networks model Optical networks model Optical networks model Discussion – Discussion – ATM networksATM networks Discussion – Discussion – Optical networksOptical networks
![Page 9: Peter Ruzicka](https://reader036.fdocuments.us/reader036/viewer/2022062314/568141f9550346895dadd6f5/html5/thumbnails/9.jpg)
Sirocco 2004 9
ATM - Asynchronous Transfer Mode
Transmission and multiplexing techniqueIndustry standard for high-speed networks
graph theoretic modelGerstel, Cidon, Zaks
![Page 10: Peter Ruzicka](https://reader036.fdocuments.us/reader036/viewer/2022062314/568141f9550346895dadd6f5/html5/thumbnails/10.jpg)
Sirocco 2004 10
Virtualpath
Virtual channel
concatenation of complete paths
Communication
concatenation of partial paths
![Page 11: Peter Ruzicka](https://reader036.fdocuments.us/reader036/viewer/2022062314/568141f9550346895dadd6f5/html5/thumbnails/11.jpg)
Sirocco 2004 11
load = 3hop count = 2stretch factor = 4/3
(space)(time)
Virtual path Virtual channel
Other parameters
Cost
![Page 12: Peter Ruzicka](https://reader036.fdocuments.us/reader036/viewer/2022062314/568141f9550346895dadd6f5/html5/thumbnails/12.jpg)
Sirocco 2004 12
2hop count 3load
Example: Find a layout, to connect a given node with all others, with given bounds on the load and the hop count
![Page 13: Peter Ruzicka](https://reader036.fdocuments.us/reader036/viewer/2022062314/568141f9550346895dadd6f5/html5/thumbnails/13.jpg)
Sirocco 2004 13
3load 2hop count
![Page 14: Peter Ruzicka](https://reader036.fdocuments.us/reader036/viewer/2022062314/568141f9550346895dadd6f5/html5/thumbnails/14.jpg)
Sirocco 2004 14
OutlineOutline
ATM networks modelATM networks model Discussion – Discussion – ATM networksATM networks Optical networks model Optical networks model Discussion – Discussion – Optical networksOptical networks
![Page 15: Peter Ruzicka](https://reader036.fdocuments.us/reader036/viewer/2022062314/568141f9550346895dadd6f5/html5/thumbnails/15.jpg)
Sirocco 2004 15
2hop count 3load
Problem 1: Given a network, pairs of nodes and bounds h and l, find a virtual path layout to connect these nodes with the load bounded by l and the hop count bounded by h.
![Page 16: Peter Ruzicka](https://reader036.fdocuments.us/reader036/viewer/2022062314/568141f9550346895dadd6f5/html5/thumbnails/16.jpg)
Sirocco 2004 16
3load 2hop count
![Page 17: Peter Ruzicka](https://reader036.fdocuments.us/reader036/viewer/2022062314/568141f9550346895dadd6f5/html5/thumbnails/17.jpg)
Sirocco 2004 17
Problem 1a: Given a network and a bound on the load l and a bound h on the hop count, find a layout, to connect a given node with all others (one-to-all). a. worst-case. b. average case.Note: consider it for a given stretch factor.
![Page 18: Peter Ruzicka](https://reader036.fdocuments.us/reader036/viewer/2022062314/568141f9550346895dadd6f5/html5/thumbnails/18.jpg)
Sirocco 2004 18
Problem 1b: Given a network and a bound on the load l and a bound h on the hop count, find a layout, to connect every two nodes (all-to-all). a. worst-case. b. average case.Note: consider it for a given stretch factor.
![Page 19: Peter Ruzicka](https://reader036.fdocuments.us/reader036/viewer/2022062314/568141f9550346895dadd6f5/html5/thumbnails/19.jpg)
Sirocco 2004 19
Problem 2: Input: Graph G, integers h, l > 0 , and a vertex v. Question: is there a VP layout for G, by which v can reach all other nodes, with hop count bounded by h and load bounded by l ?
![Page 20: Peter Ruzicka](https://reader036.fdocuments.us/reader036/viewer/2022062314/568141f9550346895dadd6f5/html5/thumbnails/20.jpg)
Sirocco 2004 20
P
P
P
NP
NP
P
…
NP
…
… … …
…
…
…
…
1 2 3 ....load
hop
1
2
...
3
Flammini, Eilam, Zaks
![Page 21: Peter Ruzicka](https://reader036.fdocuments.us/reader036/viewer/2022062314/568141f9550346895dadd6f5/html5/thumbnails/21.jpg)
Sirocco 2004 21
tree, meshgeneraldirectedpath network
Gertsel, Wool, Zaks
Feighelstein, Zaks
Problem 1: Given a network, pairs of nodes and bounds h and l, find a virtual path layout to connect these nodes with the load bounded by l and the hop count bounded by h.
![Page 22: Peter Ruzicka](https://reader036.fdocuments.us/reader036/viewer/2022062314/568141f9550346895dadd6f5/html5/thumbnails/22.jpg)
Sirocco 2004 22
T(l-1,h) T(l,h-1)
T(l,h)
Case 1: shortest paths (stretch factor = 1)
| ( , ) |l h
T l hh
![Page 23: Peter Ruzicka](https://reader036.fdocuments.us/reader036/viewer/2022062314/568141f9550346895dadd6f5/html5/thumbnails/23.jpg)
Sirocco 2004 23
2h3l 10)2,3( f
![Page 24: Peter Ruzicka](https://reader036.fdocuments.us/reader036/viewer/2022062314/568141f9550346895dadd6f5/html5/thumbnails/24.jpg)
Sirocco 2004 24
3h2l 10)3,2( f
![Page 25: Peter Ruzicka](https://reader036.fdocuments.us/reader036/viewer/2022062314/568141f9550346895dadd6f5/html5/thumbnails/25.jpg)
Sirocco 2004 25
2h3l3h2l
Use of binary trees
![Page 26: Peter Ruzicka](https://reader036.fdocuments.us/reader036/viewer/2022062314/568141f9550346895dadd6f5/html5/thumbnails/26.jpg)
Sirocco 2004 26
2h3l
![Page 27: Peter Ruzicka](https://reader036.fdocuments.us/reader036/viewer/2022062314/568141f9550346895dadd6f5/html5/thumbnails/27.jpg)
Sirocco 2004 27
3h2l
![Page 28: Peter Ruzicka](https://reader036.fdocuments.us/reader036/viewer/2022062314/568141f9550346895dadd6f5/html5/thumbnails/28.jpg)
Sirocco 2004 28
3h2l2h3l
![Page 29: Peter Ruzicka](https://reader036.fdocuments.us/reader036/viewer/2022062314/568141f9550346895dadd6f5/html5/thumbnails/29.jpg)
Sirocco 2004 29
TL(l-1,h) TR(l-1,h-1) TL(l,h-1)
TL(l,h)
Case 2: any paths (stretch factor > 1)
![Page 30: Peter Ruzicka](https://reader036.fdocuments.us/reader036/viewer/2022062314/568141f9550346895dadd6f5/html5/thumbnails/30.jpg)
Sirocco 2004 30
T(l-1,h)T(l-1,h-1)T(l,h-1) T(l,h-1)T(l-1,h) T(l-1,h-1)
![Page 31: Peter Ruzicka](https://reader036.fdocuments.us/reader036/viewer/2022062314/568141f9550346895dadd6f5/html5/thumbnails/31.jpg)
Sirocco 2004 31
l=3, h=2
![Page 32: Peter Ruzicka](https://reader036.fdocuments.us/reader036/viewer/2022062314/568141f9550346895dadd6f5/html5/thumbnails/32.jpg)
Sirocco 2004 32
min( , )
0
| ( , ) | 2l h
i
i
l hT l h
i i
Golomb
![Page 33: Peter Ruzicka](https://reader036.fdocuments.us/reader036/viewer/2022062314/568141f9550346895dadd6f5/html5/thumbnails/33.jpg)
Sirocco 2004 33
Use of ternary trees
![Page 34: Peter Ruzicka](https://reader036.fdocuments.us/reader036/viewer/2022062314/568141f9550346895dadd6f5/html5/thumbnails/34.jpg)
Sirocco 2004 34
The l1-norm |v| of an l-dimensional vector v = (x1 ,...,xl ) is defined as
|v| = |x1| + |x2| + ... + |xl|
ex: |(1,-3,0,2)| = |1|+|-3|+|0|+|2| = 6
Using spheres
![Page 35: Peter Ruzicka](https://reader036.fdocuments.us/reader036/viewer/2022062314/568141f9550346895dadd6f5/html5/thumbnails/35.jpg)
Sirocco 2004 35
Sp(l,r) - The l-dimensional l1-
Sphere of radius h : the set of
lattice points v=(x1,...,xl) with
distance at most h from the origin.
Sp(2,3): 2 - dimensionall1-Sphere of radius 3.point with l1-distance 3from the origin.
![Page 36: Peter Ruzicka](https://reader036.fdocuments.us/reader036/viewer/2022062314/568141f9550346895dadd6f5/html5/thumbnails/36.jpg)
Sirocco 2004 36
Covering Radius-
The l - dimensional Covering Radius of N is the radius of the smallest l-dimensional sphere containing at least N points
lRadius(N)
|Sp(2,0)| = 1
|Sp(2,1)| = 5|Sp(2,2)| = 13
|Sp(2,3)| = 25 Radius2 23 3( ) Radius2 7 2( )
![Page 37: Peter Ruzicka](https://reader036.fdocuments.us/reader036/viewer/2022062314/568141f9550346895dadd6f5/html5/thumbnails/37.jpg)
Sirocco 2004 37
For every ATM Chain Layouts with N nodes and maximal load l:
R N Radius Nl l( ) ( )
Radius R2 225 3 25 3( ) ( )
minimal radius of a layout with load l and N nodes
minimal radius of an l-dimensional spherewith at least N internal points
![Page 38: Peter Ruzicka](https://reader036.fdocuments.us/reader036/viewer/2022062314/568141f9550346895dadd6f5/html5/thumbnails/38.jpg)
Sirocco 2004 38
load = 3
(0,0,0)
(1,0,0)
-(1,0,0) -(2,0,0)
(1-,3,0)(1-,2,0)
-(1-,1,0)(0-,1,0) -(1,1,0)(1-,1,0)
-(1-,1,1)
hop = 4
dimension 3
radius = 4
![Page 39: Peter Ruzicka](https://reader036.fdocuments.us/reader036/viewer/2022062314/568141f9550346895dadd6f5/html5/thumbnails/39.jpg)
Sirocco 2004 39
the tree T(l,h) fills the sphere Sp(l,h) !!!
|T(l,h)| = |T(h,l)| , hence
|Sp(l,h)| = |Sp(h,l)|
![Page 40: Peter Ruzicka](https://reader036.fdocuments.us/reader036/viewer/2022062314/568141f9550346895dadd6f5/html5/thumbnails/40.jpg)
Sirocco 2004 40
Sp(1,2): 1 - dimensionall1-Sphere of radius 2.
Sp(2,1): 2 - dimensionall1-Sphere of radius 1.
![Page 41: Peter Ruzicka](https://reader036.fdocuments.us/reader036/viewer/2022062314/568141f9550346895dadd6f5/html5/thumbnails/41.jpg)
Sirocco 2004 41
For Upper Bound
21
)!(21
!)12(
|),(|
1
l
l
Nlh
lh
hlSpN
Using volume formulas, to Achieve bounds on h, given N and l
![Page 42: Peter Ruzicka](https://reader036.fdocuments.us/reader036/viewer/2022062314/568141f9550346895dadd6f5/html5/thumbnails/42.jpg)
Sirocco 2004 42
Problem: Given a chain network with N nodes and a given bound on the maximum load, find an optimal layout with minimum hop count (or diameter ) between all pairs of nodes. Bounds for in:
D Nl ( )
D Nl ( )
Kranakis, Krizanc, Pelc
Stacho, Vrt’o
Aiello, Bhatt, Chung, Rosenberg, Sitaraman
![Page 43: Peter Ruzicka](https://reader036.fdocuments.us/reader036/viewer/2022062314/568141f9550346895dadd6f5/html5/thumbnails/43.jpg)
Sirocco 2004 43
For every graph G with diameter D(G) and radius R(G): R(G) D(G) 2 R(G) Then:
Radius N D N Radius Nl l l( ) ( ) ( ) 2
![Page 44: Peter Ruzicka](https://reader036.fdocuments.us/reader036/viewer/2022062314/568141f9550346895dadd6f5/html5/thumbnails/44.jpg)
Sirocco 2004 44
Problem 3: Design and analyze approximation algorithms for general network.
Problem 4: Solve these problems to other measures (like load on the vertices, or bounded stretch factor)
one-to-all, all-to-all, some-to-some
![Page 45: Peter Ruzicka](https://reader036.fdocuments.us/reader036/viewer/2022062314/568141f9550346895dadd6f5/html5/thumbnails/45.jpg)
Sirocco 2004 45
Problem 7: Extend the duality results.
Problem 8: Extend the use of geometry.
![Page 46: Peter Ruzicka](https://reader036.fdocuments.us/reader036/viewer/2022062314/568141f9550346895dadd6f5/html5/thumbnails/46.jpg)
Sirocco 2004 46
More Problem and parameters
what are the input and the output? network: tree, mesh, general,
directed cost measure average vs. worst case complexity approximation algorithms routing dynamic, distributed …
cost of anarchy?
![Page 47: Peter Ruzicka](https://reader036.fdocuments.us/reader036/viewer/2022062314/568141f9550346895dadd6f5/html5/thumbnails/47.jpg)
Sirocco 2004 47
OutlineOutline
ATM networks modelATM networks model Optical networks modelOptical networks model Discussion – Discussion – ATM networksATM networks Discussion – Discussion – Optical networksOptical networks
![Page 48: Peter Ruzicka](https://reader036.fdocuments.us/reader036/viewer/2022062314/568141f9550346895dadd6f5/html5/thumbnails/48.jpg)
Sirocco 2004 48
the fiber serves as a transmission medium
Electronic switch
Optic fiber
1st generation
![Page 49: Peter Ruzicka](https://reader036.fdocuments.us/reader036/viewer/2022062314/568141f9550346895dadd6f5/html5/thumbnails/49.jpg)
Sirocco 2004 49
Optical switch
2nd generation
![Page 50: Peter Ruzicka](https://reader036.fdocuments.us/reader036/viewer/2022062314/568141f9550346895dadd6f5/html5/thumbnails/50.jpg)
Sirocco 2004 50
A virtual topology
![Page 51: Peter Ruzicka](https://reader036.fdocuments.us/reader036/viewer/2022062314/568141f9550346895dadd6f5/html5/thumbnails/51.jpg)
Sirocco 2004 51
Routing in the optical domainTwo complementing technologies:- Wavelength Division Multiplexing (WDM):
Transmission of data simultaneously at multiple wavelengths over same fiber- Optical switches: the output port is determined according to the input port and the wavelength
2nd generation
![Page 52: Peter Ruzicka](https://reader036.fdocuments.us/reader036/viewer/2022062314/568141f9550346895dadd6f5/html5/thumbnails/52.jpg)
Sirocco 2004 52
Example: Find a coloring with smallest number of wavelengths for a given set of lightpaths
![Page 53: Peter Ruzicka](https://reader036.fdocuments.us/reader036/viewer/2022062314/568141f9550346895dadd6f5/html5/thumbnails/53.jpg)
Sirocco 2004 53
OutlineOutline
ATM networks ATM networks modelmodel
Optical networks Optical networks modelmodel
Discussion – Discussion – ATM networksATM networks Discussion – Discussion – Optical networksOptical networks
![Page 54: Peter Ruzicka](https://reader036.fdocuments.us/reader036/viewer/2022062314/568141f9550346895dadd6f5/html5/thumbnails/54.jpg)
Sirocco 2004 54
Problem 1 : minimize the number of wavelengths
![Page 55: Peter Ruzicka](https://reader036.fdocuments.us/reader036/viewer/2022062314/568141f9550346895dadd6f5/html5/thumbnails/55.jpg)
Sirocco 2004 55
Smallest no. of wavelengths: 2
![Page 56: Peter Ruzicka](https://reader036.fdocuments.us/reader036/viewer/2022062314/568141f9550346895dadd6f5/html5/thumbnails/56.jpg)
Sirocco 2004 56
Problem 1a : Complexity
Problem 1b: Special networks, general networks
Problem 1 : minimize the number of wavelengths
![Page 57: Peter Ruzicka](https://reader036.fdocuments.us/reader036/viewer/2022062314/568141f9550346895dadd6f5/html5/thumbnails/57.jpg)
Sirocco 2004 57
Problem 1c : Given pairs to be connected, design a routing with minimal load, and then color it with minimal number of colors
……many references
Problem 1d : Given pairs to be connected, design a routing and a coloring with minimal number of colors.
![Page 58: Peter Ruzicka](https://reader036.fdocuments.us/reader036/viewer/2022062314/568141f9550346895dadd6f5/html5/thumbnails/58.jpg)
Sirocco 2004 58
Problem 2 : minimize the number of switches
![Page 59: Peter Ruzicka](https://reader036.fdocuments.us/reader036/viewer/2022062314/568141f9550346895dadd6f5/html5/thumbnails/59.jpg)
Sirocco 2004 59
no. of ADMs
ADM
![Page 60: Peter Ruzicka](https://reader036.fdocuments.us/reader036/viewer/2022062314/568141f9550346895dadd6f5/html5/thumbnails/60.jpg)
Sirocco 2004 60
Recall: smallest no. of wavelengths: 2
8 ADMs
![Page 61: Peter Ruzicka](https://reader036.fdocuments.us/reader036/viewer/2022062314/568141f9550346895dadd6f5/html5/thumbnails/61.jpg)
Sirocco 2004 61
Smallest no. of ADMs:
3 wavelengths
7
![Page 62: Peter Ruzicka](https://reader036.fdocuments.us/reader036/viewer/2022062314/568141f9550346895dadd6f5/html5/thumbnails/62.jpg)
Sirocco 2004 62
Problem 2a : complexity
Problem 2c : trees, special networks, general networks
Problem 2b : approximation algorithms
Problem 2 : minimize the number of switches
Problem 2d : given pairs to connect, design a routing and a coloring with smallest number of ADMs.
![Page 63: Peter Ruzicka](https://reader036.fdocuments.us/reader036/viewer/2022062314/568141f9550346895dadd6f5/html5/thumbnails/63.jpg)
Sirocco 2004 63
clearly:
result:
1 2 algopt
1 ? algopt
Problem 2b : approximation algorithms
![Page 64: Peter Ruzicka](https://reader036.fdocuments.us/reader036/viewer/2022062314/568141f9550346895dadd6f5/html5/thumbnails/64.jpg)
Sirocco 2004 64
Calinescu, Wan
Ring network
Gerstel, Lin, Sasaki
1 2 algopt
3
2
algopt
![Page 65: Peter Ruzicka](https://reader036.fdocuments.us/reader036/viewer/2022062314/568141f9550346895dadd6f5/html5/thumbnails/65.jpg)
Sirocco 2004 65
11 7 3
8 5 2
algopt
Shalom, Zaks
Ring network
![Page 66: Peter Ruzicka](https://reader036.fdocuments.us/reader036/viewer/2022062314/568141f9550346895dadd6f5/html5/thumbnails/66.jpg)
Sirocco 2004 66
1. Number the nodes from 0 to n-1 (how?)
2. Color all lightpaths passing through or starting at node 0.
Gerstel, Lin, Sasaki
![Page 67: Peter Ruzicka](https://reader036.fdocuments.us/reader036/viewer/2022062314/568141f9550346895dadd6f5/html5/thumbnails/67.jpg)
Sirocco 2004 67
3. Scan nodes from 1 to n-1. Color each lightpath starting at i: The colors of the lightpaths ending at i are used first, and only then other colors are used, from lowest numbered first. While color is not valid for a lightpath, try next color .
![Page 68: Peter Ruzicka](https://reader036.fdocuments.us/reader036/viewer/2022062314/568141f9550346895dadd6f5/html5/thumbnails/68.jpg)
Sirocco 2004 68
23
4
014
13
12
11
109 8
5
6
7
1
![Page 69: Peter Ruzicka](https://reader036.fdocuments.us/reader036/viewer/2022062314/568141f9550346895dadd6f5/html5/thumbnails/69.jpg)
Sirocco 2004 69
23
4
014
13
12
11
109 8
5
6
7
1
Color not valid…
![Page 70: Peter Ruzicka](https://reader036.fdocuments.us/reader036/viewer/2022062314/568141f9550346895dadd6f5/html5/thumbnails/70.jpg)
Sirocco 2004 70
Calinescu, Wan
Use maximum matchings at each node.
![Page 71: Peter Ruzicka](https://reader036.fdocuments.us/reader036/viewer/2022062314/568141f9550346895dadd6f5/html5/thumbnails/71.jpg)
Sirocco 2004 71
Combine ideas from
together with preprocessingof removing cycles, which uses an approximation algorithm
to find all cycles up to a given size.
Shalom, Zaks
Calinescu, WanGerstel, Lin, Sasaki
Hurkens, Schrijver
![Page 72: Peter Ruzicka](https://reader036.fdocuments.us/reader036/viewer/2022062314/568141f9550346895dadd6f5/html5/thumbnails/72.jpg)
Sirocco 2004 72
Analysis:
Use of linear programming
to show
we show a set of constraints that, together with
cannot be satisfied .
7 11( )
5 8
algopt
7 11( )
5 8
algopt
11 7 3
8 5 2
algopt
![Page 73: Peter Ruzicka](https://reader036.fdocuments.us/reader036/viewer/2022062314/568141f9550346895dadd6f5/html5/thumbnails/73.jpg)
Sirocco 2004 73
Problem 1 : minimize the number of wavelengths.Problem 2 : minimize the number of switches.
Problem 3 : find trade-offs between the two measures of number of switches and number of colors.
![Page 74: Peter Ruzicka](https://reader036.fdocuments.us/reader036/viewer/2022062314/568141f9550346895dadd6f5/html5/thumbnails/74.jpg)
Sirocco 2004 74
Problem 4 : Given a set of lightpaths, add a minimal number of lightpaths and color all lightpaths, such that all lightpaths will be partitioned into cycles.
Eilam, Moran, Zaks
fast and simple protection mehanism
![Page 75: Peter Ruzicka](https://reader036.fdocuments.us/reader036/viewer/2022062314/568141f9550346895dadd6f5/html5/thumbnails/75.jpg)
Sirocco 2004 75
d
b
f
a
g c
e
cost = 7
![Page 76: Peter Ruzicka](https://reader036.fdocuments.us/reader036/viewer/2022062314/568141f9550346895dadd6f5/html5/thumbnails/76.jpg)
Sirocco 2004 76
Problem 4a: Characterize the networks topologies G, in which any simple path can be extended to a simple cycle.
Problem 4 : Given a set of lightpaths, add a minimal number of lightpaths and color all lightpaths, such that all lightpaths will be partitioned into cycles.
![Page 77: Peter Ruzicka](https://reader036.fdocuments.us/reader036/viewer/2022062314/568141f9550346895dadd6f5/html5/thumbnails/77.jpg)
Sirocco 2004 77
Answer: iff
- G is randomly Hamltonian ( = each DFS tree is a path) , or
- G is a ring, a complete graph, or a complete balanced bipartite graph
Chartrand, Kronk
Korach, Ostfeld
![Page 78: Peter Ruzicka](https://reader036.fdocuments.us/reader036/viewer/2022062314/568141f9550346895dadd6f5/html5/thumbnails/78.jpg)
Sirocco 2004 78
Liu, Li, Wan, Frieder
Problem 4b : Input: A Graph G, a set of lightpaths in G, a number k. Question : is there a ring partition of cost k ?
Problem 4 : Given a set of lightpaths, add a minimal number of lightpaths and color all lightpaths, such that all lightpaths will be partitioned into cycles.
![Page 79: Peter Ruzicka](https://reader036.fdocuments.us/reader036/viewer/2022062314/568141f9550346895dadd6f5/html5/thumbnails/79.jpg)
Sirocco 2004 79
Problem 4c: Design and analyze an approximation algorithm.
Problem 4 : Given a set of lightpaths, add a minimal number of lightpaths and color all lightpaths, such that all lightpaths will be partitioned into cycles.
![Page 80: Peter Ruzicka](https://reader036.fdocuments.us/reader036/viewer/2022062314/568141f9550346895dadd6f5/html5/thumbnails/80.jpg)
Sirocco 2004 80
A trivial heuristics:
Given a set of lightpaths D, extend each lightpath to a cycle by adding one lightpath.
cost = 2 n ( |D|=n )
or: cost opt + n
![Page 81: Peter Ruzicka](https://reader036.fdocuments.us/reader036/viewer/2022062314/568141f9550346895dadd6f5/html5/thumbnails/81.jpg)
Sirocco 2004 81
question: is there a heuristics
for which
cost = opt + n ( < 1 ) ?
answer: no.
![Page 82: Peter Ruzicka](https://reader036.fdocuments.us/reader036/viewer/2022062314/568141f9550346895dadd6f5/html5/thumbnails/82.jpg)
Sirocco 2004 82
question: is there a heuristics
for which
cost opt + k n (k < 1 ) ?
answer: yes.
cost opt + 3/5 n
![Page 83: Peter Ruzicka](https://reader036.fdocuments.us/reader036/viewer/2022062314/568141f9550346895dadd6f5/html5/thumbnails/83.jpg)
Sirocco 2004 83
We showed the measure of total
number of switches, thus :
Note:
1 2 algopt
0 alg, opt n
Problem 4d : What about the saving in alg vs the saving in opt in the number of switches?
o savings_of _alg saving_of _opt n
Problem 4c: Design and analyze an approximation algorithm.
![Page 84: Peter Ruzicka](https://reader036.fdocuments.us/reader036/viewer/2022062314/568141f9550346895dadd6f5/html5/thumbnails/84.jpg)
Sirocco 2004 84
One-band routers :
DE
MU
X
DE
MU
X
DE
MU
X
Received
Forwarded
Problem 5 : find a routing with linear filters.
Flammini, Navara
![Page 85: Peter Ruzicka](https://reader036.fdocuments.us/reader036/viewer/2022062314/568141f9550346895dadd6f5/html5/thumbnails/85.jpg)
Sirocco 2004 85
Problem 5 : find a routing with linear filters.
Problem 5a : Is it always possible to find a routing?
![Page 86: Peter Ruzicka](https://reader036.fdocuments.us/reader036/viewer/2022062314/568141f9550346895dadd6f5/html5/thumbnails/86.jpg)
Sirocco 2004 86
No: One-band routers are not universal:
ru2
u3
u1
v2
v1
v3
z1
z2
z3
w1
w2
w3
![Page 87: Peter Ruzicka](https://reader036.fdocuments.us/reader036/viewer/2022062314/568141f9550346895dadd6f5/html5/thumbnails/87.jpg)
Sirocco 2004 87
Problem 5 : find a routing with linear filters.
Problem 5b : Define other routers and explor etheir capabilities.
![Page 88: Peter Ruzicka](https://reader036.fdocuments.us/reader036/viewer/2022062314/568141f9550346895dadd6f5/html5/thumbnails/88.jpg)
Sirocco 2004 88
Problem 6 : Find a uniform all-to-all routing in a ring, using a minimum number of ADMs.
i
j
N=13
13 12 156 Units of flow
Cost:
13+5+3=21 ADMs
![Page 89: Peter Ruzicka](https://reader036.fdocuments.us/reader036/viewer/2022062314/568141f9550346895dadd6f5/html5/thumbnails/89.jpg)
Sirocco 2004 89
5
1
3
N=13
2
1
1
4
221
21 1
![Page 90: Peter Ruzicka](https://reader036.fdocuments.us/reader036/viewer/2022062314/568141f9550346895dadd6f5/html5/thumbnails/90.jpg)
Sirocco 2004 90
Shalom, Zaks
Problem 6a : What can be said about simple polygons? about non-simple polygons?
![Page 91: Peter Ruzicka](https://reader036.fdocuments.us/reader036/viewer/2022062314/568141f9550346895dadd6f5/html5/thumbnails/91.jpg)
Sirocco 2004 91
what are the input and the output? cost measure, worst case vs. average
case. coloring and routing Wavelength convertion networks: specific, general complexity approximation algorithms Dynamic …
More Problem and parameters
cost of anarchy?
![Page 92: Peter Ruzicka](https://reader036.fdocuments.us/reader036/viewer/2022062314/568141f9550346895dadd6f5/html5/thumbnails/92.jpg)
Sirocco 2004 92
Questions ?
![Page 93: Peter Ruzicka](https://reader036.fdocuments.us/reader036/viewer/2022062314/568141f9550346895dadd6f5/html5/thumbnails/93.jpg)
Sirocco 2004 93
Thank You