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
Memandangkan kerosakan komponen yang berlaku di tempat sewenang-wenangnya (terutamanya pada pautan) menjejaskan prestasi dan kebolehpercayaan rangkaian secara serius, multikomputer yang beroperasi dalam persekitaran yang keras harus direka bentuk untuk menjamin misi rangkaian biasa dengan kehadiran kerosakan tersebut. Satu penyelesaian sehingga akhir ialah skim penghalaan toleransi kesalahan, yang membolehkan mesej selamat sampai ke destinasi mereka mengelakkan pautan gagal apabila penghantaran mesej disekat oleh kesalahan tertentu. Dalam kertas kerja, kami membangunkan algoritma penghalaan toleransi kesalahan dengan kebebasan kebuntuan dalam n-rangkaian jaringan berdimensi, dan mengesahkan kecekapan dan keberkesanannya melalui simulasi yang betul. Aspek toleransi kesalahan diterima pakai dengan menambahkan penyesuaian separa dan melencong ke e-algoritma kiub, semasa menggunakan penghalaan lubang cacing untuk kaedah penghalaan tulang belakang. Fenomena kebuntuan yang berlaku akibat penyesuaiannya dihapuskan dengan mengklasifikasikan saluran fizikal kepada beberapa saluran maya.
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
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
Salinan
@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},}
Salinan
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 -