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
Propomos um esquema prático de proteção de enlace, denominado Single Backup-table Rerouting (SBR), como uma extensão do Open Shortest Path First (OSPF). O SBR protege contra qualquer falha de link único assim que a falha ocorre se a topologia de cada área no OSPF estiver conectada por dois links. Um algoritmo eficiente para calcular um conjunto de tabelas de backup é fornecido para redes com custos de enlace simétricos. A principal característica do SBR é que o processo de backup é totalmente distribuído, portanto nenhuma troca de mensagens é necessária e a modificação do OSPF é mínima. O OSPF é estendido com o seguinte: apenas uma tabela de roteamento de backup extra, um sinalizador de 2 bits em cada pacote de tráfego e um processo para lidar com a tabela de backup. Não há alterações no formato da mensagem do OSPF. Neste artigo, apresentamos o esquema prático de proteção de enlace ajustando o SBR em vários mecanismos específicos do OSPF, como áreas OSPF, Equal Costs Multipath (ECMP) e enlaces virtuais com provas de sua correção. Além disso, juntamente com uma técnica de roteamento sem loop para roteamento link-state, o SBR garante a consistência de cada rota contra uma única falha de link, mesmo durante a fase de recomputação do caminho, até convergir para os novos caminhos mais curtos.
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.
Copiar
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
Copiar
@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},}
Copiar
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 -