loading...
 This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
10th IEEE Symposium on Computers and Communications (ISCC'05)
Two Routing Algorithms for Failure Protection in IP Networks
Cartagena, Murcia, Spain
June 27-June 30
ISBN: 0-7695-2373-0
Christoph Reichert, Fraunhofer FOKUS
Yuri Glickmann, Fraunhofer FOKUS
Thomas Magedanz, Fraunhofer FOKUS
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.
Citation:
Christoph Reichert, Yuri Glickmann, Thomas Magedanz, "Two Routing Algorithms for Failure Protection in IP Networks," iscc, pp.97-102, 10th IEEE Symposium on Computers and Communications (ISCC'05), 2005
Usage of this product signifies your acceptance of the Terms of Use.