1 Analysis of Link Reversal Routing Algorithms Srikanta Tirthapura (Iowa State University) and...
-
Upload
donna-green -
Category
Documents
-
view
216 -
download
0
Transcript of 1 Analysis of Link Reversal Routing Algorithms Srikanta Tirthapura (Iowa State University) and...
![Page 1: 1 Analysis of Link Reversal Routing Algorithms Srikanta Tirthapura (Iowa State University) and Costas Busch (Renssaeler Polytechnic Institute)](https://reader030.fdocuments.net/reader030/viewer/2022032522/56649d6e5503460f94a4f119/html5/thumbnails/1.jpg)
1
Analysis of Link Reversal Routing Algorithms
Srikanta Tirthapura (Iowa State University)
andCostas Busch
(Renssaeler Polytechnic Institute)
![Page 2: 1 Analysis of Link Reversal Routing Algorithms Srikanta Tirthapura (Iowa State University) and Costas Busch (Renssaeler Polytechnic Institute)](https://reader030.fdocuments.net/reader030/viewer/2022032522/56649d6e5503460f94a4f119/html5/thumbnails/2.jpg)
2
Wireless Ad Hoc and Sensor Networks
Nodes mightmove
Nodes mightgo to sleep
Node Failures
Underlying Communication Graph is Changing
![Page 3: 1 Analysis of Link Reversal Routing Algorithms Srikanta Tirthapura (Iowa State University) and Costas Busch (Renssaeler Polytechnic Institute)](https://reader030.fdocuments.net/reader030/viewer/2022032522/56649d6e5503460f94a4f119/html5/thumbnails/3.jpg)
3
Algorithms for Wireless Ad Hoc and Sensor Networks
• Algorithms should be simple and distributed
• Self-stabilizing (or self-healing) in the face of failures
![Page 4: 1 Analysis of Link Reversal Routing Algorithms Srikanta Tirthapura (Iowa State University) and Costas Busch (Renssaeler Polytechnic Institute)](https://reader030.fdocuments.net/reader030/viewer/2022032522/56649d6e5503460f94a4f119/html5/thumbnails/4.jpg)
4
Research Goal
• Design Algorithms for which we can – Prove convergence– Analyze performance– Predict behavior on large scale networks
• Complementary to evaluation through simulation and experiments
![Page 5: 1 Analysis of Link Reversal Routing Algorithms Srikanta Tirthapura (Iowa State University) and Costas Busch (Renssaeler Polytechnic Institute)](https://reader030.fdocuments.net/reader030/viewer/2022032522/56649d6e5503460f94a4f119/html5/thumbnails/5.jpg)
5
Link Reversal Algorithms
• Very simple• Been around for 20 years
• Gafni-Bertsekas– Full Reversal Algorithm– Partial Reversal Algorithm
• Our Contribution:First formal performance analysis of link reversal
![Page 6: 1 Analysis of Link Reversal Routing Algorithms Srikanta Tirthapura (Iowa State University) and Costas Busch (Renssaeler Polytechnic Institute)](https://reader030.fdocuments.net/reader030/viewer/2022032522/56649d6e5503460f94a4f119/html5/thumbnails/6.jpg)
6
• Link Reversal Routing
• Previous Work & Contributions
• Our Analysis• Basic Properties of Link Reversal• Full Reversal Algorithm• Partial Reversal Algorithm• Lower Bounds
•Conclusions
Talk Outline
![Page 7: 1 Analysis of Link Reversal Routing Algorithms Srikanta Tirthapura (Iowa State University) and Costas Busch (Renssaeler Polytechnic Institute)](https://reader030.fdocuments.net/reader030/viewer/2022032522/56649d6e5503460f94a4f119/html5/thumbnails/7.jpg)
7
Distributed Dynamic Graph Problem
• Communication Graph:– Vertices = Computers (perhaps mobile)– Edges = Wireless communication links
• Task: Maintain a distributed structure on this graph– Routing– Leader Election
• Issues:– Deal with node and link failures– Acyclicity
![Page 8: 1 Analysis of Link Reversal Routing Algorithms Srikanta Tirthapura (Iowa State University) and Costas Busch (Renssaeler Polytechnic Institute)](https://reader030.fdocuments.net/reader030/viewer/2022032522/56649d6e5503460f94a4f119/html5/thumbnails/8.jpg)
8
Connection graphof a wireless network
Destination oriented,directed acyclic graph
Destination
Aim of Link Reversal
![Page 9: 1 Analysis of Link Reversal Routing Algorithms Srikanta Tirthapura (Iowa State University) and Costas Busch (Renssaeler Polytechnic Institute)](https://reader030.fdocuments.net/reader030/viewer/2022032522/56649d6e5503460f94a4f119/html5/thumbnails/9.jpg)
9
Link Failure
node moves
![Page 10: 1 Analysis of Link Reversal Routing Algorithms Srikanta Tirthapura (Iowa State University) and Costas Busch (Renssaeler Polytechnic Institute)](https://reader030.fdocuments.net/reader030/viewer/2022032522/56649d6e5503460f94a4f119/html5/thumbnails/10.jpg)
10
Bad node: no path to destination
Good node: at least one path to destination
A bad state A good state
![Page 11: 1 Analysis of Link Reversal Routing Algorithms Srikanta Tirthapura (Iowa State University) and Costas Busch (Renssaeler Polytechnic Institute)](https://reader030.fdocuments.net/reader030/viewer/2022032522/56649d6e5503460f94a4f119/html5/thumbnails/11.jpg)
11
sink
Full Link Reversal Algorithm
sink
sinksink
sink
sinksink
Sinks reverse all their links#reversals = 7 time = 5
![Page 12: 1 Analysis of Link Reversal Routing Algorithms Srikanta Tirthapura (Iowa State University) and Costas Busch (Renssaeler Polytechnic Institute)](https://reader030.fdocuments.net/reader030/viewer/2022032522/56649d6e5503460f94a4f119/html5/thumbnails/12.jpg)
12
sink
Partial Link Reversal Algorithm
sink
sink
sink
sink
Sinks reverse some of their links#reversals = 5 time = 5
![Page 13: 1 Analysis of Link Reversal Routing Algorithms Srikanta Tirthapura (Iowa State University) and Costas Busch (Renssaeler Polytechnic Institute)](https://reader030.fdocuments.net/reader030/viewer/2022032522/56649d6e5503460f94a4f119/html5/thumbnails/13.jpg)
13
)3,4,5(
Heights and Acyclicity
),,,( 21 naaa
)7,9,4(
General height:
higher lower
Heights are ordered in lexicographic order
Observation: Directed Graph is always acyclic
![Page 14: 1 Analysis of Link Reversal Routing Algorithms Srikanta Tirthapura (Iowa State University) and Costas Busch (Renssaeler Polytechnic Institute)](https://reader030.fdocuments.net/reader030/viewer/2022032522/56649d6e5503460f94a4f119/html5/thumbnails/14.jpg)
14
)1,4()2,3(
)3,2(
)4,5()5,2(
)6,1(
)Dest,0(
Full Link Reversal Algorithm
),( iaiNode :i
Node IDReal height (breaks ties)
![Page 15: 1 Analysis of Link Reversal Routing Algorithms Srikanta Tirthapura (Iowa State University) and Costas Busch (Renssaeler Polytechnic Institute)](https://reader030.fdocuments.net/reader030/viewer/2022032522/56649d6e5503460f94a4f119/html5/thumbnails/15.jpg)
15
)Dest,0(
Full Link Reversal Algorithm
),( iai
Sink :i
)Dest,0(
before reversal after reversal),( iai
1)}(:max{ iNjaa ji
)1,4()2,3(
)3,2(
)4,5()5,2(
)6,1(
)1,4()2,3(
)3,2(
)4,5()5,2(
)6,3(sink
![Page 16: 1 Analysis of Link Reversal Routing Algorithms Srikanta Tirthapura (Iowa State University) and Costas Busch (Renssaeler Polytechnic Institute)](https://reader030.fdocuments.net/reader030/viewer/2022032522/56649d6e5503460f94a4f119/html5/thumbnails/16.jpg)
16
)Dest,0( )Dest,0( )Dest,0(
)Dest,0( )Dest,0(
Full Link Reversal Algorithm)1,4(
)2,3(
)3,2(
)4,5()5,2(
)6,1(
)1,4()2,3(
)3,2(
)4,5()5,2(
)6,3(
)1,4()2,3(
)3,4(
)4,5()5,6(
)6,3(
)1,4()2,7(
)3,4(
)4,5()5,6(
)6,7(
)1,8()2,7(
)3,8(
)4,5()5,6(
)6,7(
![Page 17: 1 Analysis of Link Reversal Routing Algorithms Srikanta Tirthapura (Iowa State University) and Costas Busch (Renssaeler Polytechnic Institute)](https://reader030.fdocuments.net/reader030/viewer/2022032522/56649d6e5503460f94a4f119/html5/thumbnails/17.jpg)
17
Partial Link Reversal Algorithm
),,( iba iiNode :i
Node IDRealheight (breaks ties)
)1,4,0()2,3,0(
)3,2,0(
)4,5,0()5,2,0(
)6,1,0(
)Dest,0,0(
memory
![Page 18: 1 Analysis of Link Reversal Routing Algorithms Srikanta Tirthapura (Iowa State University) and Costas Busch (Renssaeler Polytechnic Institute)](https://reader030.fdocuments.net/reader030/viewer/2022032522/56649d6e5503460f94a4f119/html5/thumbnails/18.jpg)
18
Partial Link Reversal Algorithm
),,( iba ii
Sink :i
before reversal after reversal
),,( iba ii
1)}(:min{ iNjaa ji
)1,4,0()2,3,0(
)3,2,0(
)4,5,0()5,2,0(
)6,1,0(
)Dest,0,0(
)1,4,0()2,3,0(
)3,2,0(
)4,5,0()5,2,0(
)6,1,1(
)Dest,0,0(
1}and)(:min{ jiji baiNjbb
sink
![Page 19: 1 Analysis of Link Reversal Routing Algorithms Srikanta Tirthapura (Iowa State University) and Costas Busch (Renssaeler Polytechnic Institute)](https://reader030.fdocuments.net/reader030/viewer/2022032522/56649d6e5503460f94a4f119/html5/thumbnails/19.jpg)
19
)1,4,0()2,3,0(
)3,2,0(
)4,5,0()5,2,0(
)6,1,0(
)Dest,0,0(
)1,4,0()2,3,0(
)3,2,0(
)4,5,0()5,2,0(
)6,1,1(
)Dest,0,0(
)1,4,0()2,3,0(
)3,0,1(
)4,5,0()5,0,1(
)6,1,1(
)Dest,0,0(
)1,4,0()2,1,1(
)3,0,1(
)4,5,0()5,0,1(
)6,1,1(
)Dest,0,0(
)1,2,1( )2,1,1( )3,0,1(
)4,5,0()5,0,1(
)6,1,1(
)Dest,0,0(
Partial Link Reversal Algorithm
![Page 20: 1 Analysis of Link Reversal Routing Algorithms Srikanta Tirthapura (Iowa State University) and Costas Busch (Renssaeler Polytechnic Institute)](https://reader030.fdocuments.net/reader030/viewer/2022032522/56649d6e5503460f94a4f119/html5/thumbnails/20.jpg)
20
Deterministic Link Reversal Algorithms
h1h
2h
3h
4h5h
h
Sink :i
before reversal after reversal
h1h
2h
3h
4h5h
),,,,( 21 khhhhgh
Deterministic function
![Page 21: 1 Analysis of Link Reversal Routing Algorithms Srikanta Tirthapura (Iowa State University) and Costas Busch (Renssaeler Polytechnic Institute)](https://reader030.fdocuments.net/reader030/viewer/2022032522/56649d6e5503460f94a4f119/html5/thumbnails/21.jpg)
21
Merits of Link Reversal
• Simple
• Distributed, Acyclic
• Self-stabilizes from a bad state to a good state
![Page 22: 1 Analysis of Link Reversal Routing Algorithms Srikanta Tirthapura (Iowa State University) and Costas Busch (Renssaeler Polytechnic Institute)](https://reader030.fdocuments.net/reader030/viewer/2022032522/56649d6e5503460f94a4f119/html5/thumbnails/22.jpg)
22
Talk Outline
• Link Reversal Routing
• Previous Work & Contributions
• Our Analysis• Basic Properties of Link Reversal• Full Reversal Algorithm• Partial Reversal Algorithm• Lower Bounds
•Conclusions
![Page 23: 1 Analysis of Link Reversal Routing Algorithms Srikanta Tirthapura (Iowa State University) and Costas Busch (Renssaeler Polytechnic Institute)](https://reader030.fdocuments.net/reader030/viewer/2022032522/56649d6e5503460f94a4f119/html5/thumbnails/23.jpg)
23
Previous Work
Gafni and Bertsekas: 1981
•Designed First Reversal Algorithms•Proof of stability (eventual convergence)
Park and Corson: INFOCOM 1997
•TORA – Temporally Ordered Routing Alg. - Variation of partial reversal
- Deals with partitions
Corson and Ephremides: Wireless Net. Jour. 1995
•LMR – Lightweight Mobile Routing Alg.
![Page 24: 1 Analysis of Link Reversal Routing Algorithms Srikanta Tirthapura (Iowa State University) and Costas Busch (Renssaeler Polytechnic Institute)](https://reader030.fdocuments.net/reader030/viewer/2022032522/56649d6e5503460f94a4f119/html5/thumbnails/24.jpg)
24
Previous WorkMalpani, Welch and Vaidya.: DIAL-M 2000
• Distributed Leader election based on TORA•(partial) proof of stability
Experimental work and surveys:
Broch et al.: MOBICOM 1998
Samir et al.: IC3N 1998
Perkins: “Ad Hoc Networking”,
Rajamaran: SIGACT news 2002
Intanagonwiwat, Govindan, Estrin: MOBICOM 00
• “Directed Diffusion” – Sensor network routing• Similar to the TORA algorithm
![Page 25: 1 Analysis of Link Reversal Routing Algorithms Srikanta Tirthapura (Iowa State University) and Costas Busch (Renssaeler Polytechnic Institute)](https://reader030.fdocuments.net/reader030/viewer/2022032522/56649d6e5503460f94a4f119/html5/thumbnails/25.jpg)
25
Our Contribution
First formal performance analysisof link reversal routing algorithmsin terms of #reversals and time
![Page 26: 1 Analysis of Link Reversal Routing Algorithms Srikanta Tirthapura (Iowa State University) and Costas Busch (Renssaeler Polytechnic Institute)](https://reader030.fdocuments.net/reader030/viewer/2022032522/56649d6e5503460f94a4f119/html5/thumbnails/26.jpg)
26
# reversals: total number of node reversalstill stabilization (work)
Time: number of parallel time steps till stabilization
Metrics
![Page 27: 1 Analysis of Link Reversal Routing Algorithms Srikanta Tirthapura (Iowa State University) and Costas Busch (Renssaeler Polytechnic Institute)](https://reader030.fdocuments.net/reader030/viewer/2022032522/56649d6e5503460f94a4f119/html5/thumbnails/27.jpg)
27
The Good News
• The work and time taken depend only on the number of nodes which have lost their paths to destination
• Algorithm is Local
![Page 28: 1 Analysis of Link Reversal Routing Algorithms Srikanta Tirthapura (Iowa State University) and Costas Busch (Renssaeler Polytechnic Institute)](https://reader030.fdocuments.net/reader030/viewer/2022032522/56649d6e5503460f94a4f119/html5/thumbnails/28.jpg)
28
Further News
Full reversal algorithm:
#reversals and time: )( 2nO
n “bad” nodes
There are worst-cases with: )( 2n
Partial reversal algorithm:)( 2nanO
#reversals and time: There are worst-cases with: )( 2nan
a depends on the network state
![Page 29: 1 Analysis of Link Reversal Routing Algorithms Srikanta Tirthapura (Iowa State University) and Costas Busch (Renssaeler Polytechnic Institute)](https://reader030.fdocuments.net/reader030/viewer/2022032522/56649d6e5503460f94a4f119/html5/thumbnails/29.jpg)
29
More News – Lower Bound
Any deterministic algorithm:
#reversals and time:
n bad nodes
)( 2nThere are states such that
Full reversal alg. is worst-case optimal
Partial reversal alg. is not
)( 2nO
)( 2nan
![Page 30: 1 Analysis of Link Reversal Routing Algorithms Srikanta Tirthapura (Iowa State University) and Costas Busch (Renssaeler Polytechnic Institute)](https://reader030.fdocuments.net/reader030/viewer/2022032522/56649d6e5503460f94a4f119/html5/thumbnails/30.jpg)
30
Talk Outline
• Link Reversal Routing
• Previous Work & Contributions
• Our Analysis• Basic Properties of Link Reversal• Full Reversal Algorithm• Partial Reversal Algorithm• Lower Bounds
•Conclusions
![Page 31: 1 Analysis of Link Reversal Routing Algorithms Srikanta Tirthapura (Iowa State University) and Costas Busch (Renssaeler Polytechnic Institute)](https://reader030.fdocuments.net/reader030/viewer/2022032522/56649d6e5503460f94a4f119/html5/thumbnails/31.jpg)
31Bad state
dest.
Good nodes Bad nodes
Definitions
![Page 32: 1 Analysis of Link Reversal Routing Algorithms Srikanta Tirthapura (Iowa State University) and Costas Busch (Renssaeler Polytechnic Institute)](https://reader030.fdocuments.net/reader030/viewer/2022032522/56649d6e5503460f94a4f119/html5/thumbnails/32.jpg)
32
Resulting Good state
dest.
![Page 33: 1 Analysis of Link Reversal Routing Algorithms Srikanta Tirthapura (Iowa State University) and Costas Busch (Renssaeler Polytechnic Institute)](https://reader030.fdocuments.net/reader030/viewer/2022032522/56649d6e5503460f94a4f119/html5/thumbnails/33.jpg)
33
dest.
Good nodes
Good Nodes Never Reverse
Proof by a simple induction on distance from dest.
![Page 34: 1 Analysis of Link Reversal Routing Algorithms Srikanta Tirthapura (Iowa State University) and Costas Busch (Renssaeler Polytechnic Institute)](https://reader030.fdocuments.net/reader030/viewer/2022032522/56649d6e5503460f94a4f119/html5/thumbnails/34.jpg)
34
Many possible reversal schedules
A
B
C
![Page 35: 1 Analysis of Link Reversal Routing Algorithms Srikanta Tirthapura (Iowa State University) and Costas Busch (Renssaeler Polytechnic Institute)](https://reader030.fdocuments.net/reader030/viewer/2022032522/56649d6e5503460f94a4f119/html5/thumbnails/35.jpg)
35
Schedule of Reversals is NOT important
• Lemma:
For all executions of any deterministic reversal algorithm starting from the same initial state
– # of reversals is the same– Final state is the same
• For upper bounds and lower bounds, we can choose a “convenient” execution schedule
![Page 36: 1 Analysis of Link Reversal Routing Algorithms Srikanta Tirthapura (Iowa State University) and Costas Busch (Renssaeler Polytechnic Institute)](https://reader030.fdocuments.net/reader030/viewer/2022032522/56649d6e5503460f94a4f119/html5/thumbnails/36.jpg)
36
Talk Outline
• Link Reversal Routing
• Previous Work & Contributions
• Our Analysis• Basic Properties of Link Reversal• Full Reversal Algorithm• Partial Reversal Algorithm• Lower Bounds
•Conclusions
![Page 37: 1 Analysis of Link Reversal Routing Algorithms Srikanta Tirthapura (Iowa State University) and Costas Busch (Renssaeler Polytechnic Institute)](https://reader030.fdocuments.net/reader030/viewer/2022032522/56649d6e5503460f94a4f119/html5/thumbnails/37.jpg)
37
Bad state
dest.
Good nodes Bad nodes
![Page 38: 1 Analysis of Link Reversal Routing Algorithms Srikanta Tirthapura (Iowa State University) and Costas Busch (Renssaeler Polytechnic Institute)](https://reader030.fdocuments.net/reader030/viewer/2022032522/56649d6e5503460f94a4f119/html5/thumbnails/38.jpg)
38
Layers of bad nodes
dest.
Good nodes Bad nodes
1L 2L 3L 4L
![Page 39: 1 Analysis of Link Reversal Routing Algorithms Srikanta Tirthapura (Iowa State University) and Costas Busch (Renssaeler Polytechnic Institute)](https://reader030.fdocuments.net/reader030/viewer/2022032522/56649d6e5503460f94a4f119/html5/thumbnails/39.jpg)
39
Layers of bad nodes
1L 2L 3L mL
dest.
A layer:
![Page 40: 1 Analysis of Link Reversal Routing Algorithms Srikanta Tirthapura (Iowa State University) and Costas Busch (Renssaeler Polytechnic Institute)](https://reader030.fdocuments.net/reader030/viewer/2022032522/56649d6e5503460f94a4f119/html5/thumbnails/40.jpg)
40
1L 2L 3L 4L
There is an execution segment such that:Every bad node reverses exactly once
1E
dest.
![Page 41: 1 Analysis of Link Reversal Routing Algorithms Srikanta Tirthapura (Iowa State University) and Costas Busch (Renssaeler Polytechnic Institute)](https://reader030.fdocuments.net/reader030/viewer/2022032522/56649d6e5503460f94a4f119/html5/thumbnails/41.jpg)
41
dest.
1L 2L 3L 4Lr
r
r
There is an execution segment such that:Every bad node reverses exactly once
1E
![Page 42: 1 Analysis of Link Reversal Routing Algorithms Srikanta Tirthapura (Iowa State University) and Costas Busch (Renssaeler Polytechnic Institute)](https://reader030.fdocuments.net/reader030/viewer/2022032522/56649d6e5503460f94a4f119/html5/thumbnails/42.jpg)
42
dest.
1L 2L 3L 4Lr
r
r
r
r
There is an execution segment such that:Every bad node reverses exactly once
1E
![Page 43: 1 Analysis of Link Reversal Routing Algorithms Srikanta Tirthapura (Iowa State University) and Costas Busch (Renssaeler Polytechnic Institute)](https://reader030.fdocuments.net/reader030/viewer/2022032522/56649d6e5503460f94a4f119/html5/thumbnails/43.jpg)
43
dest.
1L 2L 3L 4Lr
r
r
r
r
r
r
r
There is an execution segment such that:Every bad node reverses exactly once
1E
![Page 44: 1 Analysis of Link Reversal Routing Algorithms Srikanta Tirthapura (Iowa State University) and Costas Busch (Renssaeler Polytechnic Institute)](https://reader030.fdocuments.net/reader030/viewer/2022032522/56649d6e5503460f94a4f119/html5/thumbnails/44.jpg)
44
dest.
1L 2L 3L 4L
•The remaining bad nodes return to the same state as before the execution
At the end of execution :•All nodes of layer become good nodes 1L
r
r
r
r
r
r
r
r
r
r
r
r
1E
![Page 45: 1 Analysis of Link Reversal Routing Algorithms Srikanta Tirthapura (Iowa State University) and Costas Busch (Renssaeler Polytechnic Institute)](https://reader030.fdocuments.net/reader030/viewer/2022032522/56649d6e5503460f94a4f119/html5/thumbnails/45.jpg)
45
dest.
2L 3L 4L
At the end of execution :1E
•The remaining bad nodes return to the same state as before the execution
•All nodes of layer become good nodes 1L
![Page 46: 1 Analysis of Link Reversal Routing Algorithms Srikanta Tirthapura (Iowa State University) and Costas Busch (Renssaeler Polytechnic Institute)](https://reader030.fdocuments.net/reader030/viewer/2022032522/56649d6e5503460f94a4f119/html5/thumbnails/46.jpg)
46
dest.
2L 3L 4L
There is an execution such that:
Every (remaining) bad node reverses exactly once
2E
![Page 47: 1 Analysis of Link Reversal Routing Algorithms Srikanta Tirthapura (Iowa State University) and Costas Busch (Renssaeler Polytechnic Institute)](https://reader030.fdocuments.net/reader030/viewer/2022032522/56649d6e5503460f94a4f119/html5/thumbnails/47.jpg)
47
dest.
2L 3L 4L
At the end of execution :2E
•The remaining bad nodes return to the same state as before the execution
•All nodes of layer become good nodes 2L
![Page 48: 1 Analysis of Link Reversal Routing Algorithms Srikanta Tirthapura (Iowa State University) and Costas Busch (Renssaeler Polytechnic Institute)](https://reader030.fdocuments.net/reader030/viewer/2022032522/56649d6e5503460f94a4f119/html5/thumbnails/48.jpg)
48
dest.
3L 4L
At the end of execution :2E
•The remaining bad nodes return to the same state as before the execution
•All nodes of layer become good nodes 2L
![Page 49: 1 Analysis of Link Reversal Routing Algorithms Srikanta Tirthapura (Iowa State University) and Costas Busch (Renssaeler Polytechnic Institute)](https://reader030.fdocuments.net/reader030/viewer/2022032522/56649d6e5503460f94a4f119/html5/thumbnails/49.jpg)
49
dest.
4L
At the end of execution :
All nodes of layer become good nodes 3L3E
![Page 50: 1 Analysis of Link Reversal Routing Algorithms Srikanta Tirthapura (Iowa State University) and Costas Busch (Renssaeler Polytechnic Institute)](https://reader030.fdocuments.net/reader030/viewer/2022032522/56649d6e5503460f94a4f119/html5/thumbnails/50.jpg)
50
dest.
At the end of execution :
All nodes of layer become good nodes 4L4E
![Page 51: 1 Analysis of Link Reversal Routing Algorithms Srikanta Tirthapura (Iowa State University) and Costas Busch (Renssaeler Polytechnic Institute)](https://reader030.fdocuments.net/reader030/viewer/2022032522/56649d6e5503460f94a4f119/html5/thumbnails/51.jpg)
51
1L 2L 3L mL
dest.
Reversals per node:0 0 0 0
![Page 52: 1 Analysis of Link Reversal Routing Algorithms Srikanta Tirthapura (Iowa State University) and Costas Busch (Renssaeler Polytechnic Institute)](https://reader030.fdocuments.net/reader030/viewer/2022032522/56649d6e5503460f94a4f119/html5/thumbnails/52.jpg)
52
1L 2L 3L mL
dest.
Reversals per node:1 1 1 1
End of execution 1E
![Page 53: 1 Analysis of Link Reversal Routing Algorithms Srikanta Tirthapura (Iowa State University) and Costas Busch (Renssaeler Polytechnic Institute)](https://reader030.fdocuments.net/reader030/viewer/2022032522/56649d6e5503460f94a4f119/html5/thumbnails/53.jpg)
53
1L 2L 3L mL
dest.
Reversals per node:1 2 2 2
End of execution 2E
![Page 54: 1 Analysis of Link Reversal Routing Algorithms Srikanta Tirthapura (Iowa State University) and Costas Busch (Renssaeler Polytechnic Institute)](https://reader030.fdocuments.net/reader030/viewer/2022032522/56649d6e5503460f94a4f119/html5/thumbnails/54.jpg)
54
1L 2L 3L mL
dest.
Reversals per node:1 2 3 3
End of execution 3E
![Page 55: 1 Analysis of Link Reversal Routing Algorithms Srikanta Tirthapura (Iowa State University) and Costas Busch (Renssaeler Polytechnic Institute)](https://reader030.fdocuments.net/reader030/viewer/2022032522/56649d6e5503460f94a4f119/html5/thumbnails/55.jpg)
55
1L 2L 3L mL
dest.
Reversals per node:1 2 3 m
End of execution mE
![Page 56: 1 Analysis of Link Reversal Routing Algorithms Srikanta Tirthapura (Iowa State University) and Costas Busch (Renssaeler Polytechnic Institute)](https://reader030.fdocuments.net/reader030/viewer/2022032522/56649d6e5503460f94a4f119/html5/thumbnails/56.jpg)
56
Each node in layer reverses times iL i
Reversals per node:1 2 3 m
1L 2L 3L mL
dest.
![Page 57: 1 Analysis of Link Reversal Routing Algorithms Srikanta Tirthapura (Iowa State University) and Costas Busch (Renssaeler Polytechnic Institute)](https://reader030.fdocuments.net/reader030/viewer/2022032522/56649d6e5503460f94a4f119/html5/thumbnails/57.jpg)
57
Reversals per node:1 2 3 m
Nodes per layer: 1n 2n 3n mn
#reversals: 11 n 22 n 33 n mnm
1L 2L 3L mL
dest.
![Page 58: 1 Analysis of Link Reversal Routing Algorithms Srikanta Tirthapura (Iowa State University) and Costas Busch (Renssaeler Polytechnic Institute)](https://reader030.fdocuments.net/reader030/viewer/2022032522/56649d6e5503460f94a4f119/html5/thumbnails/58.jpg)
58
For bad nodes, trivial upper bound: n )( 2nO
#reversals: 11 n 22 n 33 n mnm
(#reversals and time)
1L 2L 3L mL
dest.
nn
![Page 59: 1 Analysis of Link Reversal Routing Algorithms Srikanta Tirthapura (Iowa State University) and Costas Busch (Renssaeler Polytechnic Institute)](https://reader030.fdocuments.net/reader030/viewer/2022032522/56649d6e5503460f94a4f119/html5/thumbnails/59.jpg)
59
#reversals bound is tight
1L 2L 3L nL
dest.
Reversals per node:
1 2 3 n
#reversals: )(321 2nn
)( 2nO
![Page 60: 1 Analysis of Link Reversal Routing Algorithms Srikanta Tirthapura (Iowa State University) and Costas Busch (Renssaeler Polytechnic Institute)](https://reader030.fdocuments.net/reader030/viewer/2022032522/56649d6e5503460f94a4f119/html5/thumbnails/60.jpg)
60
None of these reversals are performed in parallel
time bound is tight
1L 2L 12/ nLdest.
)( 2nO2/nL
12n#nodes =
#reversals in layer :2/nL
)(122
2nnn
)( 2nTime needed
![Page 61: 1 Analysis of Link Reversal Routing Algorithms Srikanta Tirthapura (Iowa State University) and Costas Busch (Renssaeler Polytechnic Institute)](https://reader030.fdocuments.net/reader030/viewer/2022032522/56649d6e5503460f94a4f119/html5/thumbnails/61.jpg)
61
Complete Solution to Full Reversal
• Given any initial state of the Full Reversal algorithm, our analysis canpredict
– the number of reversals of each node exactly
– the time taken to convergence
![Page 62: 1 Analysis of Link Reversal Routing Algorithms Srikanta Tirthapura (Iowa State University) and Costas Busch (Renssaeler Polytechnic Institute)](https://reader030.fdocuments.net/reader030/viewer/2022032522/56649d6e5503460f94a4f119/html5/thumbnails/62.jpg)
62
Talk Outline
• Link Reversal Routing
• Previous Work & Contributions
• Our Analysis• Basic Properties of Link Reversal• Full Reversal Algorithm• Partial Reversal Algorithm• Lower Bounds
•Conclusions
![Page 63: 1 Analysis of Link Reversal Routing Algorithms Srikanta Tirthapura (Iowa State University) and Costas Busch (Renssaeler Polytechnic Institute)](https://reader030.fdocuments.net/reader030/viewer/2022032522/56649d6e5503460f94a4f119/html5/thumbnails/63.jpg)
63
Partial Link Reversal Algorithm
),,( iba ii
Sink :i
before reversal after reversal
),,( iba ii
1)}(:min{ iNjaa ji
)1,4,0()2,3,0(
)3,2,0(
)4,5,0()5,2,0(
)6,1,0(
)Dest,0,0(
)1,4,0()2,3,0(
)3,2,0(
)4,5,0()5,2,0(
)6,1,1(
)Dest,0,0(
1}and)(:min{ jiji baiNjbb
sink
![Page 64: 1 Analysis of Link Reversal Routing Algorithms Srikanta Tirthapura (Iowa State University) and Costas Busch (Renssaeler Polytechnic Institute)](https://reader030.fdocuments.net/reader030/viewer/2022032522/56649d6e5503460f94a4f119/html5/thumbnails/64.jpg)
64
Bad state
dest.
Good nodes Bad nodes
![Page 65: 1 Analysis of Link Reversal Routing Algorithms Srikanta Tirthapura (Iowa State University) and Costas Busch (Renssaeler Polytechnic Institute)](https://reader030.fdocuments.net/reader030/viewer/2022032522/56649d6e5503460f94a4f119/html5/thumbnails/65.jpg)
65
Layers of bad nodes
dest.
Good nodes Bad nodes
1L 2L 3L 4L 5L
Nodes at layer are at distance from good nodes
iLi
![Page 66: 1 Analysis of Link Reversal Routing Algorithms Srikanta Tirthapura (Iowa State University) and Costas Busch (Renssaeler Polytechnic Institute)](https://reader030.fdocuments.net/reader030/viewer/2022032522/56649d6e5503460f94a4f119/html5/thumbnails/66.jpg)
66
Layers of bad nodes
1L 2L 3L mL
dest.
),,( iba ii ),,( max iba i ),,( min iba i
alpha value Max alpha Min alpha
![Page 67: 1 Analysis of Link Reversal Routing Algorithms Srikanta Tirthapura (Iowa State University) and Costas Busch (Renssaeler Polytechnic Institute)](https://reader030.fdocuments.net/reader030/viewer/2022032522/56649d6e5503460f94a4f119/html5/thumbnails/67.jpg)
67
when the network reaches a good state:
upper bound on alpha value
1L 2L 3L mL
dest.
1max a 2 3
maxa
m
![Page 68: 1 Analysis of Link Reversal Routing Algorithms Srikanta Tirthapura (Iowa State University) and Costas Busch (Renssaeler Polytechnic Institute)](https://reader030.fdocuments.net/reader030/viewer/2022032522/56649d6e5503460f94a4f119/html5/thumbnails/68.jpg)
68
when the network reaches a good state:
upper bound on #reversals
1L 2L 3L mL
dest.
1a 2 3 m
minmax aaa
maxa mina mina
Reason: Each partial reversal increases alpha value by at least 1.
![Page 69: 1 Analysis of Link Reversal Routing Algorithms Srikanta Tirthapura (Iowa State University) and Costas Busch (Renssaeler Polytechnic Institute)](https://reader030.fdocuments.net/reader030/viewer/2022032522/56649d6e5503460f94a4f119/html5/thumbnails/69.jpg)
69
when the network reaches a good state:
1L 2L 3L mL
dest.
1a 2 3
maxa
m
For bad nodes: n a bad node reverses atmost timesna
mina mina
#reversals and time: )( 2nanO
![Page 70: 1 Analysis of Link Reversal Routing Algorithms Srikanta Tirthapura (Iowa State University) and Costas Busch (Renssaeler Polytechnic Institute)](https://reader030.fdocuments.net/reader030/viewer/2022032522/56649d6e5503460f94a4f119/html5/thumbnails/70.jpg)
70
#reversals bound is tight
1L 2L 3L nL
dest.
Reversals per node: 2
12
a
22
23
2n
#reversals: )( 2nan
)( 2nanO
![Page 71: 1 Analysis of Link Reversal Routing Algorithms Srikanta Tirthapura (Iowa State University) and Costas Busch (Renssaeler Polytechnic Institute)](https://reader030.fdocuments.net/reader030/viewer/2022032522/56649d6e5503460f94a4f119/html5/thumbnails/71.jpg)
71
None of these reversals are performed in parallel
time bound is tight
1L 2L 12/ nLdest.
2/nL
2n
#nodes =
#reversals in layer :2/nL
)( 2nan
)( 2nan Time needed
)( 2nanO
12/ nL
222
na
n
![Page 72: 1 Analysis of Link Reversal Routing Algorithms Srikanta Tirthapura (Iowa State University) and Costas Busch (Renssaeler Polytechnic Institute)](https://reader030.fdocuments.net/reader030/viewer/2022032522/56649d6e5503460f94a4f119/html5/thumbnails/72.jpg)
72
Lower Bound for any Deterministic Algorithm
• For any deterministic reversal algorithm, there is an initial assignment of heights such that:
Nodes at a distance of d from a good node have to reverse d times
![Page 73: 1 Analysis of Link Reversal Routing Algorithms Srikanta Tirthapura (Iowa State University) and Costas Busch (Renssaeler Polytechnic Institute)](https://reader030.fdocuments.net/reader030/viewer/2022032522/56649d6e5503460f94a4f119/html5/thumbnails/73.jpg)
73
Layers of bad nodes
dest.
Good nodes Bad nodes
1L 2L 3L 4L 5L
Nodes at layer are at distance from good nodes
iLi
![Page 74: 1 Analysis of Link Reversal Routing Algorithms Srikanta Tirthapura (Iowa State University) and Costas Busch (Renssaeler Polytechnic Institute)](https://reader030.fdocuments.net/reader030/viewer/2022032522/56649d6e5503460f94a4f119/html5/thumbnails/74.jpg)
74
1L 2L 3L nL
dest.
Reversals per node:
0 1 2 1n
#reversals: )(321 2nn
Lower Bound on #reversals on worst case graphs
![Page 75: 1 Analysis of Link Reversal Routing Algorithms Srikanta Tirthapura (Iowa State University) and Costas Busch (Renssaeler Polytechnic Institute)](https://reader030.fdocuments.net/reader030/viewer/2022032522/56649d6e5503460f94a4f119/html5/thumbnails/75.jpg)
75
None of these reversals are performed in parallel
1L 2L 12/ nLdest.
2/nL
2n
#nodes =
#reversals in layer :2/nL
)( 2n
)( 2nTime needed
12/ nL
122nn
Lower Bound on time
![Page 76: 1 Analysis of Link Reversal Routing Algorithms Srikanta Tirthapura (Iowa State University) and Costas Busch (Renssaeler Polytechnic Institute)](https://reader030.fdocuments.net/reader030/viewer/2022032522/56649d6e5503460f94a4f119/html5/thumbnails/76.jpg)
76
Conclusions
• We gave the first formal performance analysis of deterministic link reversal algorithms
• Worst case performance-wise– Full Link Reversal is optimal (surprisingly)– Partial Link Reversal is not
• Good News: The time and work to stabilization depend only on the number of bad nodes
• Bad News: There is an inherent lower bound on efficiency of link reversal algorithms
![Page 77: 1 Analysis of Link Reversal Routing Algorithms Srikanta Tirthapura (Iowa State University) and Costas Busch (Renssaeler Polytechnic Institute)](https://reader030.fdocuments.net/reader030/viewer/2022032522/56649d6e5503460f94a4f119/html5/thumbnails/77.jpg)
77
Open Problems
• Improve worst-case performance of partial link reversal algorithm
• Analyze randomized algorithms
• Analyze average-case performance
A Preliminary version of this work appeared in SPAA 2003 (Symposium on Parallelism in Algorithms and Architectures)Full version available at: http://www.eng.iastate.edu/~snt/