A probabilistic approach to fault tolerant broadcast routing algorithms on mesh networks

2004 ◽  
Author(s):  
GaoCai Wang ◽  
Jianer Chen ◽  
Guojun Wang
Keyword(s):  
Mesh Networks ◽  
Fault Tolerant ◽  
Probabilistic Approach ◽  
Routing Algorithms ◽  
Broadcast 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.

Sign in / Sign up

Export Citation Format

Share Document