By Topic

Two routing algorithms for failure protection in IP 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

3 Author(s)
Reichert, C. ; Fraunhoher FOKUS, Berlin, Germany ; Glickmann, Y. ; Magedanz, T.

Future IP networks demand increased resilience. We present two new routing algorithms which provide at each node two or more next hops towards every destination, so that nodes can react quickly without further signaling to link or node failures. We derive formal requirements of this approach on the routing graphs, describe and analyze two algorithms and introduce a new link weight metric dependent on the network topology only. Both algorithms are evaluated in terms of the number of protected nodes and links.

Published in:

Computers and Communications, 2005. ISCC 2005. Proceedings. 10th IEEE Symposium on

Date of Conference:

27-30 June 2005