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
임의의 위치(주로 링크)에서 발생하는 구성 요소 오류는 네트워크 성능과 신뢰성에 심각한 영향을 미치므로 열악한 환경에서 작동하는 다중 컴퓨터는 이러한 오류가 있는 경우에도 정상적인 네트워크 임무를 보장하도록 설계되어야 합니다. 최종 해결책 중 하나는 내결함성 라우팅 체계입니다. 이를 통해 특정 오류로 인해 메시지 전송이 차단될 때 실패한 링크를 피하고 메시지가 목적지에 안전하게 도달할 수 있습니다. 본 논문에서는 교착 상태가 없는 내결함성 라우팅 알고리즘을 개발합니다. n- 차원 메시 네트워크를 구축하고 적절한 시뮬레이션을 통해 효율성과 효과를 검증합니다. 부분 적응성을 추가하고 우회하는 방식으로 내결함성 측면을 채택합니다. e-큐브 알고리즘, 백본 라우팅 방법으로 웜홀 라우팅을 사용합니다. 물리 채널을 두 개의 가상 채널로 분류함으로써 적응성으로 인해 발생하는 교착 상태 현상을 제거합니다.
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.
부
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
부
@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},}
부
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 -