Loop-Free IP Fast Rerouting Considering Double-Link Failures


IEICE TRANSACTIONS on Communications   Vol.E95-B   No.12   pp.3811-3821
Publication Date: 2012/12/01
Online ISSN: 1745-1345
DOI: 10.1587/transcom.E95.B.3811
Print ISSN: 0916-8516
Type of Manuscript: PAPER
Category: Network
backup topologies,  diversity,  IP fast rerouting,  loop-free,  multiple failures,  network similarity,  

Full Text: PDF(2.3MB)>>
Buy this Article

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.