Two Routing Algorithms for Failure Protection in IP Networks

Authors:
Christoph Reichert;Yuri Glickmann
Affiliations:
Fraunhofer FOKUS;Fraunhofer FOKUS
Venue:
ISCC '05 Proceedings of the 10th IEEE Symposium on Computers and Communications
Year:
2005

Citing 0
Cited 5

On the feasibility and efficacy of protection routing in IP networks

INFOCOM'10 Proceedings of the 29th conference on Information communications
Fast recovery from dual-link or single-node failures in IP networks using tunneling

IEEE/ACM Transactions on Networking (TON)
Resilient and low stretch routing through embedding into tree metrics

WADS'11 Proceedings of the 12th international conference on Algorithms and data structures
On the feasibility and efficacy of protection routing in IP networks

IEEE/ACM Transactions on Networking (TON)
Ensuring connectivity via data plane mechanisms

nsdi'13 Proceedings of the 10th USENIX conference on Networked Systems Design and Implementation

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.