Download:
|
by Anish Arora, Hongwei Zhang, Student Member
In IEEE-IFIP DSN
http://www.cse.ohio-state.edu/~zhangho/publications/LSRP_TON.ps
Add To MetaCart
Abstract:
Abstract | We formulate a notion of local stabilization, by which a system self-stabilizes in time proportional to the size of any perturbation that changes the network topology or the state of nodes. The notion implies that the part of the network involved in the stabilization includes at most the nodes whose distance from the perturbed nodes is proportional to the perturbation size. Also, we present LSRP, a protocol for local stabilization in shortest path routing. LSRP achieves local stabilization via two techniques. First, it layers system computation into three diusing waves with dierent propagation speeds, i.e., \stabilization wave " with the lowest speed, \containment wave " with intermediate speed, and \super-containment wave " with the highest speed. The containment wave contains mistakenly initiated stabilization wave, the super-containment wave contains mistakenly initiated containment wave, and the supercontainment wave self-stabilizes itself locally. Second, LSRP avoids forming loops during stabilization, and it removes all transient loops within small constant time. To the best of our knowledge, LSRP is the rst protocol that achieves local stabilization in shortest path routing.
Citations
|
1027
|
Distributed Algorithms
– Lynch
- 1996
|
|
296
|
Ad Hoc Networking
– Perkins, Ed
- 2001
|
|
252
|
Routing in the Internet
– Huitema
- 1995
|
|
217
|
Internet routing instability
– Labovitz, Malan, et al.
- 1998
|
|
195
|
A border gateway protocol 4
– Rekhter, Li
- 1994
|
|
119
|
Distributed reset
– Arora, Gouda
- 1994
|
|
115
|
The impact of Internet policy and topology on delayed routing convergence
– Labovitz, Wattenhofer, et al.
- 2001
|
|
59
|
Observation and analysis of BGP behavior under stress
– Wang, Zhao, et al.
- 2002
|
|
57
|
Time Optimal Self-Stabilizing Synchronization
– Awerbuch, Kutten, et al.
- 1993
|
|
55
|
Time optimal self-stabilizing spanning tree algorithm
– Aggarwal, Kutten
- 1993
|
|
48
|
Fault-local distributed mending
– Kutten, Peleg
- 1995
|
|
48
|
Origins of Internet Routing Instability
– Labovitz, Malan, et al.
- 1999
|
|
46
|
Elements of Network Protocol Design
– Gouda
- 1998
|
|
45
|
Fault-containing self-stabilizing algorithms
– Ghosh, Gupta, et al.
- 1996
|
|
35
|
Routing Stability in Congested Networks: Experimentation and Analysis
– Shaikh, Varma, et al.
- 2000
|
|
35
|
S.: A path-finding algorithm for loop-free routing
– Garcia-Luna-Aceves, Murthy
- 1997
|
|
23
|
Garcia-Lunes-Aceves. Loop-Free Routing Using Diffusing Computations
– J
- 1993
|
|
22
|
Crash failures can drive protocols to arbitrary states
– Jayaram, Varghese
- 1996
|
|
20
|
GS3: Scalable self-configuration and self-healing in wireless networks
– Zhang, Arora
- 2002
|
|
11
|
Loop-free routing using diffusing computations
– Garcia-Lunes-Aceves
- 1993
|
|
8
|
Distributed error confinement
– Azar, Kutten, et al.
- 2003
|
|
7
|
Local tolerance to unbounded byzantine faults
– Nesterenko, Arora
- 2002
|
|
5
|
Scalable self-stabilization
– Ghosh, He
- 1999
|
|
2
|
GS : Scalable self-con and selfhealing in wireless networks
– Zhang, Arora
|
|
1
|
Fault-containing self-stabilization using priority scheduling
– Ghosh, He
|
