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 with different 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 super-containment wave selfstabilizes 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

[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]  J. J. Garcia-Luna-Aceves,et al.  Loop-free routing using diffusing computations , 1993, TNET.

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

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

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

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

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

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

[9]  Anish Arora,et al.  Local Tolerance to Unbounded Byzantine Faults , 2002 .

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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