Loop-Free IP Fast Rerouting Considering Double-Link Failures

Shohei KAMAMURA; Daisaku SHIMAZAKI; Atsushi HIRAMATSU; Hidenori NAKAZATO

doi:10.1587/transcom.E95.B.3811

Loop-Free IP Fast Rerouting Considering Double-Link Failures

Shohei KAMAMURA, Daisaku SHIMAZAKI, Atsushi HIRAMATSU, Hidenori NAKAZATO

Full Text Views

0

Share
Cite this

Summary :

IP fast rerouting has widely been studied for realizing millisecond-order recovery on pure IP networks. This paper proposes IP fast rerouting using backup topologies against concurrent double failures. The main issue in recovering from multiple failures is avoiding forwarding loops. To avoid forwarding loops, we propose a deterministic forwarding algorithm, which estimates the concurrently occurring failures from the packet header information. We also propose an efficient backup topology design algorithm which is both loop-free and which reduces the number of backup topologies. Our key idea is preparing the adequate diversity of backup routes for arbitrary source and destination pairs by combination of backup topologies. For efficient computation of diverse routes, we propose a similarity comparison-based algorithm between the original topology and the backup topologies. Our algorithm can achieve nearly optimal loop-free restoration from double failures on realistic topologies without explicit failure notification.

Publication: IEICE TRANSACTIONS on Communications Vol.E95-B No.12 pp.3811-3821

Publication Date: 2012/12/01

Publicized

Online ISSN: 1745-1345

DOI: 10.1587/transcom.E95.B.3811

Type of Manuscript: PAPER

Category: Network

Cite this

Copy

Shohei KAMAMURA, Daisaku SHIMAZAKI, Atsushi HIRAMATSU, Hidenori NAKAZATO, "Loop-Free IP Fast Rerouting Considering Double-Link Failures" in IEICE TRANSACTIONS on Communications, vol. E95-B, no. 12, pp. 3811-3821, December 2012, doi: 10.1587/transcom.E95.B.3811.
Abstract: IP fast rerouting has widely been studied for realizing millisecond-order recovery on pure IP networks. This paper proposes IP fast rerouting using backup topologies against concurrent double failures. The main issue in recovering from multiple failures is avoiding forwarding loops. To avoid forwarding loops, we propose a deterministic forwarding algorithm, which estimates the concurrently occurring failures from the packet header information. We also propose an efficient backup topology design algorithm which is both loop-free and which reduces the number of backup topologies. Our key idea is preparing the adequate diversity of backup routes for arbitrary source and destination pairs by combination of backup topologies. For efficient computation of diverse routes, we propose a similarity comparison-based algorithm between the original topology and the backup topologies. Our algorithm can achieve nearly optimal loop-free restoration from double failures on realistic topologies without explicit failure notification.
URL: https://globals.ieice.org/en_transactions/communications/10.1587/transcom.E95.B.3811/_p

Copy

@ARTICLE{e95-b_12_3811,
author={Shohei KAMAMURA, Daisaku SHIMAZAKI, Atsushi HIRAMATSU, Hidenori NAKAZATO, },
journal={IEICE TRANSACTIONS on Communications},
title={Loop-Free IP Fast Rerouting Considering Double-Link Failures},
year={2012},
volume={E95-B},
number={12},
pages={3811-3821},
abstract={IP fast rerouting has widely been studied for realizing millisecond-order recovery on pure IP networks. This paper proposes IP fast rerouting using backup topologies against concurrent double failures. The main issue in recovering from multiple failures is avoiding forwarding loops. To avoid forwarding loops, we propose a deterministic forwarding algorithm, which estimates the concurrently occurring failures from the packet header information. We also propose an efficient backup topology design algorithm which is both loop-free and which reduces the number of backup topologies. Our key idea is preparing the adequate diversity of backup routes for arbitrary source and destination pairs by combination of backup topologies. For efficient computation of diverse routes, we propose a similarity comparison-based algorithm between the original topology and the backup topologies. Our algorithm can achieve nearly optimal loop-free restoration from double failures on realistic topologies without explicit failure notification.},
keywords={},
doi={10.1587/transcom.E95.B.3811},
ISSN={1745-1345},
month={December},}

Copy

TY - JOUR
TI - Loop-Free IP Fast Rerouting Considering Double-Link Failures
T2 - IEICE TRANSACTIONS on Communications
SP - 3811
EP - 3821
AU - Shohei KAMAMURA
AU - Daisaku SHIMAZAKI
AU - Atsushi HIRAMATSU
AU - Hidenori NAKAZATO
PY - 2012
DO - 10.1587/transcom.E95.B.3811
JO - IEICE TRANSACTIONS on Communications
SN - 1745-1345
VL - E95-B
IS - 12
JA - IEICE TRANSACTIONS on Communications
Y1 - December 2012
AB - IP fast rerouting has widely been studied for realizing millisecond-order recovery on pure IP networks. This paper proposes IP fast rerouting using backup topologies against concurrent double failures. The main issue in recovering from multiple failures is avoiding forwarding loops. To avoid forwarding loops, we propose a deterministic forwarding algorithm, which estimates the concurrently occurring failures from the packet header information. We also propose an efficient backup topology design algorithm which is both loop-free and which reduces the number of backup topologies. Our key idea is preparing the adequate diversity of backup routes for arbitrary source and destination pairs by combination of backup topologies. For efficient computation of diverse routes, we propose a similarity comparison-based algorithm between the original topology and the backup topologies. Our algorithm can achieve nearly optimal loop-free restoration from double failures on realistic topologies without explicit failure notification.
ER -