TY - GEN
T1 - Routing schemes for network recovery under link and node failures
AU - Takouna, Ibrahim
AU - Rojas-Cessa, Roberto
PY - 2008
Y1 - 2008
N2 - 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 rerouting 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.
AB - 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 rerouting 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.
KW - Congestion avoidance
KW - Failure recovery
KW - Fault-tolerant network
KW - Routing
KW - Self-recovery network
UR - http://www.scopus.com/inward/record.url?scp=60649101601&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=60649101601&partnerID=8YFLogxK
U2 - 10.1109/HSPR.2008.4734423
DO - 10.1109/HSPR.2008.4734423
M3 - Conference contribution
AN - SCOPUS:60649101601
SN - 9781424419821
T3 - 2008 International Conference on High Performance Switching and Routing, HPSR 2008
SP - 69
EP - 73
BT - 2008 International Conference on High Performance Switching and Routing, HPSR 2008
T2 - 2008 International Conference on High Performance Switching and Routing, HPSR 2008
Y2 - 15 May 2008 through 17 May 2008
ER -