A fault-tolerant deadlock-free routing algorithm in a meshed network

Deogkyoo Lee, Daekeun Moon, Ilgu Yun, Hagbae Kim

Research output: Contribution to journalArticle

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.

Original languageEnglish
Pages (from-to)722-726
Number of pages5
JournalIEICE Transactions on Information and Systems
VolumeE85-D
Issue number4
Publication statusPublished - 2002 Jan 1

Fingerprint

Routing algorithms
Network performance
Fault tolerance

All Science Journal Classification (ASJC) codes

  • Software
  • Hardware and Architecture
  • Computer Vision and Pattern Recognition
  • Electrical and Electronic Engineering
  • Artificial Intelligence

Cite this

Lee, Deogkyoo ; Moon, Daekeun ; Yun, Ilgu ; Kim, Hagbae. / A fault-tolerant deadlock-free routing algorithm in a meshed network. In: IEICE Transactions on Information and Systems. 2002 ; Vol. E85-D, No. 4. pp. 722-726.
@article{1555e2328ba94b31877c7d36c1daac1f,
title = "A fault-tolerant deadlock-free routing algorithm in a meshed network",
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.",
author = "Deogkyoo Lee and Daekeun Moon and Ilgu Yun and Hagbae Kim",
year = "2002",
month = "1",
day = "1",
language = "English",
volume = "E85-D",
pages = "722--726",
journal = "IEICE Transactions on Information and Systems",
issn = "0916-8532",
publisher = "Maruzen Co., Ltd/Maruzen Kabushikikaisha",
number = "4",

}

A fault-tolerant deadlock-free routing algorithm in a meshed network. / Lee, Deogkyoo; Moon, Daekeun; Yun, Ilgu; Kim, Hagbae.

In: IEICE Transactions on Information and Systems, Vol. E85-D, No. 4, 01.01.2002, p. 722-726.

Research output: Contribution to journalArticle

TY - JOUR

T1 - A fault-tolerant deadlock-free routing algorithm in a meshed network

AU - Lee, Deogkyoo

AU - Moon, Daekeun

AU - Yun, Ilgu

AU - Kim, Hagbae

PY - 2002/1/1

Y1 - 2002/1/1

N2 - 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.

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.

UR - http://www.scopus.com/inward/record.url?scp=0036538294&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0036538294&partnerID=8YFLogxK

M3 - Article

AN - SCOPUS:0036538294

VL - E85-D

SP - 722

EP - 726

JO - IEICE Transactions on Information and Systems

JF - IEICE Transactions on Information and Systems

SN - 0916-8532

IS - 4

ER -