1 oblivious routing in wireless networks costas busch rensselaer polytechnic institute joint work...
TRANSCRIPT
![Page 1: 1 Oblivious Routing in Wireless networks Costas Busch Rensselaer Polytechnic Institute Joint work with: Malik Magdon-Ismail and Jing Xi](https://reader030.vdocuments.mx/reader030/viewer/2022032709/56649ed05503460f94bddbfb/html5/thumbnails/1.jpg)
1
Oblivious Routing in Wireless networks
Costas BuschRensselaer Polytechnic Institute
Joint work with: Malik Magdon-Ismail and Jing Xi
![Page 2: 1 Oblivious Routing in Wireless networks Costas Busch Rensselaer Polytechnic Institute Joint work with: Malik Magdon-Ismail and Jing Xi](https://reader030.vdocuments.mx/reader030/viewer/2022032709/56649ed05503460f94bddbfb/html5/thumbnails/2.jpg)
2
Length of chosen pathLength of shortest path
uv
Stretch=
5.1812
stretchshortest path
chosen path
![Page 3: 1 Oblivious Routing in Wireless networks Costas Busch Rensselaer Polytechnic Institute Joint work with: Malik Magdon-Ismail and Jing Xi](https://reader030.vdocuments.mx/reader030/viewer/2022032709/56649ed05503460f94bddbfb/html5/thumbnails/3.jpg)
3
source destination
![Page 4: 1 Oblivious Routing in Wireless networks Costas Busch Rensselaer Polytechnic Institute Joint work with: Malik Magdon-Ismail and Jing Xi](https://reader030.vdocuments.mx/reader030/viewer/2022032709/56649ed05503460f94bddbfb/html5/thumbnails/4.jpg)
4
Pick random node
![Page 5: 1 Oblivious Routing in Wireless networks Costas Busch Rensselaer Polytechnic Institute Joint work with: Malik Magdon-Ismail and Jing Xi](https://reader030.vdocuments.mx/reader030/viewer/2022032709/56649ed05503460f94bddbfb/html5/thumbnails/5.jpg)
5
Pick random node
![Page 6: 1 Oblivious Routing in Wireless networks Costas Busch Rensselaer Polytechnic Institute Joint work with: Malik Magdon-Ismail and Jing Xi](https://reader030.vdocuments.mx/reader030/viewer/2022032709/56649ed05503460f94bddbfb/html5/thumbnails/6.jpg)
6
Pick random node
![Page 7: 1 Oblivious Routing in Wireless networks Costas Busch Rensselaer Polytechnic Institute Joint work with: Malik Magdon-Ismail and Jing Xi](https://reader030.vdocuments.mx/reader030/viewer/2022032709/56649ed05503460f94bddbfb/html5/thumbnails/7.jpg)
7
Pick random node
![Page 8: 1 Oblivious Routing in Wireless networks Costas Busch Rensselaer Polytechnic Institute Joint work with: Malik Magdon-Ismail and Jing Xi](https://reader030.vdocuments.mx/reader030/viewer/2022032709/56649ed05503460f94bddbfb/html5/thumbnails/8.jpg)
8
Pick random node
![Page 9: 1 Oblivious Routing in Wireless networks Costas Busch Rensselaer Polytechnic Institute Joint work with: Malik Magdon-Ismail and Jing Xi](https://reader030.vdocuments.mx/reader030/viewer/2022032709/56649ed05503460f94bddbfb/html5/thumbnails/9.jpg)
9
Pick random node
![Page 10: 1 Oblivious Routing in Wireless networks Costas Busch Rensselaer Polytechnic Institute Joint work with: Malik Magdon-Ismail and Jing Xi](https://reader030.vdocuments.mx/reader030/viewer/2022032709/56649ed05503460f94bddbfb/html5/thumbnails/10.jpg)
10
Pick random node
![Page 11: 1 Oblivious Routing in Wireless networks Costas Busch Rensselaer Polytechnic Institute Joint work with: Malik Magdon-Ismail and Jing Xi](https://reader030.vdocuments.mx/reader030/viewer/2022032709/56649ed05503460f94bddbfb/html5/thumbnails/11.jpg)
11
![Page 12: 1 Oblivious Routing in Wireless networks Costas Busch Rensselaer Polytechnic Institute Joint work with: Malik Magdon-Ismail and Jing Xi](https://reader030.vdocuments.mx/reader030/viewer/2022032709/56649ed05503460f94bddbfb/html5/thumbnails/12.jpg)
12
Adjacent nodes may follow long paths
Big stretchProblem:
![Page 13: 1 Oblivious Routing in Wireless networks Costas Busch Rensselaer Polytechnic Institute Joint work with: Malik Magdon-Ismail and Jing Xi](https://reader030.vdocuments.mx/reader030/viewer/2022032709/56649ed05503460f94bddbfb/html5/thumbnails/13.jpg)
13
An Impossibility Result
Stretch and congestion cannot be minimized simultaneously in arbitrary graphs
![Page 14: 1 Oblivious Routing in Wireless networks Costas Busch Rensselaer Polytechnic Institute Joint work with: Malik Magdon-Ismail and Jing Xi](https://reader030.vdocuments.mx/reader030/viewer/2022032709/56649ed05503460f94bddbfb/html5/thumbnails/14.jpg)
14
)( nEach path has length
n paths
Length 1
Source of packetsn
Destinationof all packets
Example graph:
nodesn
![Page 15: 1 Oblivious Routing in Wireless networks Costas Busch Rensselaer Polytechnic Institute Joint work with: Malik Magdon-Ismail and Jing Xi](https://reader030.vdocuments.mx/reader030/viewer/2022032709/56649ed05503460f94bddbfb/html5/thumbnails/15.jpg)
15
n packets in one path
Stretch =
Edge congestion =
1
n
![Page 16: 1 Oblivious Routing in Wireless networks Costas Busch Rensselaer Polytechnic Institute Joint work with: Malik Magdon-Ismail and Jing Xi](https://reader030.vdocuments.mx/reader030/viewer/2022032709/56649ed05503460f94bddbfb/html5/thumbnails/16.jpg)
16
1 packet per path
n
1
Stretch =
Edge congestion =
![Page 17: 1 Oblivious Routing in Wireless networks Costas Busch Rensselaer Polytechnic Institute Joint work with: Malik Magdon-Ismail and Jing Xi](https://reader030.vdocuments.mx/reader030/viewer/2022032709/56649ed05503460f94bddbfb/html5/thumbnails/17.jpg)
17
Contribution
Oblivious algorithm for special graphsembedded in the 2-dimensional plane
Constant stretch
Small congestion
)log( * nCOC nodenode
)log( * nCOC edgeedge
degree
Busch, Magdon-Ismail, Xi [SPAA 2005]:
)1(Ostretch
![Page 18: 1 Oblivious Routing in Wireless networks Costas Busch Rensselaer Polytechnic Institute Joint work with: Malik Magdon-Ismail and Jing Xi](https://reader030.vdocuments.mx/reader030/viewer/2022032709/56649ed05503460f94bddbfb/html5/thumbnails/18.jpg)
18
Basic Idea
source destination
![Page 19: 1 Oblivious Routing in Wireless networks Costas Busch Rensselaer Polytechnic Institute Joint work with: Malik Magdon-Ismail and Jing Xi](https://reader030.vdocuments.mx/reader030/viewer/2022032709/56649ed05503460f94bddbfb/html5/thumbnails/19.jpg)
19
Pick a random intermediate node
![Page 20: 1 Oblivious Routing in Wireless networks Costas Busch Rensselaer Polytechnic Institute Joint work with: Malik Magdon-Ismail and Jing Xi](https://reader030.vdocuments.mx/reader030/viewer/2022032709/56649ed05503460f94bddbfb/html5/thumbnails/20.jpg)
20
Construct path through intermediate node
![Page 21: 1 Oblivious Routing in Wireless networks Costas Busch Rensselaer Polytechnic Institute Joint work with: Malik Magdon-Ismail and Jing Xi](https://reader030.vdocuments.mx/reader030/viewer/2022032709/56649ed05503460f94bddbfb/html5/thumbnails/21.jpg)
21
Outline of Presentation
Introduction
Network Model
Oblivious Algorithm
Analysis
![Page 22: 1 Oblivious Routing in Wireless networks Costas Busch Rensselaer Polytechnic Institute Joint work with: Malik Magdon-Ismail and Jing Xi](https://reader030.vdocuments.mx/reader030/viewer/2022032709/56649ed05503460f94bddbfb/html5/thumbnails/22.jpg)
22
Network G Surrounding area
A
![Page 23: 1 Oblivious Routing in Wireless networks Costas Busch Rensselaer Polytechnic Institute Joint work with: Malik Magdon-Ismail and Jing Xi](https://reader030.vdocuments.mx/reader030/viewer/2022032709/56649ed05503460f94bddbfb/html5/thumbnails/23.jpg)
23
spacepoint space
point
Perpendicular bisector
geodesic
xy
yx ,
yx ,
A
![Page 24: 1 Oblivious Routing in Wireless networks Costas Busch Rensselaer Polytechnic Institute Joint work with: Malik Magdon-Ismail and Jing Xi](https://reader030.vdocuments.mx/reader030/viewer/2022032709/56649ed05503460f94bddbfb/html5/thumbnails/24.jpg)
24
spacepoint space
point
yx ,
s
xy
yxs
yx,
),(
A
![Page 25: 1 Oblivious Routing in Wireless networks Costas Busch Rensselaer Polytechnic Institute Joint work with: Malik Magdon-Ismail and Jing Xi](https://reader030.vdocuments.mx/reader030/viewer/2022032709/56649ed05503460f94bddbfb/html5/thumbnails/25.jpg)
25
Area wideness: ),(min,
yxAyx
A
![Page 26: 1 Oblivious Routing in Wireless networks Costas Busch Rensselaer Polytechnic Institute Joint work with: Malik Magdon-Ismail and Jing Xi](https://reader030.vdocuments.mx/reader030/viewer/2022032709/56649ed05503460f94bddbfb/html5/thumbnails/26.jpg)
26
x
Rspace pointgraph node
Coverage Radius :Rmaximum distance from a space point to the closest node
A
![Page 27: 1 Oblivious Routing in Wireless networks Costas Busch Rensselaer Polytechnic Institute Joint work with: Malik Magdon-Ismail and Jing Xi](https://reader030.vdocuments.mx/reader030/viewer/2022032709/56649ed05503460f94bddbfb/html5/thumbnails/27.jpg)
27
Auv
vuvudistG
,),(
there exist :,
6.158
,),(
vuvudistG
For all pair of nodes
vu,
),( vudistGShortest path length:
Euclidian distance:
![Page 28: 1 Oblivious Routing in Wireless networks Costas Busch Rensselaer Polytechnic Institute Joint work with: Malik Magdon-Ismail and Jing Xi](https://reader030.vdocuments.mx/reader030/viewer/2022032709/56649ed05503460f94bddbfb/html5/thumbnails/28.jpg)
28
Consequences of
u v
(max transmission radius in wireless networks)
edge
1
, vuMax Euclidian distancebetween adjacent nodes
vuvudistG
,),(
![Page 29: 1 Oblivious Routing in Wireless networks Costas Busch Rensselaer Polytechnic Institute Joint work with: Malik Magdon-Ismail and Jing Xi](https://reader030.vdocuments.mx/reader030/viewer/2022032709/56649ed05503460f94bddbfb/html5/thumbnails/29.jpg)
29
Consequences of vuvudistG
,),(
1
, vu
u vr
2)( rO nodes
Min Euclidian Distancebetween any pair of
nodes:
![Page 30: 1 Oblivious Routing in Wireless networks Costas Busch Rensselaer Polytechnic Institute Joint work with: Malik Magdon-Ismail and Jing Xi](https://reader030.vdocuments.mx/reader030/viewer/2022032709/56649ed05503460f94bddbfb/html5/thumbnails/30.jpg)
30
Outline of Presentation
Introduction
Network Model
Oblivious Algorithm
Analysis
![Page 31: 1 Oblivious Routing in Wireless networks Costas Busch Rensselaer Polytechnic Institute Joint work with: Malik Magdon-Ismail and Jing Xi](https://reader030.vdocuments.mx/reader030/viewer/2022032709/56649ed05503460f94bddbfb/html5/thumbnails/31.jpg)
31
Auv
z w
Every pair of nodes is assigned a default path
default path
default path
Examples: •Shortest paths
![Page 32: 1 Oblivious Routing in Wireless networks Costas Busch Rensselaer Polytechnic Institute Joint work with: Malik Magdon-Ismail and Jing Xi](https://reader030.vdocuments.mx/reader030/viewer/2022032709/56649ed05503460f94bddbfb/html5/thumbnails/32.jpg)
32
As
t
The algorithm
sourcedestination
![Page 33: 1 Oblivious Routing in Wireless networks Costas Busch Rensselaer Polytechnic Institute Joint work with: Malik Magdon-Ismail and Jing Xi](https://reader030.vdocuments.mx/reader030/viewer/2022032709/56649ed05503460f94bddbfb/html5/thumbnails/33.jpg)
33
As
tgeodesic
Perpendicular bisector
![Page 34: 1 Oblivious Routing in Wireless networks Costas Busch Rensselaer Polytechnic Institute Joint work with: Malik Magdon-Ismail and Jing Xi](https://reader030.vdocuments.mx/reader030/viewer/2022032709/56649ed05503460f94bddbfb/html5/thumbnails/34.jpg)
34
As
t
y
Pick random space pointy
![Page 35: 1 Oblivious Routing in Wireless networks Costas Busch Rensselaer Polytechnic Institute Joint work with: Malik Magdon-Ismail and Jing Xi](https://reader030.vdocuments.mx/reader030/viewer/2022032709/56649ed05503460f94bddbfb/html5/thumbnails/35.jpg)
35
As
t
R
Find closest node to pointy
wy
![Page 36: 1 Oblivious Routing in Wireless networks Costas Busch Rensselaer Polytechnic Institute Joint work with: Malik Magdon-Ismail and Jing Xi](https://reader030.vdocuments.mx/reader030/viewer/2022032709/56649ed05503460f94bddbfb/html5/thumbnails/36.jpg)
36
As
t
wdefault path
default path
Connect intermediate node to source and destination
w
![Page 37: 1 Oblivious Routing in Wireless networks Costas Busch Rensselaer Polytechnic Institute Joint work with: Malik Magdon-Ismail and Jing Xi](https://reader030.vdocuments.mx/reader030/viewer/2022032709/56649ed05503460f94bddbfb/html5/thumbnails/37.jpg)
37
Outline of Presentation
Introduction
Network Model
Oblivious Algorithm
Analysis
![Page 38: 1 Oblivious Routing in Wireless networks Costas Busch Rensselaer Polytechnic Institute Joint work with: Malik Magdon-Ismail and Jing Xi](https://reader030.vdocuments.mx/reader030/viewer/2022032709/56649ed05503460f94bddbfb/html5/thumbnails/38.jpg)
38
Consider an arbitrary set of packets:
N ,,1
NppP ,,1
Suppose the oblivious algorithm gives paths:
![Page 39: 1 Oblivious Routing in Wireless networks Costas Busch Rensselaer Polytechnic Institute Joint work with: Malik Magdon-Ismail and Jing Xi](https://reader030.vdocuments.mx/reader030/viewer/2022032709/56649ed05503460f94bddbfb/html5/thumbnails/39.jpg)
39
We will show:
1Ostretch
nCOC nodenode log*
optimal congestion
![Page 40: 1 Oblivious Routing in Wireless networks Costas Busch Rensselaer Polytechnic Institute Joint work with: Malik Magdon-Ismail and Jing Xi](https://reader030.vdocuments.mx/reader030/viewer/2022032709/56649ed05503460f94bddbfb/html5/thumbnails/40.jpg)
40
Theorem: 1Ostretch
Proof: Consider an arbitrary pathand show that:
Pp
1)( Opstretch
![Page 41: 1 Oblivious Routing in Wireless networks Costas Busch Rensselaer Polytechnic Institute Joint work with: Malik Magdon-Ismail and Jing Xi](https://reader030.vdocuments.mx/reader030/viewer/2022032709/56649ed05503460f94bddbfb/html5/thumbnails/41.jpg)
41
sA
tdefaultpath default
pathw
y1q
2qp
),()()(
),()(
)( 21
tsdistqlengthqlength
tsdistplength
pstretchGG
shortest path
![Page 42: 1 Oblivious Routing in Wireless networks Costas Busch Rensselaer Polytechnic Institute Joint work with: Malik Magdon-Ismail and Jing Xi](https://reader030.vdocuments.mx/reader030/viewer/2022032709/56649ed05503460f94bddbfb/html5/thumbnails/42.jpg)
42
),()()(
)( 21
tsdistqlengthqlength
pstretchG
),(),(),(
)(tsdist
twdistwsdistpstretch
G
GG
we show this is constant
when default paths are shortest paths
![Page 43: 1 Oblivious Routing in Wireless networks Costas Busch Rensselaer Polytechnic Institute Joint work with: Malik Magdon-Ismail and Jing Xi](https://reader030.vdocuments.mx/reader030/viewer/2022032709/56649ed05503460f94bddbfb/html5/thumbnails/43.jpg)
43
RtsRyswswsdistG ,,,),(
sA
t
w
yDefault path (shortest)
wswsdistG
,),(R
RtstwdistG ,),( Similarly:
![Page 44: 1 Oblivious Routing in Wireless networks Costas Busch Rensselaer Polytechnic Institute Joint work with: Malik Magdon-Ismail and Jing Xi](https://reader030.vdocuments.mx/reader030/viewer/2022032709/56649ed05503460f94bddbfb/html5/thumbnails/44.jpg)
44
tstsdistG ,),(
sA
tshortest path
tstsdistG
,),(
![Page 45: 1 Oblivious Routing in Wireless networks Costas Busch Rensselaer Polytechnic Institute Joint work with: Malik Magdon-Ismail and Jing Xi](https://reader030.vdocuments.mx/reader030/viewer/2022032709/56649ed05503460f94bddbfb/html5/thumbnails/45.jpg)
45
ts
Rtstsdist
twdistwsdistpstretch
G
GG
,,2
),(),(),(
)(
For constants:R,,
1)( Opstretch
End of Proof
![Page 46: 1 Oblivious Routing in Wireless networks Costas Busch Rensselaer Polytechnic Institute Joint work with: Malik Magdon-Ismail and Jing Xi](https://reader030.vdocuments.mx/reader030/viewer/2022032709/56649ed05503460f94bddbfb/html5/thumbnails/46.jpg)
46
Theorem:
nCOC log*
nodeC *nodeCdenotes