IEICE TRANSACTIONS on Communications
A Coordination Based Restoring Algorithm for High Speed Broadband Networks
Summary :
A highly reliable and available network which automatically can restore itself from failures is an important concept for the future high capacity broadband networks. Self-healing algorithm, restoring the failed VPs (Virtual Paths) in the backbone ATM networks, is an indispensable technique to meet these requirements. In this paper we propose a coordination-based restoring self-healing algorithm called C-TRUS, which meets different requirements of service classes of survivability by using a simple rerouting and capacity reserving protocols. The simulation results show that the proposed algorithm can restore VPs quickly and improve the restoration time in case of multi-failures by using network resources very efficiently. Furthermore, C-TRUS outperforms the combination method in both restoration ratio and restoration time. In addition, the significant improvement of restoration ratio in the multi-failure scenario has been achieved.
- Publication
- IEICE TRANSACTIONS on Communications Vol.E83-B No.7 pp.1517-1526
- Publication Date
- 2000/07/25
- Publicized
- Online ISSN
- DOI
- Type of Manuscript
- PAPER
- Category
- Network
Authors
Keyword
Latest Issue
Copyrights notice of machine-translated contents
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.
Cite this
Copy
Ardian GRECA, Kiyoshi NAKAGAWA, "A Coordination Based Restoring Algorithm for High Speed Broadband Networks" in IEICE TRANSACTIONS on Communications,
vol. E83-B, no. 7, pp. 1517-1526, July 2000, doi: .
Abstract: A highly reliable and available network which automatically can restore itself from failures is an important concept for the future high capacity broadband networks. Self-healing algorithm, restoring the failed VPs (Virtual Paths) in the backbone ATM networks, is an indispensable technique to meet these requirements. In this paper we propose a coordination-based restoring self-healing algorithm called C-TRUS, which meets different requirements of service classes of survivability by using a simple rerouting and capacity reserving protocols. The simulation results show that the proposed algorithm can restore VPs quickly and improve the restoration time in case of multi-failures by using network resources very efficiently. Furthermore, C-TRUS outperforms the combination method in both restoration ratio and restoration time. In addition, the significant improvement of restoration ratio in the multi-failure scenario has been achieved.
URL: https://global.ieice.org/en_transactions/communications/10.1587/e83-b_7_1517/_p
Copy
@ARTICLE{e83-b_7_1517,
author={Ardian GRECA, Kiyoshi NAKAGAWA, },
journal={IEICE TRANSACTIONS on Communications},
title={A Coordination Based Restoring Algorithm for High Speed Broadband Networks},
year={2000},
volume={E83-B},
number={7},
pages={1517-1526},
abstract={A highly reliable and available network which automatically can restore itself from failures is an important concept for the future high capacity broadband networks. Self-healing algorithm, restoring the failed VPs (Virtual Paths) in the backbone ATM networks, is an indispensable technique to meet these requirements. In this paper we propose a coordination-based restoring self-healing algorithm called C-TRUS, which meets different requirements of service classes of survivability by using a simple rerouting and capacity reserving protocols. The simulation results show that the proposed algorithm can restore VPs quickly and improve the restoration time in case of multi-failures by using network resources very efficiently. Furthermore, C-TRUS outperforms the combination method in both restoration ratio and restoration time. In addition, the significant improvement of restoration ratio in the multi-failure scenario has been achieved.},
keywords={},
doi={},
ISSN={},
month={July},}
Copy
TY - JOUR
TI - A Coordination Based Restoring Algorithm for High Speed Broadband Networks
T2 - IEICE TRANSACTIONS on Communications
SP - 1517
EP - 1526
AU - Ardian GRECA
AU - Kiyoshi NAKAGAWA
PY - 2000
DO -
JO - IEICE TRANSACTIONS on Communications
SN -
VL - E83-B
IS - 7
JA - IEICE TRANSACTIONS on Communications
Y1 - July 2000
AB - A highly reliable and available network which automatically can restore itself from failures is an important concept for the future high capacity broadband networks. Self-healing algorithm, restoring the failed VPs (Virtual Paths) in the backbone ATM networks, is an indispensable technique to meet these requirements. In this paper we propose a coordination-based restoring self-healing algorithm called C-TRUS, which meets different requirements of service classes of survivability by using a simple rerouting and capacity reserving protocols. The simulation results show that the proposed algorithm can restore VPs quickly and improve the restoration time in case of multi-failures by using network resources very efficiently. Furthermore, C-TRUS outperforms the combination method in both restoration ratio and restoration time. In addition, the significant improvement of restoration ratio in the multi-failure scenario has been achieved.
ER -
English
