A Single Backup-Table Rerouting Scheme for Fast Failure Protection in OSPF

Takuya YOSHIHIRO

doi:10.1093/ietcom/e91-b.9.2838

A Single Backup-Table Rerouting Scheme for Fast Failure Protection in OSPF

Takuya YOSHIHIRO

Full Text Views

0

Cite this

Summary :

We propose a practical link protection scheme, called Single Backup-table Rerouting, (SBR) as an extension for Open Shortest Path First (OSPF). SBR protects against any single link failure as soon as the failure occurs if the topology of every area in OSPF is two-link-connected. An efficient algorithm to compute a set of backup tables is provided for networks with symmetric link costs. The foremost feature of SBR is that the backup process is fully distributed, so no message exchange is required and the modification of OSPF is minor. OSPF is extended with the following: only one extra backup routing table, a 2-bit flag at each traffic packet, and a process for handling the backup table. There are no changes to the message format of OSPF. In this paper, we present the practical link protection scheme by fitting SBR into several OSPF specific mechanisms such as OSPF areas, Equal Costs Multipath (ECMP), and virtual links with proofs of their correctness. Furthermore, together with a loop-free routing technique for link-state routing, SBR guarantees the consistency of every route against a single link failure, even during the path recomputation phase, until it converges to the new shortest paths.

Publication: IEICE TRANSACTIONS on Communications Vol.E91-B No.9 pp.2838-2847

Publication Date: 2008/09/01

Publicized

Online ISSN: 1745-1345

DOI: 10.1093/ietcom/e91-b.9.2838

Type of Manuscript: Special Section PAPER (IEICE/IEEE Joint Special Section on Autonomous Decentralized Systems Theories and Application Deployments)

Category: Theories

Cite this

Copy

Takuya YOSHIHIRO, "A Single Backup-Table Rerouting Scheme for Fast Failure Protection in OSPF" in IEICE TRANSACTIONS on Communications, vol. E91-B, no. 9, pp. 2838-2847, September 2008, doi: 10.1093/ietcom/e91-b.9.2838.
Abstract: We propose a practical link protection scheme, called Single Backup-table Rerouting, (SBR) as an extension for Open Shortest Path First (OSPF). SBR protects against any single link failure as soon as the failure occurs if the topology of every area in OSPF is two-link-connected. An efficient algorithm to compute a set of backup tables is provided for networks with symmetric link costs. The foremost feature of SBR is that the backup process is fully distributed, so no message exchange is required and the modification of OSPF is minor. OSPF is extended with the following: only one extra backup routing table, a 2-bit flag at each traffic packet, and a process for handling the backup table. There are no changes to the message format of OSPF. In this paper, we present the practical link protection scheme by fitting SBR into several OSPF specific mechanisms such as OSPF areas, Equal Costs Multipath (ECMP), and virtual links with proofs of their correctness. Furthermore, together with a loop-free routing technique for link-state routing, SBR guarantees the consistency of every route against a single link failure, even during the path recomputation phase, until it converges to the new shortest paths.
URL: https://global.ieice.org/en_transactions/communications/10.1093/ietcom/e91-b.9.2838/_p

Copy

@ARTICLE{e91-b_9_2838,
author={Takuya YOSHIHIRO, },
journal={IEICE TRANSACTIONS on Communications},
title={A Single Backup-Table Rerouting Scheme for Fast Failure Protection in OSPF},
year={2008},
volume={E91-B},
number={9},
pages={2838-2847},
abstract={We propose a practical link protection scheme, called Single Backup-table Rerouting, (SBR) as an extension for Open Shortest Path First (OSPF). SBR protects against any single link failure as soon as the failure occurs if the topology of every area in OSPF is two-link-connected. An efficient algorithm to compute a set of backup tables is provided for networks with symmetric link costs. The foremost feature of SBR is that the backup process is fully distributed, so no message exchange is required and the modification of OSPF is minor. OSPF is extended with the following: only one extra backup routing table, a 2-bit flag at each traffic packet, and a process for handling the backup table. There are no changes to the message format of OSPF. In this paper, we present the practical link protection scheme by fitting SBR into several OSPF specific mechanisms such as OSPF areas, Equal Costs Multipath (ECMP), and virtual links with proofs of their correctness. Furthermore, together with a loop-free routing technique for link-state routing, SBR guarantees the consistency of every route against a single link failure, even during the path recomputation phase, until it converges to the new shortest paths.},
keywords={},
doi={10.1093/ietcom/e91-b.9.2838},
ISSN={1745-1345},
month={September},}

Copy

TY - JOUR
TI - A Single Backup-Table Rerouting Scheme for Fast Failure Protection in OSPF
T2 - IEICE TRANSACTIONS on Communications
SP - 2838
EP - 2847
AU - Takuya YOSHIHIRO
PY - 2008
DO - 10.1093/ietcom/e91-b.9.2838
JO - IEICE TRANSACTIONS on Communications
SN - 1745-1345
VL - E91-B
IS - 9
JA - IEICE TRANSACTIONS on Communications
Y1 - September 2008
AB - We propose a practical link protection scheme, called Single Backup-table Rerouting, (SBR) as an extension for Open Shortest Path First (OSPF). SBR protects against any single link failure as soon as the failure occurs if the topology of every area in OSPF is two-link-connected. An efficient algorithm to compute a set of backup tables is provided for networks with symmetric link costs. The foremost feature of SBR is that the backup process is fully distributed, so no message exchange is required and the modification of OSPF is minor. OSPF is extended with the following: only one extra backup routing table, a 2-bit flag at each traffic packet, and a process for handling the backup table. There are no changes to the message format of OSPF. In this paper, we present the practical link protection scheme by fitting SBR into several OSPF specific mechanisms such as OSPF areas, Equal Costs Multipath (ECMP), and virtual links with proofs of their correctness. Furthermore, together with a loop-free routing technique for link-state routing, SBR guarantees the consistency of every route against a single link failure, even during the path recomputation phase, until it converges to the new shortest paths.
ER -