scholarly journals Fault-tolerant wormhole routing algorithm for mesh networks

2000 ◽  
Vol 147 (1) ◽  
pp. 9 ◽  
Author(s):  
P.-H. Sui ◽  
S.-D. Wang
Keyword(s):  
Mesh Networks ◽  
Fault Tolerant ◽  
Routing Algorithm ◽  
Wormhole Routing

A NEW FAULT-TOLERANT BROADCAST ROUTING ALGORITHM ON MESH NETWORKS

2010 ◽  
Vol 11 (03n04) ◽  
pp. 175-187 ◽  
Author(s):  
GAOCAI WANG ◽  
JIANER CHEN ◽  
CHUANG LIN
Keyword(s):  
Failure Probability ◽  
Mesh Networks ◽  
Fault Tolerant ◽  
Routing Algorithm ◽  
Success Probability ◽  
Network Size ◽  
Large Size ◽  
Broadcast Routing ◽  
Network Topologies ◽  
High Success Probability

Mesh networks are a kind of very important network topologies in massively multicomputer parallel systems. One-to-all or broadcast communication is one of the most important routing patterns and can be applied in many important applications. With the continuous increment in network size, routing in large size mesh networks with faults is unavoidable. In this paper, we propose a new fault-tolerant, local-information-based, and distributed broadcast routing algorithm based on the concept of k-submesh in all-port mesh networks. We suppose that each node has independent failure probability, under the assumption, we analyze the fault tolerance of our algorithm. We show that our routing algorithm is highly fault tolerant and has a high success probability to broadcast messages. For example, we formally prove that if the node failure probability is bounded by 0.12%, our broadcast routing algorithm works successfully with probability at least 99%. Simulation results show that our algorithm is efficient and effective in practice and theory, and the time steps of our algorithm is very close to the optimum.

scholarly journals Adaptive Fault-Tolerant Routing in 2D Mesh with Cracky Rectangular Model

2014 ◽  
Vol 2014 ◽  
pp. 1-10
Author(s):  
Yi Yang ◽  
Meirun Chen ◽  
Hao Li ◽  
Lian Li
Keyword(s):  
Mesh Networks ◽  
Fault Tolerant ◽  
Routing Algorithm ◽  
Formal Proof ◽  
Fault Recovery ◽  
Two Dimensional ◽  
New Model ◽  
Fully Adaptive ◽  
Block Construction ◽  
Rectangular Model

This paper mainly focuses on routing in two-dimensional mesh networks. We propose a novel faulty block model, which is cracky rectangular block, for fault-tolerant adaptive routing. All the faulty nodes and faulty links are surrounded in this type of block, which is a convex structure, in order to avoid routing livelock. Additionally, the model constructs the interior spanning forest for each block in order to keep in touch with the nodes inside of each block. The procedure for block construction is dynamically and totally distributed. The construction algorithm is simple and ease of implementation. And this is a fully adaptive block which will dynamically adjust its scale in accordance with the situation of networks, either the fault emergence or the fault recovery, without shutdown of the system. Based on this model, we also develop a distributed fault-tolerant routing algorithm. Then we give the formal proof for this algorithm to guarantee that messages will always reach their destinations if and only if the destination nodes keep connecting with these mesh networks. So the new model and routing algorithm maximize the availability of the nodes in networks. This is a noticeable overall improvement of fault tolerability of the system.

Sign in / Sign up

Export Citation Format

Share Document