Skip to Main Content
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.