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]  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).

[2]  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).

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

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

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

[6]  Nancy A. Lynch,et al.  Distributed Algorithms , 1992, Lecture Notes in Computer Science.

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

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

[9]  Charles E. Perkins,et al.  Ad Hoc Networking , 2001 .

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

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

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

[13]  Anish Arora,et al.  Tolerance to unbounded Byzantine faults , 2002, 21st IEEE Symposium on Reliable Distributed Systems, 2002. Proceedings..

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

[15]  Christian Huitema,et al.  An Architecture for Residential Internet Telephony Service , 1999, IEEE Internet Comput..

[16]  Hongwei Zhang,et al.  GS3: scalable self-configuration and self-healing in wireless sensor networks , 2003, Comput. Networks.

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

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

[19]  J. J. Garcia-Lunes-Aceves.  Loop-free routing using diffusing computations , 1993 .

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

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