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
Kami membentangkan skim pemulihan berdasarkan Self-protected Spanning Tree (SST), yang pulih daripada kegagalan dengan sendirinya. Dalam skim pemulihan, pautan diberikan hari lahir untuk menunjukkan susunan yang akan dipertimbangkan untuk menambah SST. Mekanisme pemulihan, yang dinamakan Mekanisme Penggantian Pautan berasaskan Hari Lahir (BLRM), mampu mengubah SST menjadi pokok rentang baharu dengan menggantikan beberapa pautan pokok dengan beberapa pautan bukan pokok pada hari lahir yang sama, yang memastikan sambungan rangkaian selepas mana-mana pautan atau kegagalan nod. Pertama, kami secara teorinya membuktikan bahawa skim pemulihan berasaskan SST boleh digunakan pada rangkaian bersambung dua tepi atau dua rangkaian bersambung sewenang-wenangnya. Kemudian, masa pemulihan BLRM dianalisis dan dinilai menggunakan Ethernet, dan hasil simulasi menunjukkan keberkesanan BLRM dalam mencapai pemulihan pantas. Selain itu, kami menegaskan bahawa BLRM menyediakan mekanisme pengimbangan beban baru dengan menukar topologi SST dengan pantas.
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.
Salinan
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
Salinan
@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},}
Salinan
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 -