Segment-based routing: an efficient fault-tolerant routing algorithm for meshes and tori

Abstract

Abstract

Evaluating the Performance of Adaptive Fault-Tolerant Routing Algorithms for Wormhole-Switched Mesh Interconnect Networks

“…Up to 10% of faults were simulated in the experiments. In the literature, fixed-length message with 32, 64, or 100 flits are commonly considered [1,[3][4][5][6][7]9]. We have used 100-flit messages in this study.…”

“…We consider only node failure assuming that a faulty node is randomly generated subject to the fault model. We also assume that faults are non-malicious, fault patterns are static [1][2][3][4][5][6][7] and do not disconnect the network. Therefore only non-faulty nodes generate messages.…”

“…Further, messages are destined only to faultfree nodes. These assumptions are commonly made in fault analysis in the literature [1,[3][4][5][6][8][9][10]. For each given number of faults, 1000 fault patterns were randomly selected for simulation.…”

“…The former is referred to as a node failure, and the latter as a link failure [2]. On a node failure occasion, all physical links incident on the failed node are also marked faulty at adjacent routers [1,2,[3][4][5][6]. Adjacent faulty nodes are coalesced into fault regions, which may lead to different patterns of failed components.…”

“…Another issue in designing routing algorithm is designing a fault-tolerant mechanism that can route messages in the presence of faulty components. An extensive amount of work has been done on fault-tolerant routing in mesh networks [1,[3][4][5][6][7]. Boura and Das [7] proposed an adaptive deadlock-free fault-tolerant routing algorithm for meshes.…”