IEICE TRANSACTIONS on Information
A Fault-Tolerant Deadlock-Free Routing Algorithm in a Meshed Network
Summary :
Since components faults occurring at arbitrary places (primarily on the links) affect seriously network performance and reliability, the multicomputers operating in harsh environments should be designed to guarantee normal network-missions in presence of those faults. One solution to the end is a fault-tolerant routing scheme, which enables messages to safely reach their destinations avoiding failed links when transmission of messages is blocked by certain faults. In the paper, we develop a fault-tolerant routing algorithm with deadlock freedom in an n-dimensional meshed network, and validate its efficiency and effectiveness through proper simulations. The aspects of fault-tolerance is adopted by appending partial-adaptiveness and detouring to the e-cube algorithm, while using a wormhole routing for the backbone routing method. The phenomenon of deadlock incurred due to its adaptiveness is eliminated by classifying a physical channel into a couple of virtual channels.
- Publication
- IEICE TRANSACTIONS on Information Vol.E85-D No.4 pp.722-726
- Publication Date
- 2002/04/01
- Publicized
- Online ISSN
- DOI
- Type of Manuscript
- PAPER
- Category
- Fault Tolerance
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
Deogkyoo LEE, Daekeun MOON, Ilgu YUN, Hagbae KIM, "A Fault-Tolerant Deadlock-Free Routing Algorithm in a Meshed Network" in IEICE TRANSACTIONS on Information,
vol. E85-D, no. 4, pp. 722-726, April 2002, doi: .
Abstract: Since components faults occurring at arbitrary places (primarily on the links) affect seriously network performance and reliability, the multicomputers operating in harsh environments should be designed to guarantee normal network-missions in presence of those faults. One solution to the end is a fault-tolerant routing scheme, which enables messages to safely reach their destinations avoiding failed links when transmission of messages is blocked by certain faults. In the paper, we develop a fault-tolerant routing algorithm with deadlock freedom in an n-dimensional meshed network, and validate its efficiency and effectiveness through proper simulations. The aspects of fault-tolerance is adopted by appending partial-adaptiveness and detouring to the e-cube algorithm, while using a wormhole routing for the backbone routing method. The phenomenon of deadlock incurred due to its adaptiveness is eliminated by classifying a physical channel into a couple of virtual channels.
URL: https://global.ieice.org/en_transactions/information/10.1587/e85-d_4_722/_p
Copy
@ARTICLE{e85-d_4_722,
author={Deogkyoo LEE, Daekeun MOON, Ilgu YUN, Hagbae KIM, },
journal={IEICE TRANSACTIONS on Information},
title={A Fault-Tolerant Deadlock-Free Routing Algorithm in a Meshed Network},
year={2002},
volume={E85-D},
number={4},
pages={722-726},
abstract={Since components faults occurring at arbitrary places (primarily on the links) affect seriously network performance and reliability, the multicomputers operating in harsh environments should be designed to guarantee normal network-missions in presence of those faults. One solution to the end is a fault-tolerant routing scheme, which enables messages to safely reach their destinations avoiding failed links when transmission of messages is blocked by certain faults. In the paper, we develop a fault-tolerant routing algorithm with deadlock freedom in an n-dimensional meshed network, and validate its efficiency and effectiveness through proper simulations. The aspects of fault-tolerance is adopted by appending partial-adaptiveness and detouring to the e-cube algorithm, while using a wormhole routing for the backbone routing method. The phenomenon of deadlock incurred due to its adaptiveness is eliminated by classifying a physical channel into a couple of virtual channels.},
keywords={},
doi={},
ISSN={},
month={April},}
Copy
TY - JOUR
TI - A Fault-Tolerant Deadlock-Free Routing Algorithm in a Meshed Network
T2 - IEICE TRANSACTIONS on Information
SP - 722
EP - 726
AU - Deogkyoo LEE
AU - Daekeun MOON
AU - Ilgu YUN
AU - Hagbae KIM
PY - 2002
DO -
JO - IEICE TRANSACTIONS on Information
SN -
VL - E85-D
IS - 4
JA - IEICE TRANSACTIONS on Information
Y1 - April 2002
AB - Since components faults occurring at arbitrary places (primarily on the links) affect seriously network performance and reliability, the multicomputers operating in harsh environments should be designed to guarantee normal network-missions in presence of those faults. One solution to the end is a fault-tolerant routing scheme, which enables messages to safely reach their destinations avoiding failed links when transmission of messages is blocked by certain faults. In the paper, we develop a fault-tolerant routing algorithm with deadlock freedom in an n-dimensional meshed network, and validate its efficiency and effectiveness through proper simulations. The aspects of fault-tolerance is adopted by appending partial-adaptiveness and detouring to the e-cube algorithm, while using a wormhole routing for the backbone routing method. The phenomenon of deadlock incurred due to its adaptiveness is eliminated by classifying a physical channel into a couple of virtual channels.
ER -
English
