The original paper is in English. Non-English content has been machine-translated and may contain typographical errors or mistranslations. ex. Some numerals are expressed as "XNUMX".
Copyrights notice
The original paper is in English. Non-English content has been machine-translated and may contain typographical errors or mistranslations. Copyrights notice
Des techniques IP Fast Reroute ont été proposées pour obtenir une récupération rapide en cas de panne, en quelques millisecondes seulement. L'idée de base d'IP Fast Reroute est de réduire le temps de récupération en précalculant les routes de sauvegarde. L'algorithme de configurations de routage multiples (MRC) a été proposé pour implémenter IP Fast Reroute. MRC prépare des configurations de sauvegarde, qui sont utilisées pour trouver un itinéraire de détour après une panne. Cependant, cet algorithme établit trop de configurations de sauvegarde pour pouvoir récupérer en cas de panne. Nous proposons un nouvel algorithme de calcul de configuration de sauvegarde qui crée le moins de configurations possibles. L'idée de base est de construire un arbre couvrant qui exclut les liens de défaillance dans chaque configuration de sauvegarde. Nous montrons que l’efficacité de notre algorithme est particulièrement élevée dans les réseaux de loi de puissance à grande échelle.
The copyright of the original papers published on this site belongs to IEICE. Unauthorized use of the original or translated papers is prohibited. See IEICE Provisions on Copyright for details.
Copier
Shohei KAMAMURA, Takashi MIYAMURA, Yoshihiko UEMATSU, Kohei SHIOMOTO, "Scalable Backup Configurations Creation for IP Fast Reroute" in IEICE TRANSACTIONS on Communications,
vol. E94-B, no. 1, pp. 109-117, January 2011, doi: 10.1587/transcom.E94.B.109.
Abstract: IP Fast Reroute techniques have been proposed to achieve fast failure recovery, just a few milliseconds. The basic idea of IP Fast Reroute is to reduce recovery time by precomputing backup routes. The multiple routing configurations (MRC) algorithm was proposed to implement IP Fast Reroute. MRC prepares backup configurations, which are used for finding a detour route after a failure. However, this algorithm establishes too many backup configurations to recover from failures. We propose a new backup configuration computation algorithm that creates the fewest possible configurations. The basic idea is to construct a spanning tree that excludes failure links in each backup configuration. We show that the effectiveness of our algorithm is especially high in large-scale power-law networks.
URL: https://global.ieice.org/en_transactions/communications/10.1587/transcom.E94.B.109/_p
Copier
@ARTICLE{e94-b_1_109,
author={Shohei KAMAMURA, Takashi MIYAMURA, Yoshihiko UEMATSU, Kohei SHIOMOTO, },
journal={IEICE TRANSACTIONS on Communications},
title={Scalable Backup Configurations Creation for IP Fast Reroute},
year={2011},
volume={E94-B},
number={1},
pages={109-117},
abstract={IP Fast Reroute techniques have been proposed to achieve fast failure recovery, just a few milliseconds. The basic idea of IP Fast Reroute is to reduce recovery time by precomputing backup routes. The multiple routing configurations (MRC) algorithm was proposed to implement IP Fast Reroute. MRC prepares backup configurations, which are used for finding a detour route after a failure. However, this algorithm establishes too many backup configurations to recover from failures. We propose a new backup configuration computation algorithm that creates the fewest possible configurations. The basic idea is to construct a spanning tree that excludes failure links in each backup configuration. We show that the effectiveness of our algorithm is especially high in large-scale power-law networks.},
keywords={},
doi={10.1587/transcom.E94.B.109},
ISSN={1745-1345},
month={January},}
Copier
TY - JOUR
TI - Scalable Backup Configurations Creation for IP Fast Reroute
T2 - IEICE TRANSACTIONS on Communications
SP - 109
EP - 117
AU - Shohei KAMAMURA
AU - Takashi MIYAMURA
AU - Yoshihiko UEMATSU
AU - Kohei SHIOMOTO
PY - 2011
DO - 10.1587/transcom.E94.B.109
JO - IEICE TRANSACTIONS on Communications
SN - 1745-1345
VL - E94-B
IS - 1
JA - IEICE TRANSACTIONS on Communications
Y1 - January 2011
AB - IP Fast Reroute techniques have been proposed to achieve fast failure recovery, just a few milliseconds. The basic idea of IP Fast Reroute is to reduce recovery time by precomputing backup routes. The multiple routing configurations (MRC) algorithm was proposed to implement IP Fast Reroute. MRC prepares backup configurations, which are used for finding a detour route after a failure. However, this algorithm establishes too many backup configurations to recover from failures. We propose a new backup configuration computation algorithm that creates the fewest possible configurations. The basic idea is to construct a spanning tree that excludes failure links in each backup configuration. We show that the effectiveness of our algorithm is especially high in large-scale power-law networks.
ER -