IP fast rerouting for single-link/node failure recovery

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract

Failure recovery in IP networks is critical to high quality service provisioning. The main challenge is how to achieve fast recovery without introducing high complexity and resource usage. Today's networks mainly use route recalculation and lower layer protection. However, route recalculation could take as long as seconds to complete; while lower layer protection usually requires considerable bandwidth redundancy. We present two fast rerouting algorithms to achieve recovery from single-link and single-node failures, respectively. The idea is to calculated backup paths in advance. When a failure is detected, the affected packets are immediately forwarded through backup paths to shorten the service disruption. This paper answers the following questions: 1. How to find backup paths? 2. How to coordinate routers during the rerouting without explicit signaling? 3. How to realize distributed implementation? The schemes react to failures very fast because there are no calculations on the fly. They are also cost efficient because no bandwidth reservation is required. Our schemes guarantee 100% failure recovery without any assumption on the primary paths. Simulations show that our schemes yield comparable performance to shortest path route recalculation. This work illuminates the possibility of using pure IP layer solutions to build highly survivable yet cost-efficient networks.

Original languageEnglish (US)
Title of host publicationProceedings of the 4th International Conference on Broadband Communications, Networks, Systems, BroadNets
Pages142-151
Number of pages10
DOIs
StatePublished - 2007
Event4th International Conference on Broadband Communications, Networks, Systems, BroadNets - Raleigh, NC, United States
Duration: Sep 10 2007Sep 14 2007

Other

Other4th International Conference on Broadband Communications, Networks, Systems, BroadNets
CountryUnited States
CityRaleigh, NC
Period9/10/079/14/07

Fingerprint

Recovery
Bandwidth
Routers
Redundancy
Costs

ASJC Scopus subject areas

  • Computer Networks and Communications
  • Control and Systems Engineering
  • Electrical and Electronic Engineering

Cite this

Xi, K., & Chao, H. J. (2007). IP fast rerouting for single-link/node failure recovery. In Proceedings of the 4th International Conference on Broadband Communications, Networks, Systems, BroadNets (pp. 142-151). [4550418] https://doi.org/10.1109/BROADNETS.2007.4550418

IP fast rerouting for single-link/node failure recovery. / Xi, Kang; Chao, H. Jonathan.

Proceedings of the 4th International Conference on Broadband Communications, Networks, Systems, BroadNets. 2007. p. 142-151 4550418.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Xi, K & Chao, HJ 2007, IP fast rerouting for single-link/node failure recovery. in Proceedings of the 4th International Conference on Broadband Communications, Networks, Systems, BroadNets., 4550418, pp. 142-151, 4th International Conference on Broadband Communications, Networks, Systems, BroadNets, Raleigh, NC, United States, 9/10/07. https://doi.org/10.1109/BROADNETS.2007.4550418
Xi K, Chao HJ. IP fast rerouting for single-link/node failure recovery. In Proceedings of the 4th International Conference on Broadband Communications, Networks, Systems, BroadNets. 2007. p. 142-151. 4550418 https://doi.org/10.1109/BROADNETS.2007.4550418
Xi, Kang ; Chao, H. Jonathan. / IP fast rerouting for single-link/node failure recovery. Proceedings of the 4th International Conference on Broadband Communications, Networks, Systems, BroadNets. 2007. pp. 142-151
@inproceedings{014696b373e34273a3d1d819d0246adc,
title = "IP fast rerouting for single-link/node failure recovery",
abstract = "Failure recovery in IP networks is critical to high quality service provisioning. The main challenge is how to achieve fast recovery without introducing high complexity and resource usage. Today's networks mainly use route recalculation and lower layer protection. However, route recalculation could take as long as seconds to complete; while lower layer protection usually requires considerable bandwidth redundancy. We present two fast rerouting algorithms to achieve recovery from single-link and single-node failures, respectively. The idea is to calculated backup paths in advance. When a failure is detected, the affected packets are immediately forwarded through backup paths to shorten the service disruption. This paper answers the following questions: 1. How to find backup paths? 2. How to coordinate routers during the rerouting without explicit signaling? 3. How to realize distributed implementation? The schemes react to failures very fast because there are no calculations on the fly. They are also cost efficient because no bandwidth reservation is required. Our schemes guarantee 100{\%} failure recovery without any assumption on the primary paths. Simulations show that our schemes yield comparable performance to shortest path route recalculation. This work illuminates the possibility of using pure IP layer solutions to build highly survivable yet cost-efficient networks.",
author = "Kang Xi and Chao, {H. Jonathan}",
year = "2007",
doi = "10.1109/BROADNETS.2007.4550418",
language = "English (US)",
isbn = "1424414334",
pages = "142--151",
booktitle = "Proceedings of the 4th International Conference on Broadband Communications, Networks, Systems, BroadNets",

}

TY - GEN

T1 - IP fast rerouting for single-link/node failure recovery

AU - Xi, Kang

AU - Chao, H. Jonathan

PY - 2007

Y1 - 2007

N2 - Failure recovery in IP networks is critical to high quality service provisioning. The main challenge is how to achieve fast recovery without introducing high complexity and resource usage. Today's networks mainly use route recalculation and lower layer protection. However, route recalculation could take as long as seconds to complete; while lower layer protection usually requires considerable bandwidth redundancy. We present two fast rerouting algorithms to achieve recovery from single-link and single-node failures, respectively. The idea is to calculated backup paths in advance. When a failure is detected, the affected packets are immediately forwarded through backup paths to shorten the service disruption. This paper answers the following questions: 1. How to find backup paths? 2. How to coordinate routers during the rerouting without explicit signaling? 3. How to realize distributed implementation? The schemes react to failures very fast because there are no calculations on the fly. They are also cost efficient because no bandwidth reservation is required. Our schemes guarantee 100% failure recovery without any assumption on the primary paths. Simulations show that our schemes yield comparable performance to shortest path route recalculation. This work illuminates the possibility of using pure IP layer solutions to build highly survivable yet cost-efficient networks.

AB - Failure recovery in IP networks is critical to high quality service provisioning. The main challenge is how to achieve fast recovery without introducing high complexity and resource usage. Today's networks mainly use route recalculation and lower layer protection. However, route recalculation could take as long as seconds to complete; while lower layer protection usually requires considerable bandwidth redundancy. We present two fast rerouting algorithms to achieve recovery from single-link and single-node failures, respectively. The idea is to calculated backup paths in advance. When a failure is detected, the affected packets are immediately forwarded through backup paths to shorten the service disruption. This paper answers the following questions: 1. How to find backup paths? 2. How to coordinate routers during the rerouting without explicit signaling? 3. How to realize distributed implementation? The schemes react to failures very fast because there are no calculations on the fly. They are also cost efficient because no bandwidth reservation is required. Our schemes guarantee 100% failure recovery without any assumption on the primary paths. Simulations show that our schemes yield comparable performance to shortest path route recalculation. This work illuminates the possibility of using pure IP layer solutions to build highly survivable yet cost-efficient networks.

UR - http://www.scopus.com/inward/record.url?scp=51249105153&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=51249105153&partnerID=8YFLogxK

U2 - 10.1109/BROADNETS.2007.4550418

DO - 10.1109/BROADNETS.2007.4550418

M3 - Conference contribution

AN - SCOPUS:51249105153

SN - 1424414334

SN - 9781424414338

SP - 142

EP - 151

BT - Proceedings of the 4th International Conference on Broadband Communications, Networks, Systems, BroadNets

ER -