By Topic

A fast rerouting scheme for OSPF/IS-IS networks

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Yong Liu ; Dept. of ELEN, TAMU, College Station, TX, USA ; Reddy, A.L.N.

Most current backbone networks use link-state protocol, OSPF or IS-IS, as their intra-domain routing protocol. Link-state protocols perform global routing table update to route around the failures. It usually takes seconds. As real-time applications like VoIP emerge in recent years, there is a requirement for a fast rerouting mechanism to route around failures before all routers on the network update their routing tables. In addition, fast rerouting is more appropriate than global routing table update when failures are transient. We propose such a fast rerouting extension for link-state protocols. In our approach, when a link fails, the affected traffic is rerouted along a pre-computed rerouting path. In case rerouting cannot be done locally, the local router signals the minimal number of upstream routers to setup the rerouting path for rerouting. We propose algorithms that simplify the rerouting operation and the rerouting path setup. With a simple extension to the current link state protocols, our scheme can route around failures faster and involves minimal number of routers for rerouting.

Published in:

Computer Communications and Networks, 2004. ICCCN 2004. Proceedings. 13th International Conference on

Date of Conference:

11-13 Oct. 2004