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
Apresentamos um esquema de recuperação baseado em Self-protected Spanning Tree (SST), que se recupera de falhas por si só. No esquema de recuperação, os links recebem aniversários para indicar a ordem em que devem ser considerados para adição ao SST. O mecanismo de recuperação, denominado mecanismo de substituição de link baseado em aniversário (BLRM), é capaz de transformar um SST em uma nova árvore geradora, substituindo alguns links de árvore por alguns links não-árvore do mesmo aniversário, o que garante a conectividade da rede após qualquer único. falha de link ou nó. Primeiro, provamos teoricamente que o esquema de recuperação baseado em SST pode ser aplicado a redes arbitrárias conectadas de duas arestas ou a duas redes conectadas. Em seguida, o tempo de recuperação do BLRM é analisado e avaliado usando Ethernet, e os resultados da simulação demonstram a eficácia do BLRM em alcançar uma recuperação rápida. Além disso, ressaltamos que o BLRM fornece um novo mecanismo de balanceamento de carga, alterando rapidamente a topologia do SST.
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
Depeng JIN, Wentao CHEN, Li SU, Yong LI, Lieguang ZENG, "Self-Protected Spanning Tree Based Recovery Scheme to Protect against Single Failure" in IEICE TRANSACTIONS on Communications,
vol. E92-B, no. 3, pp. 909-921, March 2009, doi: 10.1587/transcom.E92.B.909.
Abstract: We present a recovery scheme based on Self-protected Spanning Tree (SST), which recovers from failure all by itself. In the recovery scheme, the links are assigned birthdays to denote the order in which they are to be considered for adding to the SST. The recovery mechanism, named Birthday-based Link Replacing Mechanism (BLRM), is able to transform a SST into a new spanning tree by replacing some tree links with some non-tree links of the same birthday, which ensures the network connectivity after any single link or node failure. First, we theoretically prove that the SST-based recovery scheme can be applied to arbitrary two-edge connected or two connected networks. Then, the recovery time of BLRM is analyzed and evaluated using Ethernet, and the simulation results demonstrate the effectiveness of BLRM in achieving fast recovery. Also, we point out that BLRM provides a novel load balancing mechanism by fast changing the topology of the SST.
URL: https://global.ieice.org/en_transactions/communications/10.1587/transcom.E92.B.909/_p
Copiar
@ARTICLE{e92-b_3_909,
author={Depeng JIN, Wentao CHEN, Li SU, Yong LI, Lieguang ZENG, },
journal={IEICE TRANSACTIONS on Communications},
title={Self-Protected Spanning Tree Based Recovery Scheme to Protect against Single Failure},
year={2009},
volume={E92-B},
number={3},
pages={909-921},
abstract={We present a recovery scheme based on Self-protected Spanning Tree (SST), which recovers from failure all by itself. In the recovery scheme, the links are assigned birthdays to denote the order in which they are to be considered for adding to the SST. The recovery mechanism, named Birthday-based Link Replacing Mechanism (BLRM), is able to transform a SST into a new spanning tree by replacing some tree links with some non-tree links of the same birthday, which ensures the network connectivity after any single link or node failure. First, we theoretically prove that the SST-based recovery scheme can be applied to arbitrary two-edge connected or two connected networks. Then, the recovery time of BLRM is analyzed and evaluated using Ethernet, and the simulation results demonstrate the effectiveness of BLRM in achieving fast recovery. Also, we point out that BLRM provides a novel load balancing mechanism by fast changing the topology of the SST.},
keywords={},
doi={10.1587/transcom.E92.B.909},
ISSN={1745-1345},
month={March},}
Copiar
TY - JOUR
TI - Self-Protected Spanning Tree Based Recovery Scheme to Protect against Single Failure
T2 - IEICE TRANSACTIONS on Communications
SP - 909
EP - 921
AU - Depeng JIN
AU - Wentao CHEN
AU - Li SU
AU - Yong LI
AU - Lieguang ZENG
PY - 2009
DO - 10.1587/transcom.E92.B.909
JO - IEICE TRANSACTIONS on Communications
SN - 1745-1345
VL - E92-B
IS - 3
JA - IEICE TRANSACTIONS on Communications
Y1 - March 2009
AB - We present a recovery scheme based on Self-protected Spanning Tree (SST), which recovers from failure all by itself. In the recovery scheme, the links are assigned birthdays to denote the order in which they are to be considered for adding to the SST. The recovery mechanism, named Birthday-based Link Replacing Mechanism (BLRM), is able to transform a SST into a new spanning tree by replacing some tree links with some non-tree links of the same birthday, which ensures the network connectivity after any single link or node failure. First, we theoretically prove that the SST-based recovery scheme can be applied to arbitrary two-edge connected or two connected networks. Then, the recovery time of BLRM is analyzed and evaluated using Ethernet, and the simulation results demonstrate the effectiveness of BLRM in achieving fast recovery. Also, we point out that BLRM provides a novel load balancing mechanism by fast changing the topology of the SST.
ER -