1 optimal oblivious routing in hole-free networks costas busch louisiana state university malik...
TRANSCRIPT
![Page 1: 1 Optimal Oblivious Routing in Hole-Free Networks Costas Busch Louisiana State University Malik Magdon-Ismail Rensselaer Polytechnic Institute](https://reader036.vdocument.in/reader036/viewer/2022062322/56649ed05503460f94bddc65/html5/thumbnails/1.jpg)
1
Optimal Oblivious Routing in Hole-Free Networks
Costas BuschLouisiana State University
Malik Magdon-IsmailRensselaer Polytechnic Institute
![Page 2: 1 Optimal Oblivious Routing in Hole-Free Networks Costas Busch Louisiana State University Malik Magdon-Ismail Rensselaer Polytechnic Institute](https://reader036.vdocument.in/reader036/viewer/2022062322/56649ed05503460f94bddc65/html5/thumbnails/2.jpg)
2
1u
1v
2u2v
3u
3v
Routing: choose paths from sources to destinations
![Page 3: 1 Optimal Oblivious Routing in Hole-Free Networks Costas Busch Louisiana State University Malik Magdon-Ismail Rensselaer Polytechnic Institute](https://reader036.vdocument.in/reader036/viewer/2022062322/56649ed05503460f94bddc65/html5/thumbnails/3.jpg)
3
Edge congestion
edgeC
maximum number of paths that use any edge
Node congestion
nodeC
maximum number of paths that use any node
![Page 4: 1 Optimal Oblivious Routing in Hole-Free Networks Costas Busch Louisiana State University Malik Magdon-Ismail Rensselaer Polytechnic Institute](https://reader036.vdocument.in/reader036/viewer/2022062322/56649ed05503460f94bddc65/html5/thumbnails/4.jpg)
4
Length of chosen pathLength of shortest path
uv
Stretch=
5.18
12stretch
shortest path
chosen path
![Page 5: 1 Optimal Oblivious Routing in Hole-Free Networks Costas Busch Louisiana State University Malik Magdon-Ismail Rensselaer Polytechnic Institute](https://reader036.vdocument.in/reader036/viewer/2022062322/56649ed05503460f94bddc65/html5/thumbnails/5.jpg)
5
Oblivious RoutingEach packet path choice is independent of other packet path choices
![Page 6: 1 Optimal Oblivious Routing in Hole-Free Networks Costas Busch Louisiana State University Malik Magdon-Ismail Rensselaer Polytechnic Institute](https://reader036.vdocument.in/reader036/viewer/2022062322/56649ed05503460f94bddc65/html5/thumbnails/6.jpg)
6
1q
2q
3q
Path choices:
4q
4q
5q
kqq ,,1
Probability of choosing a path: ]Pr[ iq
1]Pr[1
k
iiq
![Page 7: 1 Optimal Oblivious Routing in Hole-Free Networks Costas Busch Louisiana State University Malik Magdon-Ismail Rensselaer Polytechnic Institute](https://reader036.vdocument.in/reader036/viewer/2022062322/56649ed05503460f94bddc65/html5/thumbnails/7.jpg)
7
Benefits of oblivious routing:
•Appropriate for dynamic packet arrivals
•Distributed
•Needs no global coordination
![Page 8: 1 Optimal Oblivious Routing in Hole-Free Networks Costas Busch Louisiana State University Malik Magdon-Ismail Rensselaer Polytechnic Institute](https://reader036.vdocument.in/reader036/viewer/2022062322/56649ed05503460f94bddc65/html5/thumbnails/8.jpg)
8
Hole-free network
![Page 9: 1 Optimal Oblivious Routing in Hole-Free Networks Costas Busch Louisiana State University Malik Magdon-Ismail Rensselaer Polytechnic Institute](https://reader036.vdocument.in/reader036/viewer/2022062322/56649ed05503460f94bddc65/html5/thumbnails/9.jpg)
9
Our contribution in this work:Oblivious routing in hole-free networks
Constant stretch
Small congestion
)log( * nCOC nodenode )1(stretch O
![Page 10: 1 Optimal Oblivious Routing in Hole-Free Networks Costas Busch Louisiana State University Malik Magdon-Ismail Rensselaer Polytechnic Institute](https://reader036.vdocument.in/reader036/viewer/2022062322/56649ed05503460f94bddc65/html5/thumbnails/10.jpg)
10
Holes
![Page 11: 1 Optimal Oblivious Routing in Hole-Free Networks Costas Busch Louisiana State University Malik Magdon-Ismail Rensselaer Polytechnic Institute](https://reader036.vdocument.in/reader036/viewer/2022062322/56649ed05503460f94bddc65/html5/thumbnails/11.jpg)
11
Related Work
Valiant [SICOMP’82]:First oblivious routing algorithmsfor permutations on butterfly and hypercube
butterfly butterfly (reversed)
![Page 12: 1 Optimal Oblivious Routing in Hole-Free Networks Costas Busch Louisiana State University Malik Magdon-Ismail Rensselaer Polytechnic Institute](https://reader036.vdocument.in/reader036/viewer/2022062322/56649ed05503460f94bddc65/html5/thumbnails/12.jpg)
12
d-dimensional Grid:
nCdOC edgeedge log*
d
nCC edgeedge
log*Lower bound for oblivious routing:
Maggs, Meyer auf der Heide, Voecking, Westermann [FOCS’97]:
![Page 13: 1 Optimal Oblivious Routing in Hole-Free Networks Costas Busch Louisiana State University Malik Magdon-Ismail Rensselaer Polytechnic Institute](https://reader036.vdocument.in/reader036/viewer/2022062322/56649ed05503460f94bddc65/html5/thumbnails/13.jpg)
13
Azar et al. [STOC03]Harrelson et al. [SPAA03]Bienkowski et al. [SPAA03]
Arbitrary Graphs (existential result): nCOC edgeedge
3* log
Constructive Results:
Racke [FOCS’02]:
nCOC edgeedge log* Racke [STOC’08]:
![Page 14: 1 Optimal Oblivious Routing in Hole-Free Networks Costas Busch Louisiana State University Malik Magdon-Ismail Rensselaer Polytechnic Institute](https://reader036.vdocument.in/reader036/viewer/2022062322/56649ed05503460f94bddc65/html5/thumbnails/14.jpg)
14
Hierarchical clusteringGeneral Approach:
![Page 15: 1 Optimal Oblivious Routing in Hole-Free Networks Costas Busch Louisiana State University Malik Magdon-Ismail Rensselaer Polytechnic Institute](https://reader036.vdocument.in/reader036/viewer/2022062322/56649ed05503460f94bddc65/html5/thumbnails/15.jpg)
15
Hierarchical clusteringGeneral Approach:
![Page 16: 1 Optimal Oblivious Routing in Hole-Free Networks Costas Busch Louisiana State University Malik Magdon-Ismail Rensselaer Polytechnic Institute](https://reader036.vdocument.in/reader036/viewer/2022062322/56649ed05503460f94bddc65/html5/thumbnails/16.jpg)
16
At the lowest level every node is a cluster
![Page 17: 1 Optimal Oblivious Routing in Hole-Free Networks Costas Busch Louisiana State University Malik Magdon-Ismail Rensselaer Polytechnic Institute](https://reader036.vdocument.in/reader036/viewer/2022062322/56649ed05503460f94bddc65/html5/thumbnails/17.jpg)
17
source destination
![Page 18: 1 Optimal Oblivious Routing in Hole-Free Networks Costas Busch Louisiana State University Malik Magdon-Ismail Rensselaer Polytechnic Institute](https://reader036.vdocument.in/reader036/viewer/2022062322/56649ed05503460f94bddc65/html5/thumbnails/18.jpg)
18
Pick random node
![Page 19: 1 Optimal Oblivious Routing in Hole-Free Networks Costas Busch Louisiana State University Malik Magdon-Ismail Rensselaer Polytechnic Institute](https://reader036.vdocument.in/reader036/viewer/2022062322/56649ed05503460f94bddc65/html5/thumbnails/19.jpg)
19
Pick random node
![Page 20: 1 Optimal Oblivious Routing in Hole-Free Networks Costas Busch Louisiana State University Malik Magdon-Ismail Rensselaer Polytechnic Institute](https://reader036.vdocument.in/reader036/viewer/2022062322/56649ed05503460f94bddc65/html5/thumbnails/20.jpg)
20
Pick random node
![Page 21: 1 Optimal Oblivious Routing in Hole-Free Networks Costas Busch Louisiana State University Malik Magdon-Ismail Rensselaer Polytechnic Institute](https://reader036.vdocument.in/reader036/viewer/2022062322/56649ed05503460f94bddc65/html5/thumbnails/21.jpg)
21
Pick random node
![Page 22: 1 Optimal Oblivious Routing in Hole-Free Networks Costas Busch Louisiana State University Malik Magdon-Ismail Rensselaer Polytechnic Institute](https://reader036.vdocument.in/reader036/viewer/2022062322/56649ed05503460f94bddc65/html5/thumbnails/22.jpg)
22
Pick random node
![Page 23: 1 Optimal Oblivious Routing in Hole-Free Networks Costas Busch Louisiana State University Malik Magdon-Ismail Rensselaer Polytechnic Institute](https://reader036.vdocument.in/reader036/viewer/2022062322/56649ed05503460f94bddc65/html5/thumbnails/23.jpg)
23
Pick random node
![Page 24: 1 Optimal Oblivious Routing in Hole-Free Networks Costas Busch Louisiana State University Malik Magdon-Ismail Rensselaer Polytechnic Institute](https://reader036.vdocument.in/reader036/viewer/2022062322/56649ed05503460f94bddc65/html5/thumbnails/24.jpg)
24
Pick random node
![Page 25: 1 Optimal Oblivious Routing in Hole-Free Networks Costas Busch Louisiana State University Malik Magdon-Ismail Rensselaer Polytechnic Institute](https://reader036.vdocument.in/reader036/viewer/2022062322/56649ed05503460f94bddc65/html5/thumbnails/25.jpg)
25
![Page 26: 1 Optimal Oblivious Routing in Hole-Free Networks Costas Busch Louisiana State University Malik Magdon-Ismail Rensselaer Polytechnic Institute](https://reader036.vdocument.in/reader036/viewer/2022062322/56649ed05503460f94bddc65/html5/thumbnails/26.jpg)
26
Adjacent nodes may follow long paths
Big stretchProblem:
![Page 27: 1 Optimal Oblivious Routing in Hole-Free Networks Costas Busch Louisiana State University Malik Magdon-Ismail Rensselaer Polytechnic Institute](https://reader036.vdocument.in/reader036/viewer/2022062322/56649ed05503460f94bddc65/html5/thumbnails/27.jpg)
27
An Impossibility Result
Stretch and congestion cannot be minimized simultaneously in arbitrary graphs
![Page 28: 1 Optimal Oblivious Routing in Hole-Free Networks Costas Busch Louisiana State University Malik Magdon-Ismail Rensselaer Polytechnic Institute](https://reader036.vdocument.in/reader036/viewer/2022062322/56649ed05503460f94bddc65/html5/thumbnails/28.jpg)
28
)( nEach path has length
n paths
Length 1
Source of packetsn
Destinationof all packets
Example graph:
nodesn
![Page 29: 1 Optimal Oblivious Routing in Hole-Free Networks Costas Busch Louisiana State University Malik Magdon-Ismail Rensselaer Polytechnic Institute](https://reader036.vdocument.in/reader036/viewer/2022062322/56649ed05503460f94bddc65/html5/thumbnails/29.jpg)
29
n packets in one path
Stretch =
Edge congestion =
1
n
![Page 30: 1 Optimal Oblivious Routing in Hole-Free Networks Costas Busch Louisiana State University Malik Magdon-Ismail Rensselaer Polytechnic Institute](https://reader036.vdocument.in/reader036/viewer/2022062322/56649ed05503460f94bddc65/html5/thumbnails/30.jpg)
30
1 packet per path
n
1
Stretch =
Edge congestion =
![Page 31: 1 Optimal Oblivious Routing in Hole-Free Networks Costas Busch Louisiana State University Malik Magdon-Ismail Rensselaer Polytechnic Institute](https://reader036.vdocument.in/reader036/viewer/2022062322/56649ed05503460f94bddc65/html5/thumbnails/31.jpg)
31
nCdOC edgeedge log*
)(stretch 2dO
Result for Grids:
Busch, Magdon-Ismail, Xi [TC’08]
For d=2, a similar result given by C. Scheideler
![Page 32: 1 Optimal Oblivious Routing in Hole-Free Networks Costas Busch Louisiana State University Malik Magdon-Ismail Rensselaer Polytechnic Institute](https://reader036.vdocument.in/reader036/viewer/2022062322/56649ed05503460f94bddc65/html5/thumbnails/32.jpg)
32
Special graphs embedded in the 2-dimensional plane:
Constant stretch
Small congestion
)log( * nCOC nodenode
)log( * nCOC edgeedge
degree
Busch, Magdon-Ismail, Xi [SPAA 2005]:
)1(stretch O
![Page 33: 1 Optimal Oblivious Routing in Hole-Free Networks Costas Busch Louisiana State University Malik Magdon-Ismail Rensselaer Polytechnic Institute](https://reader036.vdocument.in/reader036/viewer/2022062322/56649ed05503460f94bddc65/html5/thumbnails/33.jpg)
33
Embeddings in wide, closed-curved areas
![Page 34: 1 Optimal Oblivious Routing in Hole-Free Networks Costas Busch Louisiana State University Malik Magdon-Ismail Rensselaer Polytechnic Institute](https://reader036.vdocument.in/reader036/viewer/2022062322/56649ed05503460f94bddc65/html5/thumbnails/34.jpg)
34
Graph models appropriate for various wireless network topologies
Transmission radius
![Page 35: 1 Optimal Oblivious Routing in Hole-Free Networks Costas Busch Louisiana State University Malik Magdon-Ismail Rensselaer Polytechnic Institute](https://reader036.vdocument.in/reader036/viewer/2022062322/56649ed05503460f94bddc65/html5/thumbnails/35.jpg)
35
Basic Idea
source destination
![Page 36: 1 Optimal Oblivious Routing in Hole-Free Networks Costas Busch Louisiana State University Malik Magdon-Ismail Rensselaer Polytechnic Institute](https://reader036.vdocument.in/reader036/viewer/2022062322/56649ed05503460f94bddc65/html5/thumbnails/36.jpg)
36
Pick a random intermediate node
![Page 37: 1 Optimal Oblivious Routing in Hole-Free Networks Costas Busch Louisiana State University Malik Magdon-Ismail Rensselaer Polytechnic Institute](https://reader036.vdocument.in/reader036/viewer/2022062322/56649ed05503460f94bddc65/html5/thumbnails/37.jpg)
37
Construct path through intermediate node
![Page 38: 1 Optimal Oblivious Routing in Hole-Free Networks Costas Busch Louisiana State University Malik Magdon-Ismail Rensselaer Polytechnic Institute](https://reader036.vdocument.in/reader036/viewer/2022062322/56649ed05503460f94bddc65/html5/thumbnails/38.jpg)
38
However, algorithm does not extend to arbitrary closed shapes
![Page 39: 1 Optimal Oblivious Routing in Hole-Free Networks Costas Busch Louisiana State University Malik Magdon-Ismail Rensselaer Polytechnic Institute](https://reader036.vdocument.in/reader036/viewer/2022062322/56649ed05503460f94bddc65/html5/thumbnails/39.jpg)
39
Our contribution in this work:Oblivious routing in hole-free networks
![Page 40: 1 Optimal Oblivious Routing in Hole-Free Networks Costas Busch Louisiana State University Malik Magdon-Ismail Rensselaer Polytechnic Institute](https://reader036.vdocument.in/reader036/viewer/2022062322/56649ed05503460f94bddc65/html5/thumbnails/40.jpg)
40
Approach: route within square areas
)1(stretch O )log( * nCOC nodenode
![Page 41: 1 Optimal Oblivious Routing in Hole-Free Networks Costas Busch Louisiana State University Malik Magdon-Ismail Rensselaer Polytechnic Institute](https://reader036.vdocument.in/reader036/viewer/2022062322/56649ed05503460f94bddc65/html5/thumbnails/41.jpg)
41
nn grid
![Page 42: 1 Optimal Oblivious Routing in Hole-Free Networks Costas Busch Louisiana State University Malik Magdon-Ismail Rensselaer Polytechnic Institute](https://reader036.vdocument.in/reader036/viewer/2022062322/56649ed05503460f94bddc65/html5/thumbnails/42.jpg)
42
simple area in grid (hole-free area)
![Page 43: 1 Optimal Oblivious Routing in Hole-Free Networks Costas Busch Louisiana State University Malik Magdon-Ismail Rensselaer Polytechnic Institute](https://reader036.vdocument.in/reader036/viewer/2022062322/56649ed05503460f94bddc65/html5/thumbnails/43.jpg)
43
Hole-free network
![Page 44: 1 Optimal Oblivious Routing in Hole-Free Networks Costas Busch Louisiana State University Malik Magdon-Ismail Rensselaer Polytechnic Institute](https://reader036.vdocument.in/reader036/viewer/2022062322/56649ed05503460f94bddc65/html5/thumbnails/44.jpg)
44
Canonical square decomposition
![Page 45: 1 Optimal Oblivious Routing in Hole-Free Networks Costas Busch Louisiana State University Malik Magdon-Ismail Rensselaer Polytechnic Institute](https://reader036.vdocument.in/reader036/viewer/2022062322/56649ed05503460f94bddc65/html5/thumbnails/45.jpg)
45
Canonical square decomposition
![Page 46: 1 Optimal Oblivious Routing in Hole-Free Networks Costas Busch Louisiana State University Malik Magdon-Ismail Rensselaer Polytechnic Institute](https://reader036.vdocument.in/reader036/viewer/2022062322/56649ed05503460f94bddc65/html5/thumbnails/46.jpg)
46
Canonical square decomposition
![Page 47: 1 Optimal Oblivious Routing in Hole-Free Networks Costas Busch Louisiana State University Malik Magdon-Ismail Rensselaer Polytechnic Institute](https://reader036.vdocument.in/reader036/viewer/2022062322/56649ed05503460f94bddc65/html5/thumbnails/47.jpg)
47
Canonical square decomposition
![Page 48: 1 Optimal Oblivious Routing in Hole-Free Networks Costas Busch Louisiana State University Malik Magdon-Ismail Rensselaer Polytechnic Institute](https://reader036.vdocument.in/reader036/viewer/2022062322/56649ed05503460f94bddc65/html5/thumbnails/48.jpg)
48
![Page 49: 1 Optimal Oblivious Routing in Hole-Free Networks Costas Busch Louisiana State University Malik Magdon-Ismail Rensselaer Polytechnic Institute](https://reader036.vdocument.in/reader036/viewer/2022062322/56649ed05503460f94bddc65/html5/thumbnails/49.jpg)
49
![Page 50: 1 Optimal Oblivious Routing in Hole-Free Networks Costas Busch Louisiana State University Malik Magdon-Ismail Rensselaer Polytechnic Institute](https://reader036.vdocument.in/reader036/viewer/2022062322/56649ed05503460f94bddc65/html5/thumbnails/50.jpg)
50
u
v
Shortest path
![Page 51: 1 Optimal Oblivious Routing in Hole-Free Networks Costas Busch Louisiana State University Malik Magdon-Ismail Rensselaer Polytechnic Institute](https://reader036.vdocument.in/reader036/viewer/2022062322/56649ed05503460f94bddc65/html5/thumbnails/51.jpg)
51
u
v
Canonical square sequence
![Page 52: 1 Optimal Oblivious Routing in Hole-Free Networks Costas Busch Louisiana State University Malik Magdon-Ismail Rensselaer Polytechnic Institute](https://reader036.vdocument.in/reader036/viewer/2022062322/56649ed05503460f94bddc65/html5/thumbnails/52.jpg)
52
u
v
A random path in canonical squares
![Page 53: 1 Optimal Oblivious Routing in Hole-Free Networks Costas Busch Louisiana State University Malik Magdon-Ismail Rensselaer Polytechnic Institute](https://reader036.vdocument.in/reader036/viewer/2022062322/56649ed05503460f94bddc65/html5/thumbnails/53.jpg)
53
u
v
Path has constant stretch
![Page 54: 1 Optimal Oblivious Routing in Hole-Free Networks Costas Busch Louisiana State University Malik Magdon-Ismail Rensselaer Polytechnic Institute](https://reader036.vdocument.in/reader036/viewer/2022062322/56649ed05503460f94bddc65/html5/thumbnails/54.jpg)
54
Random 2-bend pathsor 1-bend paths in square sequence