LSRP: local stabilization in shortest path routing

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 diffusing waves each having a different propagation speed, 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 the mistakenly initiated stabilization wave, the super-containment wave contains the mistakenly initiated containment wave, and the super-containment 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 first protocol that achieves local stabilization in shortest path routing

[1]  Seif Haridi,et al.  Distributed Algorithms , 1992, Lecture Notes in Computer Science.

[2]  Shay Kutten,et al.  Time Optimal Self-Stabilizing Spanning Tree Algorithms , 1993, FSTTCS.

[3]  Boaz Patt-Shamir,et al.  Time optimal self-stabilizing synchronization , 1993, STOC.

[4]  J. J. Garcia-Luna-Aceves,et al.  Loop-free routing using diffusing computations , 1993, TNET.

[5]  Anish Arora,et al.  Distributed Reset , 1994, IEEE Trans. Computers.

[6]  Christian Huitema,et al.  Routing in the Internet , 1995 .

[7]  Yakov Rekhter,et al.  A Border Gateway Protocol 4 (BGP-4) , 1994, RFC.

[8]  George Varghese,et al.  Crash failures can drive protocols to arbitrary states , 1996, PODC '96.

[9]  Arobinda Gupta,et al.  Fault-containing self-stabilizing algorithms , 1996, PODC '96.

[10]  J. J. Garcia-Luna-Aceves,et al.  A path-finding algorithm for loop-free routing , 1997, TNET.

[11]  Mohamed G. Gouda.  Elements of network protocol design , 1998 .

[12]  Xin He,et al.  Scalable Self-Stabilization , 1999, J. Parallel Distributed Comput..

[13]  Shay Kutten,et al.  Fault-Local Distributed Mending , 1999, J. Algorithms.

[14]  Farnam Jahanian,et al.  Origins of Internet routing instability , 1999, IEEE INFOCOM '99. Conference on Computer Communications. Proceedings. Eighteenth Annual Joint Conference of the IEEE Computer and Communications Societies. The Future is Now (Cat. No.99CH36320).

[15]  Aman Shaikh,et al.  Routing stability in congested networks: experimentation and analysis , 2000 .

[16]  Xin He,et al.  Fault-containing self-stabilization using priority scheduling , 2000, Inf. Process. Lett..

[17]  Roger Wattenhofer,et al.  The impact of Internet policy and topology on delayed routing convergence , 2001, Proceedings IEEE INFOCOM 2001. Conference on Computer Communications. Twentieth Annual Joint Conference of the IEEE Computer and Communications Society (Cat. No.01CH37213).

[18]  Hongwei Zhang,et al.  GS3: scalable self-configuration and self-healing in wireless networks , 2002, PODC '02.

[19]  A. Arora,et al.  Local Tolerance to Unbounded Byzantine Faults , 2002 .

[20]  Daniel Massey,et al.  Observation and analysis of BGP behavior under stress , 2002, IMW '02.

[21]  Hongwei Zhang,et al.  LSRP: local stabilization in shortest path routing , 2003, 2003 International Conference on Dependable Systems and Networks, 2003. Proceedings..

[22]  Boaz Patt-Shamir,et al.  Distributed error confinement , 2003, PODC '03.

[23]  Ivan Stojmenovic,et al.  Ad hoc Networking , 2004 .

[24]  Hongwei Zhang,et al.  LSRP: local stabilization in shortest path routing , 2006, TNET.