Minimum Backup Configuration-Creation Method for IP Fast Reroute

Shohei Kamamura , Takashi Miyamura , Cristel Pelsser , Ichiro Inoue and Kohei Shiomoto

Download PDF Publisher Link

Abstract

IP fast reroute techniques have been proposed for achieving 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 failure. On the other hand, requiring too many backup configurations consumes more network resources. It is necessary to recover more traffic flows with fewer backup configurations to ensure scalability. We propose a new backup configuration-creation algorithm for maximizing traffic flows which are fast recovered as much as possible under a limited number of backup configurations. The basic idea is to construct a spanning tree excluding failure links with higher link-loads in each backup configuration. We show that our algorithm has more robust on actual large IP networks.

Publication Details

Publication Type
Conference Paper
Publication Date
December 2009
Published In
GLOBECOM 2009 - 2009 IEEE Global Telecommunications Conference
Pages
1586--1591
Publisher
IEEE
Location
Honolulu, Hawaii, USA
Digital Object Identifier (DOI)
10.1109/GLOCOM.2009.5425684

BibTeX Citation

@inproceedings{Kamamura2009,
	title        = {Minimum Backup Configuration-Creation Method for IP Fast Reroute},
	author       = {Shohei Kamamura and Takashi Miyamura and Cristel Pelsser and Ichiro Inoue and Kohei Shiomoto},
	year         = 2009,
	month        = dec,
	journal      = {GLOBECOM 2009 - 2009 IEEE Global Telecommunications Conference},
	booktitle    = {Proceedings of the Global Communications Conference, 2009. {GLOBECOM} 2009},
	location     = {Honolulu, Hawaii, USA},
	publisher    = {IEEE},
	address      = {Honolulu, Hawaii, USA},
	series       = {GLOBECOM'09},
	pages        = {1586--1591},
	doi          = {10.1109/GLOCOM.2009.5425684},
	isbn         = {978-1-4244-4148-8},
	issn         = {1930-529X},
	abstract     = {IP fast reroute techniques have been proposed for achieving 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 failure. On the other hand, requiring too many backup configurations consumes more network resources. It is necessary to recover more traffic flows with fewer backup configurations to ensure scalability. We propose a new backup configuration-creation algorithm for maximizing traffic flows which are fast recovered as much as possible under a limited number of backup configurations. The basic idea is to construct a spanning tree excluding failure links with higher link-loads in each backup configuration. We show that our algorithm has more robust on actual large IP networks.},
	bibsource    = {dblp computer science bibliography, https://dblp.org},
	biburl       = {https://dblp.org/rec/conf/globecom/KamamuraMPIS09.bib},
	eventdate    = {30 Nov.-4 Dec. 2009},
	eventtitleaddon = {Honolulu, HI, USA},
	file         = {:Kamamura2009 - Minimum Backup Configuration Creation Method for IP Fast Reroute.pdf:PDF},
	groups       = {International Conferences},
	keywords     = {IP fast reroute, scalability, MRC, robustness, backup configuration, Telecommunication traffic, Scalability, Robustness, Laboratories, IP networks, Routing protocols, Protection, Topology},
	numpages     = 6
}

Related publications