Scalable Backup Configurations Creation for IP Fast Reroute
Shohei Kamamura , Takashi Miyamura , Cristel Pelsser , Ichiro Inoue and Kohei Shiomoto
Abstract
IP Fast Reroute techniques have been proposed to achieve fast failure recovery in just a few milliseconds. The basic idea of IP Fast Reroute is to reduce recovery time after failure by precomputing backup routes. A multiple routing configurations (MRC) algorithm has been proposed for obtaining IP Fast Reroute. MRC prepares backup configurations, which are used for finding a detour route after failures. However, this current algorithm requires too many backup configurations to recover from failures. We propose a new backup configuration computation algorithm for reducing configurations as much as possible. The basic idea is to construct a spanning tree excluding failure links in each backup configuration. We show that the effectiveness of our algorithm is especially high in large-scale power-law networks.
Publication Details
- Publication Type
- Conference Paper
- Publication Date
- October 2009
- Published In
- 7th International Workshop on Design of Reliable Communication Networks (DRCN 2009)
- Pages
- 312--318
- Publisher
- IEEE
- Digital Object Identifier (DOI)
- 10.1109/drcn.2009.5339992
BibTeX Citation
@inproceedings{Kamamura2009b,
title = {Scalable Backup Configurations Creation for IP Fast Reroute},
author = {Shohei Kamamura and Takashi Miyamura and Cristel Pelsser and Ichiro Inoue and Kohei Shiomoto},
year = 2009,
month = oct,
booktitle = {7th International Workshop on Design of Reliable Communication Networks ({DRCN} 2009)},
publisher = {IEEE},
pages = {312--318},
doi = {10.1109/drcn.2009.5339992},
abstract = {IP Fast Reroute techniques have been proposed to achieve fast failure recovery in just a few milliseconds. The basic idea of IP Fast Reroute is to reduce recovery time after failure by precomputing backup routes. A multiple routing configurations (MRC) algorithm has been proposed for obtaining IP Fast Reroute. MRC prepares backup configurations, which are used for finding a detour route after failures. However, this current algorithm requires too many backup configurations to recover from failures. We propose a new backup configuration computation algorithm for reducing configurations as much as possible. The basic idea is to construct a spanning tree excluding failure links in each backup configuration. We show that the effectiveness of our algorithm is especially high in large-scale power-law networks.},
groups = {International Conferences}
}
Related publications
Minimum Backup Configuration-Creation Method for IP Fast Reroute
Shohei Kamamura, Takashi Miyamura, and Cristel Pelsser, et al.
GLOBECOM 2009 - 2009 IEEE Global Telecommunications Conference, 2009
SpliTable: Toward Routing Scalability through Distributed BGP Routing Tables
Akeo Masuda, Cristel Pelsser, and Kohei Shiomoto
IEICE Transactions on Communications, 2011
Providing scalable NH-diverse iBGP route re-distribution to achieve sub-second switch-over time
Cristel Pelsser, Steve Uhlig, and Tomonori Takeda, et al.
Computer Networks, 2010
Scalable Support of Interdomain Routes in a Single AS
Cristel Pelsser, Akeo Masuda, and Kohei Shiomoto
GLOBECOM 2009 - 2009 IEEE Global Telecommunications Conference, 2009