Failure insensitive routing for ensuring service availability

Intra-domain routing protocols employed in the Internet route around failed links by having routers detect adjacent link failures, exchange link state changes, and recompute their routing tables. Due to several delays in detection, propagation and recomputation, it may take tens of seconds to minutes after a link failure to resume forwarding of packets to the affected destinations. This discontinuity in destination reachability adversely affects the quality of continuous media applications such as Voice over IP. Moreover, the resulting service unavailability for even a short duration could be catastrophic in the world of e-commerce. Though careful tuning of the various parameters of the routing protocols can accelerate convergence, it may cause instability when the majority of the failures are transient. To improve the failure resiliency without jeopardizing the routing stability, we propose a local rerouting based approach called failure insensitive routing. Under this approach, upon a link failure, adjacent router suppresses global updating and instead initiates local rerouting. All other routers infer potential link failures from the packet's incoming interface, precompute interface specific forwarding We demonstrate that the proposed approach provides higher service availability than the existing routing schemes.

[1]  Kai-Yeung Siu,et al.  New dynamic SPT algorithm based on a ball-and-string model , 2001, TNET.

[2]  Christophe Diot,et al.  Impact of link failures on VoIP performance , 2002, NOSSDAV '02.

[3]  Hari Balakrishnan,et al.  Resilient overlay networks , 2001, SOSP.

[4]  Daniele Frigioni,et al.  Incremental algorithms for single-source shortest path trees , 1994 .

[5]  Cengiz Alaettinoglu,et al.  Towards Milli-Second IGP Convergence , 2000 .

[6]  Kai-Yeung Siu,et al.  New dynamic SPT algorithm based on a ball-and-string model , 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).

[7]  Ibrahim Matta,et al.  BRITE: an approach to universal topology generation , 2001, MASCOTS 2001, Proceedings Ninth International Symposium on Modeling, Analysis and Simulation of Computer and Telecommunication Systems.

[8]  Mikkel Thorup,et al.  Internet traffic engineering by optimizing OSPF weights , 2000, Proceedings IEEE INFOCOM 2000. Conference on Computer Communications. Nineteenth Annual Joint Conference of the IEEE Computer and Communications Societies (Cat. No.00CH37064).

[9]  Daniele Frigioni,et al.  Semi-Dynamic Shortest Paths and Breadth-First Search in Digraphs , 1997, STACS.

[10]  Robert Tappan Morris,et al.  Resilient overlay networks , 2001, SOSP.

[11]  Mikkel Thorup,et al.  Optimizing OSPF/IS-IS weights in a changing world , 2002, IEEE J. Sel. Areas Commun..

[12]  Kai-Yeung Siu,et al.  Routing reconfiguration in ip networks , 2000 .

[13]  Chen-Nee Chuah,et al.  Analysis of link failures in an IP backbone , 2002, IMW '02.

[14]  Christophe Diot,et al.  An approach to alleviate link overload as observed on an IP backbone , 2003, IEEE INFOCOM 2003. Twenty-second Annual Joint Conference of the IEEE Computer and Communications Societies (IEEE Cat. No.03CH37428).

[15]  Kai-Yeung Siu,et al.  Local restoration algorithm for link-state routing protocols , 1999, Proceedings Eight International Conference on Computer Communications and Networks (Cat. No.99EX370).

[16]  Bianca Schroeder,et al.  IGP link weight assignment for transient link failures , 2003 .