IEICE TRANSACTIONS on Communications
Fast Failure Restoration Algorithm with Reduced Messages Based on Flooding Mechanism
Summary :
A highly reliable network which can restore itself from network failures is one important concept for the future high capacity broadband network. In such self-healing network, flooding based failure-restoration algorithm is used to locate new routes and then to reroute failure traffic to that routes automatically when network failures such as link or node failures occur. Since the speed of this algorithm is degraded by the large amount of restoration messages produced by the process, such large volume messages should be reduced. In this paper, the scheme will be proposed, which reduces the large volume messages and efficiently selects alternative routes. In this scheme, the Message Wall will be used to filter useless restoration messages at the tandem nodes and Multi-Message Selecting method will be used to rapidly select a group of link-disjointed alternative routes from the feasible ones in each Flooding Wave sequence. The simulation results show that restoration messages are dramatically reduced and adequate alternative routes can be quickly found out.
- Publication
- IEICE TRANSACTIONS on Communications Vol.E80-B No.4 pp.564-572
- Publication Date
- 1997/04/25
- Publicized
- Online ISSN
- DOI
- Type of Manuscript
- Category
- Communication Networks and Services
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
Komwut WIPUSITWARAKUN, Hideki TODE, Hiromasa IKEDA, "Fast Failure Restoration Algorithm with Reduced Messages Based on Flooding Mechanism" in IEICE TRANSACTIONS on Communications,
vol. E80-B, no. 4, pp. 564-572, April 1997, doi: .
Abstract: A highly reliable network which can restore itself from network failures is one important concept for the future high capacity broadband network. In such self-healing network, flooding based failure-restoration algorithm is used to locate new routes and then to reroute failure traffic to that routes automatically when network failures such as link or node failures occur. Since the speed of this algorithm is degraded by the large amount of restoration messages produced by the process, such large volume messages should be reduced. In this paper, the scheme will be proposed, which reduces the large volume messages and efficiently selects alternative routes. In this scheme, the Message Wall will be used to filter useless restoration messages at the tandem nodes and Multi-Message Selecting method will be used to rapidly select a group of link-disjointed alternative routes from the feasible ones in each Flooding Wave sequence. The simulation results show that restoration messages are dramatically reduced and adequate alternative routes can be quickly found out.
URL: https://global.ieice.org/en_transactions/communications/10.1587/e80-b_4_564/_p
Copy
@ARTICLE{e80-b_4_564,
author={Komwut WIPUSITWARAKUN, Hideki TODE, Hiromasa IKEDA, },
journal={IEICE TRANSACTIONS on Communications},
title={Fast Failure Restoration Algorithm with Reduced Messages Based on Flooding Mechanism},
year={1997},
volume={E80-B},
number={4},
pages={564-572},
abstract={A highly reliable network which can restore itself from network failures is one important concept for the future high capacity broadband network. In such self-healing network, flooding based failure-restoration algorithm is used to locate new routes and then to reroute failure traffic to that routes automatically when network failures such as link or node failures occur. Since the speed of this algorithm is degraded by the large amount of restoration messages produced by the process, such large volume messages should be reduced. In this paper, the scheme will be proposed, which reduces the large volume messages and efficiently selects alternative routes. In this scheme, the Message Wall will be used to filter useless restoration messages at the tandem nodes and Multi-Message Selecting method will be used to rapidly select a group of link-disjointed alternative routes from the feasible ones in each Flooding Wave sequence. The simulation results show that restoration messages are dramatically reduced and adequate alternative routes can be quickly found out.},
keywords={},
doi={},
ISSN={},
month={April},}
Copy
TY - JOUR
TI - Fast Failure Restoration Algorithm with Reduced Messages Based on Flooding Mechanism
T2 - IEICE TRANSACTIONS on Communications
SP - 564
EP - 572
AU - Komwut WIPUSITWARAKUN
AU - Hideki TODE
AU - Hiromasa IKEDA
PY - 1997
DO -
JO - IEICE TRANSACTIONS on Communications
SN -
VL - E80-B
IS - 4
JA - IEICE TRANSACTIONS on Communications
Y1 - April 1997
AB - A highly reliable network which can restore itself from network failures is one important concept for the future high capacity broadband network. In such self-healing network, flooding based failure-restoration algorithm is used to locate new routes and then to reroute failure traffic to that routes automatically when network failures such as link or node failures occur. Since the speed of this algorithm is degraded by the large amount of restoration messages produced by the process, such large volume messages should be reduced. In this paper, the scheme will be proposed, which reduces the large volume messages and efficiently selects alternative routes. In this scheme, the Message Wall will be used to filter useless restoration messages at the tandem nodes and Multi-Message Selecting method will be used to rapidly select a group of link-disjointed alternative routes from the feasible ones in each Flooding Wave sequence. The simulation results show that restoration messages are dramatically reduced and adequate alternative routes can be quickly found out.
ER -
English
