Routing schemes for network recovery under link and node failures

Abstract

Routing schemes combined with link-state detection mechanisms can be used to recover connection paths or network connectivity under the cases of link and node failures. Some schemes have large computation and state-update overhead as re-routing is performed throughout the network. Moreover, as soon as new routes are found, some link may become congested with flows under recovery. This congestion may add extra recovery delays and even further link or node failures. In this paper, we propose proactive routing recovery schemes that perform rerouting on links affected by the failure, therefore, minimizing the computation overhead. Congestion avoidance is also achieved in these schemes by calculating the distribution of re-routed traffic in a proactive fashion. We compare our proposed schemes with the open shortest path first (OSPF) scheme and show that our schemes can provide higher utilization of links and nodes for large networks in post-recovery. We show simulation results under link and node failures.