compact routing schemes with improved stretch
DESCRIPTION
Compact routing schemes with improved stretch. Shiri Chechik Doctoral Dissertation Award for Principles Of Distributed Computing (PODC) 2013. Compact routing schemes with improved stretch. This paper is an improvement on the work of TZ. Where?. Intuition. T. S. Close enough. Intuition. - PowerPoint PPT PresentationTRANSCRIPT
![Page 1: Compact routing schemes with improved stretch](https://reader035.vdocuments.site/reader035/viewer/2022070419/56815b2c550346895dc8f367/html5/thumbnails/1.jpg)
1
Compact routing schemes with improved stretch
Shiri Chechik
Doctoral Dissertation Award forPrinciples Of Distributed Computing (PODC) 2013
![Page 2: Compact routing schemes with improved stretch](https://reader035.vdocuments.site/reader035/viewer/2022070419/56815b2c550346895dc8f367/html5/thumbnails/2.jpg)
2
Compact routing schemes with improved stretch
This paper is an improvement on the work of TZ.Where?
![Page 3: Compact routing schemes with improved stretch](https://reader035.vdocuments.site/reader035/viewer/2022070419/56815b2c550346895dc8f367/html5/thumbnails/3.jpg)
3
Intuition
S T
Close enough
![Page 4: Compact routing schemes with improved stretch](https://reader035.vdocuments.site/reader035/viewer/2022070419/56815b2c550346895dc8f367/html5/thumbnails/4.jpg)
4
Intuition
S
T
Far enough
![Page 5: Compact routing schemes with improved stretch](https://reader035.vdocuments.site/reader035/viewer/2022070419/56815b2c550346895dc8f367/html5/thumbnails/5.jpg)
5
Intuition
S
T
Questionable
![Page 6: Compact routing schemes with improved stretch](https://reader035.vdocuments.site/reader035/viewer/2022070419/56815b2c550346895dc8f367/html5/thumbnails/6.jpg)
6
TZ compact routing
• Every node holds a routing table with information
• Stretch on routing is
![Page 7: Compact routing schemes with improved stretch](https://reader035.vdocuments.site/reader035/viewer/2022070419/56815b2c550346895dc8f367/html5/thumbnails/7.jpg)
7
TZ compact routing
• Every node holds a routing table with information
• Stretch on routing is
We will talk about the case where
:
:
![Page 8: Compact routing schemes with improved stretch](https://reader035.vdocuments.site/reader035/viewer/2022070419/56815b2c550346895dc8f367/html5/thumbnails/8.jpg)
8
h𝑠𝑡𝑟𝑒𝑡𝑐 =h𝑙𝑒𝑛𝑔𝑡 ¿ (𝑠 ,𝑡)
𝑑 (𝑠 , 𝑡)
![Page 9: Compact routing schemes with improved stretch](https://reader035.vdocuments.site/reader035/viewer/2022070419/56815b2c550346895dc8f367/html5/thumbnails/9.jpg)
9
Model – definitions
• Graph .• Each node is a processor.
• Each node is assigned with a unique key .
![Page 10: Compact routing schemes with improved stretch](https://reader035.vdocuments.site/reader035/viewer/2022070419/56815b2c550346895dc8f367/html5/thumbnails/10.jpg)
10
Something we’ll need later on…
![Page 11: Compact routing schemes with improved stretch](https://reader035.vdocuments.site/reader035/viewer/2022070419/56815b2c550346895dc8f367/html5/thumbnails/11.jpg)
11
Search Mechanism
Problem:Given a graph with arbitrary node Ids, how can we quickly route to any given node when given its Id?
Solution:Use a shortest path spanning tree to route to any node at cost of
![Page 12: Compact routing schemes with improved stretch](https://reader035.vdocuments.site/reader035/viewer/2022070419/56815b2c550346895dc8f367/html5/thumbnails/12.jpg)
12
Search Mechanism
Problem:Where do we store the routing information? (the tree is not sorted, for even has sequential Ids…)
Solution:Distribute the routing information among a selected subset of nodes (the nodes…)
![Page 13: Compact routing schemes with improved stretch](https://reader035.vdocuments.site/reader035/viewer/2022070419/56815b2c550346895dc8f367/html5/thumbnails/13.jpg)
13
Search scheme
How can we build a search mechanism on a tree without keeping too much information in any
given node?
![Page 14: Compact routing schemes with improved stretch](https://reader035.vdocuments.site/reader035/viewer/2022070419/56815b2c550346895dc8f367/html5/thumbnails/14.jpg)
14
Search scheme (query)
For some node , does belong to T?If so, how can we route to it?
![Page 15: Compact routing schemes with improved stretch](https://reader035.vdocuments.site/reader035/viewer/2022070419/56815b2c550346895dc8f367/html5/thumbnails/15.jpg)
15
Search scheme (definitions)
Given tree where:1. 2. is the depth of the tree 3.
![Page 16: Compact routing schemes with improved stretch](https://reader035.vdocuments.site/reader035/viewer/2022070419/56815b2c550346895dc8f367/html5/thumbnails/16.jpg)
16
Search scheme (definitions)
is a set of nodes chosen to store the information s.t.
Each node will store information for nodes
![Page 17: Compact routing schemes with improved stretch](https://reader035.vdocuments.site/reader035/viewer/2022070419/56815b2c550346895dc8f367/html5/thumbnails/17.jpg)
17
Search scheme (requirements)
1. In every node the scheme stores information.
2. Given a key the algorithm can find or determine that . This is to be done on a path from no longer than .
![Page 18: Compact routing schemes with improved stretch](https://reader035.vdocuments.site/reader035/viewer/2022070419/56815b2c550346895dc8f367/html5/thumbnails/18.jpg)
18
Search scheme (construction)
is the set of nodes in where has ordered them in a certain way.
The interval is divided into intervals s.t.
Each interval is assigned to the proper node.
![Page 19: Compact routing schemes with improved stretch](https://reader035.vdocuments.site/reader035/viewer/2022070419/56815b2c550346895dc8f367/html5/thumbnails/19.jpg)
19
Search scheme (construction)
![Page 20: Compact routing schemes with improved stretch](https://reader035.vdocuments.site/reader035/viewer/2022070419/56815b2c550346895dc8f367/html5/thumbnails/20.jpg)
20
Search scheme (construction)
![Page 21: Compact routing schemes with improved stretch](https://reader035.vdocuments.site/reader035/viewer/2022070419/56815b2c550346895dc8f367/html5/thumbnails/21.jpg)
21
Search scheme (construction)
![Page 22: Compact routing schemes with improved stretch](https://reader035.vdocuments.site/reader035/viewer/2022070419/56815b2c550346895dc8f367/html5/thumbnails/22.jpg)
22
Search scheme (construction)
![Page 23: Compact routing schemes with improved stretch](https://reader035.vdocuments.site/reader035/viewer/2022070419/56815b2c550346895dc8f367/html5/thumbnails/23.jpg)
23
Search scheme (routing)
Step 1: Route the query to .Step 2: Find the interval and node associated with it.Step 3: Route the message to via T.Step 4: node determines if or not.
![Page 24: Compact routing schemes with improved stretch](https://reader035.vdocuments.site/reader035/viewer/2022070419/56815b2c550346895dc8f367/html5/thumbnails/24.jpg)
24
Search scheme (proof)
1. Each holds information for nodes. The information itself (taken from TZ) for each node is of size . So holds information.
2. The distance the query has to travels is exactly . Since ,
![Page 25: Compact routing schemes with improved stretch](https://reader035.vdocuments.site/reader035/viewer/2022070419/56815b2c550346895dc8f367/html5/thumbnails/25.jpg)
25
We now move to construction
![Page 26: Compact routing schemes with improved stretch](https://reader035.vdocuments.site/reader035/viewer/2022070419/56815b2c550346895dc8f367/html5/thumbnails/26.jpg)
26
Construction - definitions
We start off with constructing the Thorup-Zwick routing tables and labels. ( and )
The routing tables and labels we use are based on those of TZ, but with some additions.
![Page 27: Compact routing schemes with improved stretch](https://reader035.vdocuments.site/reader035/viewer/2022070419/56815b2c550346895dc8f367/html5/thumbnails/27.jpg)
v
’s, clusters & bunches
![Page 28: Compact routing schemes with improved stretch](https://reader035.vdocuments.site/reader035/viewer/2022070419/56815b2c550346895dc8f367/html5/thumbnails/28.jpg)
v
w
𝐵𝐴 (𝑣 )={𝑤∈𝑉∨𝑑 (𝑣 ,𝑤 )<𝑑 (𝐴 ,𝑣)}
’s, clusters & bunches
![Page 29: Compact routing schemes with improved stretch](https://reader035.vdocuments.site/reader035/viewer/2022070419/56815b2c550346895dc8f367/html5/thumbnails/29.jpg)
v
cluster
w
’s, clusters & bunches
𝐶𝐴 (𝑤 )={𝑣∈𝑉∨𝑑 (𝑤 ,𝑣 )<𝑑 (𝐴 ,𝑣)}
![Page 30: Compact routing schemes with improved stretch](https://reader035.vdocuments.site/reader035/viewer/2022070419/56815b2c550346895dc8f367/html5/thumbnails/30.jpg)
30
Construction – definitions
Reminder:
Definition: is the distance between and the closest node . (the pivot of )
![Page 31: Compact routing schemes with improved stretch](https://reader035.vdocuments.site/reader035/viewer/2022070419/56815b2c550346895dc8f367/html5/thumbnails/31.jpg)
31
Construction – definitions
(The label of ) is a concatenation of:
Notice that because we know , the label is
![Page 32: Compact routing schemes with improved stretch](https://reader035.vdocuments.site/reader035/viewer/2022070419/56815b2c550346895dc8f367/html5/thumbnails/32.jpg)
32
Construction – definitions
: A node in G.: The cluster of .
: The shortest path spanning tree of
: , trimmed at a distance of from the root.
![Page 33: Compact routing schemes with improved stretch](https://reader035.vdocuments.site/reader035/viewer/2022070419/56815b2c550346895dc8f367/html5/thumbnails/33.jpg)
33
Construction – search mechanism
For every node and for every we calculate (denoted: ) and do:We sample every node independently with probability of .These chosen nodes are then part of .
![Page 34: Compact routing schemes with improved stretch](https://reader035.vdocuments.site/reader035/viewer/2022070419/56815b2c550346895dc8f367/html5/thumbnails/34.jpg)
34
Construction – search mechanism
We then construct the search mechanism we defined earlier for each node . The information is stored in .Every node holds the routing information to
This is the additional information to we mentioned earlier.
![Page 35: Compact routing schemes with improved stretch](https://reader035.vdocuments.site/reader035/viewer/2022070419/56815b2c550346895dc8f367/html5/thumbnails/35.jpg)
35
Construction – analysis
Lemma 4.2:a. For every node :
b. For every node there at most nodes s.t.
![Page 36: Compact routing schemes with improved stretch](https://reader035.vdocuments.site/reader035/viewer/2022070419/56815b2c550346895dc8f367/html5/thumbnails/36.jpg)
36
Lemma 4.2 – proof
Reminder – Chernoff’s bound:
For a binomial random variable X, where , then
![Page 37: Compact routing schemes with improved stretch](https://reader035.vdocuments.site/reader035/viewer/2022070419/56815b2c550346895dc8f367/html5/thumbnails/37.jpg)
37
Lemma 4.2 – proof
:
The expected size of is . Since , we can say that: .
So with high probability, claim a holds.
![Page 38: Compact routing schemes with improved stretch](https://reader035.vdocuments.site/reader035/viewer/2022070419/56815b2c550346895dc8f367/html5/thumbnails/38.jpg)
38
Lemma 4.2 – proof
At most
• We know from TZ that node belongs to clusters.• .
So the expected number of nodes s.t. is .
![Page 39: Compact routing schemes with improved stretch](https://reader035.vdocuments.site/reader035/viewer/2022070419/56815b2c550346895dc8f367/html5/thumbnails/39.jpg)
39
Lemma 4.2 – proof
At most
By Chernoff’s law we get that with high probability there at most nodes s.t.
![Page 40: Compact routing schemes with improved stretch](https://reader035.vdocuments.site/reader035/viewer/2022070419/56815b2c550346895dc8f367/html5/thumbnails/40.jpg)
40
Construction
Lemma 4.3: the expected size of is
Proof:Our routing table is constructed from and our additions. From TZ, we know the size of is .
![Page 41: Compact routing schemes with improved stretch](https://reader035.vdocuments.site/reader035/viewer/2022070419/56815b2c550346895dc8f367/html5/thumbnails/41.jpg)
41
Lemma 4.3 – proof
Lemma 4.3:
Our addition stores information (requirement of the search scheme) in every node in any for any .
From Lemma 4.2 we know that belongs at most to .
![Page 42: Compact routing schemes with improved stretch](https://reader035.vdocuments.site/reader035/viewer/2022070419/56815b2c550346895dc8f367/html5/thumbnails/42.jpg)
42
We now move to routing
![Page 43: Compact routing schemes with improved stretch](https://reader035.vdocuments.site/reader035/viewer/2022070419/56815b2c550346895dc8f367/html5/thumbnails/43.jpg)
43
Routing – definitions
Reminder:
Definition: is the distance between and the closest node . (the pivot of )
![Page 44: Compact routing schemes with improved stretch](https://reader035.vdocuments.site/reader035/viewer/2022070419/56815b2c550346895dc8f367/html5/thumbnails/44.jpg)
44
Routing – definitions
Definition:
v 𝐴1
𝐴2
𝐴3
𝑑(𝑣 , 𝐴 1)
𝑑(𝑣 , 𝐴2 )
𝑑(𝑣 ,𝐴 3
)
![Page 45: Compact routing schemes with improved stretch](https://reader035.vdocuments.site/reader035/viewer/2022070419/56815b2c550346895dc8f367/html5/thumbnails/45.jpg)
45
Routing – definitions
𝑣 𝑎1∈ 𝐴1 𝑎2∈ 𝐴2 𝑎3∈𝐴3
Δ0(𝑣)Δ1(𝑣 )
Δ2(𝑣)
𝑑(𝑣 , 𝐴1)𝑑(𝑣 , 𝐴2) 𝑑(𝑣 , 𝐴3)
![Page 46: Compact routing schemes with improved stretch](https://reader035.vdocuments.site/reader035/viewer/2022070419/56815b2c550346895dc8f367/html5/thumbnails/46.jpg)
46
Routing – definitions
Let be the minimal index s.t. . If or , then .
Remember,
![Page 47: Compact routing schemes with improved stretch](https://reader035.vdocuments.site/reader035/viewer/2022070419/56815b2c550346895dc8f367/html5/thumbnails/47.jpg)
47
Routing – definitions
How can we calculate this? How does know or ?
![Page 48: Compact routing schemes with improved stretch](https://reader035.vdocuments.site/reader035/viewer/2022070419/56815b2c550346895dc8f367/html5/thumbnails/48.jpg)
48
Routing – definitions
Reminder:When we route to , we have made of
Lemma 4.4: If then
![Page 49: Compact routing schemes with improved stretch](https://reader035.vdocuments.site/reader035/viewer/2022070419/56815b2c550346895dc8f367/html5/thumbnails/49.jpg)
49
Routing – algorithm
Node wants to send a message to node .
1. If and route the message to on (from TZ).2. If route the message on .3. If route the message on .
![Page 50: Compact routing schemes with improved stretch](https://reader035.vdocuments.site/reader035/viewer/2022070419/56815b2c550346895dc8f367/html5/thumbnails/50.jpg)
50
Routing – algorithm
4. If invoke TZ. ()5. Else, Define for the smallest s.t. .
Check if . This is done by routing the message to on and searching for in .
1. If it exists – route to it and quit.2. Otherwise, return the message to and run TZ.
![Page 51: Compact routing schemes with improved stretch](https://reader035.vdocuments.site/reader035/viewer/2022070419/56815b2c550346895dc8f367/html5/thumbnails/51.jpg)
51
Routing – analysis
We know from TZ:
and so and we can route directly from to .
The claim works the same for
![Page 52: Compact routing schemes with improved stretch](https://reader035.vdocuments.site/reader035/viewer/2022070419/56815b2c550346895dc8f367/html5/thumbnails/52.jpg)
52
Routing – analysis
So we assume this is not the case. Namely, . Reminder: is the minimal index s.t.
.
In other words, and (We now have a lower bound on )
![Page 53: Compact routing schemes with improved stretch](https://reader035.vdocuments.site/reader035/viewer/2022070419/56815b2c550346895dc8f367/html5/thumbnails/53.jpg)
53
Routing – analysis
From the analysis of TZ, the worst stretch () is achieved when and are roughly () and .
Lemma 4.5: The stretch of the routing process is at most
![Page 54: Compact routing schemes with improved stretch](https://reader035.vdocuments.site/reader035/viewer/2022070419/56815b2c550346895dc8f367/html5/thumbnails/54.jpg)
54
Lemma 4.5 – proof
The algorithm has the following cases:1. and .2. .
![Page 55: Compact routing schemes with improved stretch](https://reader035.vdocuments.site/reader035/viewer/2022070419/56815b2c550346895dc8f367/html5/thumbnails/55.jpg)
55
Lemma 4.5 – proof
We look at the first 3 cases:1. and .2. .
In one of these cases, by the analysis of TZ, the stretch is at most 7 (instead of 11 in TZ).
![Page 56: Compact routing schemes with improved stretch](https://reader035.vdocuments.site/reader035/viewer/2022070419/56815b2c550346895dc8f367/html5/thumbnails/56.jpg)
56
Lemma 4.5 – proof
We look at the first 3 cases:1. and .2. .
In one of these cases, by the analysis of TZ, the stretch is at most 7 (instead of 11 in TZ).
So we assume it is not one of these cases.
![Page 57: Compact routing schemes with improved stretch](https://reader035.vdocuments.site/reader035/viewer/2022070419/56815b2c550346895dc8f367/html5/thumbnails/57.jpg)
57
Lemma 4.5 – proof
Case 4: In this case the message is routed on so the length of the path is
.
We know that:
![Page 58: Compact routing schemes with improved stretch](https://reader035.vdocuments.site/reader035/viewer/2022070419/56815b2c550346895dc8f367/html5/thumbnails/58.jpg)
58
Lemma 4.5 – proof
And so:
We also know that:
![Page 59: Compact routing schemes with improved stretch](https://reader035.vdocuments.site/reader035/viewer/2022070419/56815b2c550346895dc8f367/html5/thumbnails/59.jpg)
59
Lemma 4.5 – proof
Stretch for case 4
![Page 60: Compact routing schemes with improved stretch](https://reader035.vdocuments.site/reader035/viewer/2022070419/56815b2c550346895dc8f367/html5/thumbnails/60.jpg)
60
Lemma 4.5 – proof
Case 5: In this case the message is routed to on and then is searched in the tree on a path of at most .The length so far is . Since and ,.
![Page 61: Compact routing schemes with improved stretch](https://reader035.vdocuments.site/reader035/viewer/2022070419/56815b2c550346895dc8f367/html5/thumbnails/61.jpg)
61
Lemma 4.5 – proof
Case 5.1: The message will be routed to on with an additional length of .The total length of the route will be
![Page 62: Compact routing schemes with improved stretch](https://reader035.vdocuments.site/reader035/viewer/2022070419/56815b2c550346895dc8f367/html5/thumbnails/62.jpg)
62
Lemma 4.5 – proof
Stretch for case 5.1
![Page 63: Compact routing schemes with improved stretch](https://reader035.vdocuments.site/reader035/viewer/2022070419/56815b2c550346895dc8f367/html5/thumbnails/63.jpg)
63
Lemma 4.5 – proof
Case 5.2: The message will be routed back to and then using TZ with an additional length of .The total length of the route will be
![Page 64: Compact routing schemes with improved stretch](https://reader035.vdocuments.site/reader035/viewer/2022070419/56815b2c550346895dc8f367/html5/thumbnails/64.jpg)
64
Lemma 4.5 – proof
Case 5.2: The message will be routed back to and then using TZ with an additional length of .The total length of the route will be
Note that this case can only occur if .
![Page 65: Compact routing schemes with improved stretch](https://reader035.vdocuments.site/reader035/viewer/2022070419/56815b2c550346895dc8f367/html5/thumbnails/65.jpg)
65
Lemma 4.5 – proof
Stretch for case 5.2
![Page 66: Compact routing schemes with improved stretch](https://reader035.vdocuments.site/reader035/viewer/2022070419/56815b2c550346895dc8f367/html5/thumbnails/66.jpg)
66
Routing – conclusion
we found that the upper bound on the stretch is
By choosing we minimize the stretch down to
![Page 67: Compact routing schemes with improved stretch](https://reader035.vdocuments.site/reader035/viewer/2022070419/56815b2c550346895dc8f367/html5/thumbnails/67.jpg)
67
The case for
The algorithm is very similar.
Changes are mainly in the condition for steps 4 & 5 and a more complicated search mechanism.
![Page 68: Compact routing schemes with improved stretch](https://reader035.vdocuments.site/reader035/viewer/2022070419/56815b2c550346895dc8f367/html5/thumbnails/68.jpg)
68
Thank you